From 44f0d050e112a77b5dfdc7663bbc4886337bc44a Mon Sep 17 00:00:00 2001 From: bunnyxt-ci Date: Mon, 16 Oct 2023 00:08:34 +0000 Subject: [PATCH] ci: update problems_all.json --- problems_all.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems_all.json b/problems_all.json index b974e4b..d74ec29 100644 --- a/problems_all.json +++ b/problems_all.json @@ -1 +1 @@ -{"1": {"acRate": 50.844667211446726, "difficulty": "Easy", "likes": 52310, "dislikes": 1715, "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": 11096300, "totalSubmissionRaw": 21823937}, "2": {"acRate": 41.36203151718249, "difficulty": "Medium", "likes": 28663, "dislikes": 5530, "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": 3978317, "totalSubmissionRaw": 9618284}, "3": {"acRate": 34.05845924316061, "difficulty": "Medium", "likes": 37463, "dislikes": 1690, "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": 5008495, "totalSubmissionRaw": 14705599}, "4": {"acRate": 38.14093607282894, "difficulty": "Hard", "likes": 26438, "dislikes": 2901, "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": false, "totalAcceptedRaw": 2191935, "totalSubmissionRaw": 5746937}, "5": {"acRate": 32.824972562344435, "difficulty": "Medium", "likes": 27432, "dislikes": 1628, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2640034, "totalSubmissionRaw": 8042743}, "6": {"acRate": 46.067846700155826, "difficulty": "Medium", "likes": 6825, "dislikes": 13474, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1131383, "totalSubmissionRaw": 2455913}, "7": {"acRate": 27.89912622433875, "difficulty": "Medium", "likes": 11939, "dislikes": 13008, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2838066, "totalSubmissionRaw": 10172612}, "8": {"acRate": 16.78410053052285, "difficulty": "Medium", "likes": 3897, "dislikes": 12102, "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": 1351734, "totalSubmissionRaw": 8053713}, "9": {"acRate": 54.586023696773665, "difficulty": "Easy", "likes": 11277, "dislikes": 2609, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3744379, "totalSubmissionRaw": 6859614}, "10": {"acRate": 27.859257864538932, "difficulty": "Hard", "likes": 11475, "dislikes": 1923, "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": 864088, "totalSubmissionRaw": 3101625}, "11": {"acRate": 54.217261076209425, "difficulty": "Medium", "likes": 26941, "dislikes": 1481, "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": 2424625, "totalSubmissionRaw": 4472049}, "12": {"acRate": 63.225579813421305, "difficulty": "Medium", "likes": 6408, "dislikes": 5327, "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": 1103284, "totalSubmissionRaw": 1744996}, "13": {"acRate": 59.56120655557141, "difficulty": "Easy", "likes": 12572, "dislikes": 743, "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": 3062852, "totalSubmissionRaw": 5142359}, "14": {"acRate": 41.643441632755426, "difficulty": "Easy", "likes": 16059, "dislikes": 4247, "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": 2762907, "totalSubmissionRaw": 6634673}, "15": {"acRate": 33.39539815256639, "difficulty": "Medium", "likes": 28768, "dislikes": 2587, "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": 3001010, "totalSubmissionRaw": 8986301}, "16": {"acRate": 45.488436801947906, "difficulty": "Medium", "likes": 9893, "dislikes": 513, "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": 1099248, "totalSubmissionRaw": 2416541}, "17": {"acRate": 58.75378707345593, "difficulty": "Medium", "likes": 17330, "dislikes": 905, "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": 1768627, "totalSubmissionRaw": 3010237}, "18": {"acRate": 35.776875761725705, "difficulty": "Medium", "likes": 10566, "dislikes": 1252, "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": 826052, "totalSubmissionRaw": 2308896}, "19": {"acRate": 42.74758320237696, "difficulty": "Medium", "likes": 17350, "dislikes": 715, "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": 2259954, "totalSubmissionRaw": 5286742}, "20": {"acRate": 40.18453008910201, "difficulty": "Easy", "likes": 22321, "dislikes": 1508, "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": 3860864, "totalSubmissionRaw": 9607834}, "21": {"acRate": 63.274880314889835, "difficulty": "Easy", "likes": 20259, "dislikes": 1888, "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": 3603469, "totalSubmissionRaw": 5694944}, "22": {"acRate": 73.50945856265491, "difficulty": "Medium", "likes": 19811, "dislikes": 812, "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": 1567351, "totalSubmissionRaw": 2132175}, "23": {"acRate": 51.08423145556596, "difficulty": "Hard", "likes": 18450, "dislikes": 662, "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": 1764572, "totalSubmissionRaw": 3454241}, "24": {"acRate": 63.20102569253206, "difficulty": "Medium", "likes": 11301, "dislikes": 411, "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": 1233340, "totalSubmissionRaw": 1951458}, "25": {"acRate": 56.751543015266215, "difficulty": "Hard", "likes": 12690, "dislikes": 625, "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": 787543, "totalSubmissionRaw": 1387704}, "26": {"acRate": 53.38428068984709, "difficulty": "Easy", "likes": 12874, "dislikes": 16987, "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": 3504811, "totalSubmissionRaw": 6565267}, "27": {"acRate": 54.81327370727951, "difficulty": "Easy", "likes": 1356, "dislikes": 1922, "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": 2220976, "totalSubmissionRaw": 4051904}, "28": {"acRate": 40.67054977802471, "difficulty": "Easy", "likes": 4914, "dislikes": 278, "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": 2024766, "totalSubmissionRaw": 4978464}, "29": {"acRate": 17.111580178024663, "difficulty": "Medium", "likes": 4710, "dislikes": 14206, "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": 654533, "totalSubmissionRaw": 3825082}, "30": {"acRate": 31.534199060953426, "difficulty": "Hard", "likes": 1408, "dislikes": 132, "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": 380205, "totalSubmissionRaw": 1205691}, "31": {"acRate": 38.67873359110315, "difficulty": "Medium", "likes": 17107, "dislikes": 4357, "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": 1163797, "totalSubmissionRaw": 3008882}, "32": {"acRate": 33.28869891766985, "difficulty": "Hard", "likes": 11794, "dislikes": 367, "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": 662523, "totalSubmissionRaw": 1990239}, "33": {"acRate": 40.03495137090239, "difficulty": "Medium", "likes": 24535, "dislikes": 1434, "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": 2366488, "totalSubmissionRaw": 5911061}, "34": {"acRate": 43.38670596210644, "difficulty": "Medium", "likes": 19253, "dislikes": 464, "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": 1783064, "totalSubmissionRaw": 4109702}, "35": {"acRate": 44.53414645863567, "difficulty": "Easy", "likes": 14906, "dislikes": 646, "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": 2456575, "totalSubmissionRaw": 5516163}, "36": {"acRate": 58.70984222528761, "difficulty": "Medium", "likes": 9797, "dislikes": 1011, "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": 1264058, "totalSubmissionRaw": 2153061}, "37": {"acRate": 59.3939824973359, "difficulty": "Hard", "likes": 8876, "dislikes": 230, "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": 509418, "totalSubmissionRaw": 857695}, "38": {"acRate": 53.36058932189288, "difficulty": "Medium", "likes": 3580, "dislikes": 7419, "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": 835701, "totalSubmissionRaw": 1566139}, "39": {"acRate": 70.07959304437045, "difficulty": "Medium", "likes": 17657, "dislikes": 359, "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": 1655625, "totalSubmissionRaw": 2362497}, "40": {"acRate": 53.78296689903963, "difficulty": "Medium", "likes": 9710, "dislikes": 248, "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": 838470, "totalSubmissionRaw": 1558987}, "41": {"acRate": 37.20347522309779, "difficulty": "Hard", "likes": 15210, "dislikes": 1696, "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": 955897, "totalSubmissionRaw": 2569383}, "42": {"acRate": 60.01506032012116, "difficulty": "Hard", "likes": 29402, "dislikes": 423, "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": 1712732, "totalSubmissionRaw": 2853841}, "43": {"acRate": 39.53708532276188, "difficulty": "Medium", "likes": 6681, "dislikes": 3093, "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": 710398, "totalSubmissionRaw": 1796789}, "44": {"acRate": 27.293288634188457, "difficulty": "Hard", "likes": 7772, "dislikes": 318, "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": 512738, "totalSubmissionRaw": 1878626}, "45": {"acRate": 40.1410202291412, "difficulty": "Medium", "likes": 13519, "dislikes": 482, "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": 1023183, "totalSubmissionRaw": 2548972}, "46": {"acRate": 77.32597947763173, "difficulty": "Medium", "likes": 18029, "dislikes": 289, "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": 1821622, "totalSubmissionRaw": 2355770}, "47": {"acRate": 58.1271229237719, "difficulty": "Medium", "likes": 8138, "dislikes": 137, "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": 840237, "totalSubmissionRaw": 1445521}, "48": {"acRate": 72.7692510269675, "difficulty": "Medium", "likes": 16359, "dislikes": 713, "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": 1458957, "totalSubmissionRaw": 2004914}, "49": {"acRate": 67.05890007233306, "difficulty": "Medium", "likes": 17365, "dislikes": 514, "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": 2277837, "totalSubmissionRaw": 3396766}, "50": {"acRate": 34.05257984750562, "difficulty": "Medium", "likes": 8888, "dislikes": 8729, "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": 1418020, "totalSubmissionRaw": 4164188}, "51": {"acRate": 66.31712940776104, "difficulty": "Hard", "likes": 11480, "dislikes": 239, "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": 615789, "totalSubmissionRaw": 928553}, "52": {"acRate": 72.67933079076248, "difficulty": "Hard", "likes": 3623, "dislikes": 249, "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": 338063, "totalSubmissionRaw": 465144}, "53": {"acRate": 50.369987117751116, "difficulty": "Medium", "likes": 32249, "dislikes": 1347, "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": 3452148, "totalSubmissionRaw": 6853585}, "54": {"acRate": 47.76024537793157, "difficulty": "Medium", "likes": 13639, "dislikes": 1185, "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": 1220309, "totalSubmissionRaw": 2555072}, "55": {"acRate": 38.59852654011849, "difficulty": "Medium", "likes": 17991, "dislikes": 1027, "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": 1583684, "totalSubmissionRaw": 4102974}, "56": {"acRate": 46.59602345002048, "difficulty": "Medium", "likes": 20969, "dislikes": 710, "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": 2074783, "totalSubmissionRaw": 4452703}, "57": {"acRate": 39.444912618493625, "difficulty": "Medium", "likes": 9142, "dislikes": 663, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 857971, "totalSubmissionRaw": 2175115}, "58": {"acRate": 46.49245404310739, "difficulty": "Easy", "likes": 4158, "dislikes": 206, "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": 1395828, "totalSubmissionRaw": 3002268}, "59": {"acRate": 70.20933783671755, "difficulty": "Medium", "likes": 6058, "dislikes": 243, "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": 525083, "totalSubmissionRaw": 747882}, "60": {"acRate": 45.6367443365613, "difficulty": "Hard", "likes": 6301, "dislikes": 459, "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": 356794, "totalSubmissionRaw": 781813}, "61": {"acRate": 36.85018493268234, "difficulty": "Medium", "likes": 8889, "dislikes": 1410, "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": 818073, "totalSubmissionRaw": 2219997}, "62": {"acRate": 63.689955424711684, "difficulty": "Medium", "likes": 15717, "dislikes": 418, "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": 1609557, "totalSubmissionRaw": 2527172}, "63": {"acRate": 40.99992042436335, "difficulty": "Medium", "likes": 8258, "dislikes": 486, "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": 819206, "totalSubmissionRaw": 1998069}, "64": {"acRate": 62.9445131837706, "difficulty": "Medium", "likes": 11773, "dislikes": 152, "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": 1035753, "totalSubmissionRaw": 1645502}, "65": {"acRate": 18.96933699888278, "difficulty": "Hard", "likes": 1065, "dislikes": 1751, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 319886, "totalSubmissionRaw": 1686332}, "66": {"acRate": 44.28684092849303, "difficulty": "Easy", "likes": 8421, "dislikes": 5200, "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": 1906471, "totalSubmissionRaw": 4304820}, "67": {"acRate": 52.75449506977616, "difficulty": "Easy", "likes": 8821, "dislikes": 877, "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": 1270801, "totalSubmissionRaw": 2408906}, "68": {"acRate": 41.450267173779274, "difficulty": "Hard", "likes": 3321, "dislikes": 4289, "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": 361716, "totalSubmissionRaw": 872652}, "69": {"acRate": 37.98585507892043, "difficulty": "Easy", "likes": 7434, "dislikes": 4331, "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": false, "totalAcceptedRaw": 1664343, "totalSubmissionRaw": 4381487}, "70": {"acRate": 52.22639519942259, "difficulty": "Easy", "likes": 20162, "dislikes": 674, "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": 2684539, "totalSubmissionRaw": 5140204}, "71": {"acRate": 41.05146771656868, "difficulty": "Medium", "likes": 5040, "dislikes": 1054, "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": 622268, "totalSubmissionRaw": 1515824}, "72": {"acRate": 55.50121973171175, "difficulty": "Medium", "likes": 13896, "dislikes": 178, "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": 736915, "totalSubmissionRaw": 1327748}, "73": {"acRate": 53.62210241672337, "difficulty": "Medium", "likes": 13293, "dislikes": 658, "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": 1168566, "totalSubmissionRaw": 2179267}, "74": {"acRate": 49.27855945899088, "difficulty": "Medium", "likes": 14641, "dislikes": 379, "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": 1503558, "totalSubmissionRaw": 3051148}, "75": {"acRate": 60.543144570217535, "difficulty": "Medium", "likes": 16861, "dislikes": 581, "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": 1638041, "totalSubmissionRaw": 2705577}, "76": {"acRate": 41.30431300412783, "difficulty": "Hard", "likes": 16365, "dislikes": 672, "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": 1108799, "totalSubmissionRaw": 2684463}, "77": {"acRate": 69.40345406862211, "difficulty": "Medium", "likes": 7783, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 803964, "totalSubmissionRaw": 1158395}, "78": {"acRate": 76.25285518772489, "difficulty": "Medium", "likes": 15970, "dislikes": 234, "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": 1607414, "totalSubmissionRaw": 2108005}, "79": {"acRate": 40.79322056249621, "difficulty": "Medium", "likes": 14536, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1385831, "totalSubmissionRaw": 3397210}, "80": {"acRate": 55.33600674770658, "difficulty": "Medium", "likes": 6041, "dislikes": 1140, "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": 678348, "totalSubmissionRaw": 1225880}, "81": {"acRate": 37.27865136704916, "difficulty": "Medium", "likes": 7914, "dislikes": 978, "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": 636823, "totalSubmissionRaw": 1708275}, "82": {"acRate": 46.5982176538837, "difficulty": "Medium", "likes": 8320, "dislikes": 214, "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": 653448, "totalSubmissionRaw": 1402305}, "83": {"acRate": 51.537270489453235, "difficulty": "Easy", "likes": 8095, "dislikes": 273, "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": 1319414, "totalSubmissionRaw": 2560118}, "84": {"acRate": 43.415554695654265, "difficulty": "Hard", "likes": 16024, "dislikes": 230, "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": 756213, "totalSubmissionRaw": 1741802}, "85": {"acRate": 45.95130952484572, "difficulty": "Hard", "likes": 9391, "dislikes": 147, "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": 369551, "totalSubmissionRaw": 804223}, "86": {"acRate": 55.16688876197728, "difficulty": "Medium", "likes": 6948, "dislikes": 774, "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": 556399, "totalSubmissionRaw": 1008575}, "87": {"acRate": 39.33518312780404, "difficulty": "Hard", "likes": 3170, "dislikes": 1254, "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": 212788, "totalSubmissionRaw": 540959}, "88": {"acRate": 48.10886882052718, "difficulty": "Easy", "likes": 12920, "dislikes": 1437, "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": 2460959, "totalSubmissionRaw": 5115394}, "89": {"acRate": 58.05002110595188, "difficulty": "Medium", "likes": 2086, "dislikes": 2610, "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": 275041, "totalSubmissionRaw": 473800}, "90": {"acRate": 56.57579176914178, "difficulty": "Medium", "likes": 9115, "dislikes": 256, "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": 795702, "totalSubmissionRaw": 1406434}, "91": {"acRate": 33.39857005221609, "difficulty": "Medium", "likes": 10618, "dislikes": 4360, "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": 1083647, "totalSubmissionRaw": 3244593}, "92": {"acRate": 47.183124786121326, "difficulty": "Medium", "likes": 10897, "dislikes": 501, "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": 761087, "totalSubmissionRaw": 1613048}, "93": {"acRate": 48.563394970762516, "difficulty": "Medium", "likes": 4964, "dislikes": 765, "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": 422804, "totalSubmissionRaw": 870625}, "94": {"acRate": 74.82062032851208, "difficulty": "Easy", "likes": 12476, "dislikes": 659, "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": 2190642, "totalSubmissionRaw": 2927860}, "95": {"acRate": 56.48973437391197, "difficulty": "Medium", "likes": 7301, "dislikes": 485, "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": 421842, "totalSubmissionRaw": 746761}, "96": {"acRate": 60.43004208239404, "difficulty": "Medium", "likes": 9959, "dislikes": 381, "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": 613598, "totalSubmissionRaw": 1015387}, "97": {"acRate": 39.33927128780265, "difficulty": "Medium", "likes": 7820, "dislikes": 448, "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": 466968, "totalSubmissionRaw": 1187038}, "98": {"acRate": 32.369968415736956, "difficulty": "Medium", "likes": 15883, "dislikes": 1288, "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": 2090943, "totalSubmissionRaw": 6459520}, "99": {"acRate": 52.063502728691205, "difficulty": "Medium", "likes": 7501, "dislikes": 240, "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": 418423, "totalSubmissionRaw": 803680}, "100": {"acRate": 59.75254665723333, "difficulty": "Easy", "likes": 10499, "dislikes": 202, "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": false, "totalAcceptedRaw": 1739779, "totalSubmissionRaw": 2911641}, "101": {"acRate": 55.36665056062991, "difficulty": "Easy", "likes": 14455, "dislikes": 339, "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": 1781839, "totalSubmissionRaw": 3218253}, "102": {"acRate": 65.82068110285913, "difficulty": "Medium", "likes": 14409, "dislikes": 288, "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": 1965987, "totalSubmissionRaw": 2986882}, "103": {"acRate": 57.962506627363766, "difficulty": "Medium", "likes": 10162, "dislikes": 265, "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": 1042953, "totalSubmissionRaw": 1799358}, "104": {"acRate": 74.59506313868933, "difficulty": "Easy", "likes": 11960, "dislikes": 194, "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": false, "totalAcceptedRaw": 2634190, "totalSubmissionRaw": 3531324}, "105": {"acRate": 62.66039787142933, "difficulty": "Medium", "likes": 14051, "dislikes": 427, "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": 1072595, "totalSubmissionRaw": 1711759}, "106": {"acRate": 61.39411222367547, "difficulty": "Medium", "likes": 7624, "dislikes": 119, "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": 572672, "totalSubmissionRaw": 932780}, "107": {"acRate": 62.25124019974826, "difficulty": "Medium", "likes": 4634, "dislikes": 318, "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": 605346, "totalSubmissionRaw": 972424}, "108": {"acRate": 70.76486489149606, "difficulty": "Easy", "likes": 10342, "dislikes": 515, "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": false, "totalAcceptedRaw": 1077249, "totalSubmissionRaw": 1522294}, "109": {"acRate": 60.99086804109998, "difficulty": "Medium", "likes": 7182, "dislikes": 152, "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": 495169, "totalSubmissionRaw": 811874}, "110": {"acRate": 50.55830838718555, "difficulty": "Easy", "likes": 9953, "dislikes": 576, "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": 1263984, "totalSubmissionRaw": 2500051}, "111": {"acRate": 46.6613701421571, "difficulty": "Easy", "likes": 6939, "dislikes": 1246, "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": 1077145, "totalSubmissionRaw": 2308430}, "112": {"acRate": 49.1753409437162, "difficulty": "Easy", "likes": 9102, "dislikes": 1020, "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": 1278189, "totalSubmissionRaw": 2599251}, "113": {"acRate": 57.72226523784793, "difficulty": "Medium", "likes": 7546, "dislikes": 147, "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": 787986, "totalSubmissionRaw": 1365134}, "114": {"acRate": 63.389469260326614, "difficulty": "Medium", "likes": 11495, "dislikes": 536, "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": 844649, "totalSubmissionRaw": 1332477}, "115": {"acRate": 45.473932170395955, "difficulty": "Hard", "likes": 6225, "dislikes": 274, "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": 342461, "totalSubmissionRaw": 753093}, "116": {"acRate": 61.565655062066384, "difficulty": "Medium", "likes": 9251, "dislikes": 284, "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": 971940, "totalSubmissionRaw": 1578708}, "117": {"acRate": 51.287883221516985, "difficulty": "Medium", "likes": 5590, "dislikes": 308, "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": 578394, "totalSubmissionRaw": 1127741}, "118": {"acRate": 73.06373128314137, "difficulty": "Easy", "likes": 11938, "dislikes": 378, "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": 1456007, "totalSubmissionRaw": 1992790}, "119": {"acRate": 61.7691023263052, "difficulty": "Easy", "likes": 4168, "dislikes": 311, "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": 734308, "totalSubmissionRaw": 1188795}, "120": {"acRate": 55.67362451159692, "difficulty": "Medium", "likes": 8990, "dislikes": 518, "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": 662716, "totalSubmissionRaw": 1190358}, "121": {"acRate": 53.48902494544612, "difficulty": "Easy", "likes": 28694, "dislikes": 975, "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": 3873629, "totalSubmissionRaw": 7241912}, "122": {"acRate": 65.12711080944145, "difficulty": "Medium", "likes": 12591, "dislikes": 2608, "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": 1627322, "totalSubmissionRaw": 2498686}, "123": {"acRate": 46.912514608620285, "difficulty": "Hard", "likes": 9134, "dislikes": 164, "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": 535884, "totalSubmissionRaw": 1142303}, "124": {"acRate": 39.55592570939002, "difficulty": "Hard", "likes": 15640, "dislikes": 679, "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": 1075759, "totalSubmissionRaw": 2719588}, "125": {"acRate": 45.82952914964234, "difficulty": "Easy", "likes": 8321, "dislikes": 7931, "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": 2364236, "totalSubmissionRaw": 5158760}, "126": {"acRate": 27.339590567270456, "difficulty": "Hard", "likes": 5716, "dislikes": 707, "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": 351086, "totalSubmissionRaw": 1284163}, "127": {"acRate": 38.08881465919628, "difficulty": "Hard", "likes": 11366, "dislikes": 1832, "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": 971051, "totalSubmissionRaw": 2549440}, "128": {"acRate": 47.44179150270309, "difficulty": "Medium", "likes": 18473, "dislikes": 838, "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": 1385469, "totalSubmissionRaw": 2920357}, "129": {"acRate": 62.11511961506314, "difficulty": "Medium", "likes": 7188, "dislikes": 114, "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": 659909, "totalSubmissionRaw": 1062400}, "130": {"acRate": 38.1255463269448, "difficulty": "Medium", "likes": 7990, "dislikes": 1659, "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": 603206, "totalSubmissionRaw": 1582157}, "131": {"acRate": 66.31327191550577, "difficulty": "Medium", "likes": 11817, "dislikes": 382, "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": 711733, "totalSubmissionRaw": 1073294}, "132": {"acRate": 33.60426256220777, "difficulty": "Hard", "likes": 5190, "dislikes": 134, "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": 259023, "totalSubmissionRaw": 770804}, "133": {"acRate": 55.0198533335304, "difficulty": "Medium", "likes": 8887, "dislikes": 3536, "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": 1079558, "totalSubmissionRaw": 1962129}, "134": {"acRate": 45.808445253037334, "difficulty": "Medium", "likes": 11070, "dislikes": 965, "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": 672260, "totalSubmissionRaw": 1467552}, "135": {"acRate": 43.26487212490906, "difficulty": "Hard", "likes": 7191, "dislikes": 538, "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": 425199, "totalSubmissionRaw": 982776}, "136": {"acRate": 71.68019293241493, "difficulty": "Easy", "likes": 15414, "dislikes": 622, "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": 2417026, "totalSubmissionRaw": 3371958}, "137": {"acRate": 61.62784497865489, "difficulty": "Medium", "likes": 7413, "dislikes": 644, "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": 520128, "totalSubmissionRaw": 843979}, "138": {"acRate": 54.2693353344241, "difficulty": "Medium", "likes": 13050, "dislikes": 1328, "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": 1102866, "totalSubmissionRaw": 2032216}, "139": {"acRate": 46.25918958617872, "difficulty": "Medium", "likes": 16337, "dislikes": 709, "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": 1507889, "totalSubmissionRaw": 3259657}, "140": {"acRate": 46.467517781355696, "difficulty": "Hard", "likes": 6524, "dislikes": 520, "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": 539115, "totalSubmissionRaw": 1160201}, "141": {"acRate": 48.894310326053244, "difficulty": "Easy", "likes": 14274, "dislikes": 1174, "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": 2420197, "totalSubmissionRaw": 4949847}, "142": {"acRate": 50.08844246842218, "difficulty": "Medium", "likes": 12801, "dislikes": 895, "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": 1161837, "totalSubmissionRaw": 2319566}, "143": {"acRate": 54.655615185962326, "difficulty": "Medium", "likes": 9760, "dislikes": 322, "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": 758510, "totalSubmissionRaw": 1387802}, "144": {"acRate": 68.26473211158215, "difficulty": "Easy", "likes": 7540, "dislikes": 193, "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": 1442158, "totalSubmissionRaw": 2112596}, "145": {"acRate": 69.56731488480821, "difficulty": "Easy", "likes": 6503, "dislikes": 183, "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": 1055571, "totalSubmissionRaw": 1517338}, "146": {"acRate": 41.70743621646318, "difficulty": "Medium", "likes": 19493, "dislikes": 881, "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": 1451472, "totalSubmissionRaw": 3480129}, "147": {"acRate": 52.20304711386833, "difficulty": "Medium", "likes": 2920, "dislikes": 846, "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": 341303, "totalSubmissionRaw": 653799}, "148": {"acRate": 56.50339964231444, "difficulty": "Medium", "likes": 10820, "dislikes": 308, "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": 693484, "totalSubmissionRaw": 1227333}, "149": {"acRate": 25.86837643145401, "difficulty": "Hard", "likes": 3921, "dislikes": 439, "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": 359280, "totalSubmissionRaw": 1388879}, "150": {"acRate": 47.78145316264337, "difficulty": "Medium", "likes": 6614, "dislikes": 962, "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": 776253, "totalSubmissionRaw": 1624602}, "151": {"acRate": 37.39847973186127, "difficulty": "Medium", "likes": 7467, "dislikes": 4914, "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": 1155846, "totalSubmissionRaw": 3090631}, "152": {"acRate": 34.82171240777717, "difficulty": "Medium", "likes": 17508, "dislikes": 549, "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": 1115085, "totalSubmissionRaw": 3202275}, "153": {"acRate": 49.55455080617232, "difficulty": "Medium", "likes": 12116, "dislikes": 530, "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": 1496707, "totalSubmissionRaw": 3020322}, "154": {"acRate": 43.48182494342549, "difficulty": "Hard", "likes": 4447, "dislikes": 458, "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": 412149, "totalSubmissionRaw": 947863}, "155": {"acRate": 53.12913496488174, "difficulty": "Medium", "likes": 13088, "dislikes": 797, "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": 1428216, "totalSubmissionRaw": 2688198}, "156": {"acRate": 62.27559667115315, "difficulty": "Medium", "likes": 240, "dislikes": 318, "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": 98553, "totalSubmissionRaw": 158253}, "157": {"acRate": 41.18478810468805, "difficulty": "Easy", "likes": 554, "dislikes": 3392, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184081, "totalSubmissionRaw": 446965}, "158": {"acRate": 41.8809942042327, "difficulty": "Hard", "likes": 856, "dislikes": 1772, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 178341, "totalSubmissionRaw": 425828}, "159": {"acRate": 54.22005240986446, "difficulty": "Medium", "likes": 2120, "dislikes": 32, "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": 235668, "totalSubmissionRaw": 434650}, "160": {"acRate": 55.98699172656176, "difficulty": "Easy", "likes": 14148, "dislikes": 1244, "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": 1397063, "totalSubmissionRaw": 2495335}, "161": {"acRate": 34.220839378419484, "difficulty": "Medium", "likes": 1346, "dislikes": 184, "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": 195773, "totalSubmissionRaw": 572088}, "162": {"acRate": 45.78905324936419, "difficulty": "Medium", "likes": 10739, "dislikes": 4473, "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": 1148128, "totalSubmissionRaw": 2507429}, "163": {"acRate": 32.736233619677115, "difficulty": "Easy", "likes": 1013, "dislikes": 2910, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213216, "totalSubmissionRaw": 651315}, "164": {"acRate": 44.39403363701779, "difficulty": "Medium", "likes": 3035, "dislikes": 350, "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": 181999, "totalSubmissionRaw": 409964}, "165": {"acRate": 36.297167435230655, "difficulty": "Medium", "likes": 2041, "dislikes": 2527, "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": 363886, "totalSubmissionRaw": 1002519}, "166": {"acRate": 24.573300866658172, "difficulty": "Medium", "likes": 1988, "dislikes": 3576, "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": 214045, "totalSubmissionRaw": 871047}, "167": {"acRate": 60.38676880658647, "difficulty": "Medium", "likes": 10846, "dislikes": 1311, "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": 1678965, "totalSubmissionRaw": 2780354}, "168": {"acRate": 39.54161718344245, "difficulty": "Easy", "likes": 5288, "dislikes": 739, "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": 478123, "totalSubmissionRaw": 1209162}, "169": {"acRate": 63.85212329207456, "difficulty": "Easy", "likes": 17229, "dislikes": 511, "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": 2125475, "totalSubmissionRaw": 3328746}, "170": {"acRate": 37.746436970867414, "difficulty": "Easy", "likes": 651, "dislikes": 436, "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": 147176, "totalSubmissionRaw": 389907}, "171": {"acRate": 62.92031262812527, "difficulty": "Easy", "likes": 4571, "dislikes": 350, "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": 636875, "totalSubmissionRaw": 1012193}, "172": {"acRate": 42.786802219888365, "difficulty": "Medium", "likes": 2978, "dislikes": 1908, "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": 401290, "totalSubmissionRaw": 937883}, "173": {"acRate": 70.82681252154343, "difficulty": "Medium", "likes": 8111, "dislikes": 467, "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": 715056, "totalSubmissionRaw": 1009585}, "174": {"acRate": 37.71899444248048, "difficulty": "Hard", "likes": 5545, "dislikes": 96, "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": 210194, "totalSubmissionRaw": 557263}, "175": {"acRate": 74.96906758102926, "difficulty": "Easy", "likes": 3237, "dislikes": 218, "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": 876749, "totalSubmissionRaw": 1169478}, "176": {"acRate": 39.03342574098973, "difficulty": "Medium", "likes": 3298, "dislikes": 898, "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": 741457, "totalSubmissionRaw": 1899545}, "177": {"acRate": 38.083684172055165, "difficulty": "Medium", "likes": 1830, "dislikes": 955, "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": 349077, "totalSubmissionRaw": 916610}, "178": {"acRate": 61.261188294519656, "difficulty": "Medium", "likes": 2020, "dislikes": 258, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340368, "totalSubmissionRaw": 555595}, "179": {"acRate": 35.29798737912442, "difficulty": "Medium", "likes": 7607, "dislikes": 601, "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": 426563, "totalSubmissionRaw": 1208468}, "180": {"acRate": 46.70616586496594, "difficulty": "Medium", "likes": 1826, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 294983, "totalSubmissionRaw": 631573}, "181": {"acRate": 68.90738527990737, "difficulty": "Easy", "likes": 2393, "dislikes": 231, "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": 557078, "totalSubmissionRaw": 808445}, "182": {"acRate": 70.75517400798725, "difficulty": "Easy", "likes": 1917, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575447, "totalSubmissionRaw": 813293}, "183": {"acRate": 68.5953046447957, "difficulty": "Easy", "likes": 2459, "dislikes": 121, "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": 719062, "totalSubmissionRaw": 1048268}, "184": {"acRate": 50.653399429820425, "difficulty": "Medium", "likes": 1898, "dislikes": 182, "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": 338114, "totalSubmissionRaw": 667507}, "185": {"acRate": 51.1675504885338, "difficulty": "Hard", "likes": 1806, "dislikes": 215, "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": 254249, "totalSubmissionRaw": 496895}, "186": {"acRate": 53.58314704922462, "difficulty": "Medium", "likes": 1030, "dislikes": 141, "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": 152690, "totalSubmissionRaw": 284959}, "187": {"acRate": 47.84346597206828, "difficulty": "Medium", "likes": 3132, "dislikes": 504, "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": 345315, "totalSubmissionRaw": 721760}, "188": {"acRate": 41.092114320679194, "difficulty": "Hard", "likes": 7061, "dislikes": 202, "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": 402934, "totalSubmissionRaw": 980569}, "189": {"acRate": 39.87780335941934, "difficulty": "Medium", "likes": 16435, "dislikes": 1793, "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": 1755249, "totalSubmissionRaw": 4401574}, "190": {"acRate": 56.227340403248824, "difficulty": "Easy", "likes": 4793, "dislikes": 1275, "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": 695249, "totalSubmissionRaw": 1236499}, "191": {"acRate": 68.40783952061176, "difficulty": "Easy", "likes": 5862, "dislikes": 1221, "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": 1225377, "totalSubmissionRaw": 1791282}, "192": {"acRate": 25.45031766060733, "difficulty": "Medium", "likes": 512, "dislikes": 299, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46186, "totalSubmissionRaw": 181480}, "193": {"acRate": 25.738415727793544, "difficulty": "Easy", "likes": 379, "dislikes": 933, "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": 73904, "totalSubmissionRaw": 287135}, "194": {"acRate": 25.54531319413594, "difficulty": "Medium", "likes": 140, "dislikes": 282, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23001, "totalSubmissionRaw": 90040}, "195": {"acRate": 32.88760615435726, "difficulty": "Easy", "likes": 359, "dislikes": 456, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95034, "totalSubmissionRaw": 288966}, "196": {"acRate": 61.02031231976799, "difficulty": "Easy", "likes": 1398, "dislikes": 281, "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": 444367, "totalSubmissionRaw": 728228}, "197": {"acRate": 45.83111040992438, "difficulty": "Easy", "likes": 2310, "dislikes": 540, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 441553, "totalSubmissionRaw": 963433}, "198": {"acRate": 49.985932153651135, "difficulty": "Medium", "likes": 19411, "dislikes": 362, "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": 1817453, "totalSubmissionRaw": 3635933}, "199": {"acRate": 62.31465659002624, "difficulty": "Medium", "likes": 11145, "dislikes": 741, "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": 1083779, "totalSubmissionRaw": 1739204}, "200": {"acRate": 57.8992527088838, "difficulty": "Medium", "likes": 21375, "dislikes": 460, "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": 2334821, "totalSubmissionRaw": 4032561}, "201": {"acRate": 42.72198770950647, "difficulty": "Medium", "likes": 3111, "dislikes": 217, "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": 257573, "totalSubmissionRaw": 602900}, "202": {"acRate": 55.38091619285995, "difficulty": "Easy", "likes": 9616, "dislikes": 1274, "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": 1270925, "totalSubmissionRaw": 2294883}, "203": {"acRate": 47.39215161641601, "difficulty": "Easy", "likes": 7845, "dislikes": 219, "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": 1013157, "totalSubmissionRaw": 2137816}, "204": {"acRate": 33.35060862563961, "difficulty": "Medium", "likes": 7475, "dislikes": 1356, "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": 787015, "totalSubmissionRaw": 2359822}, "205": {"acRate": 43.4937723755011, "difficulty": "Easy", "likes": 7727, "dislikes": 1680, "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": 1014423, "totalSubmissionRaw": 2332343}, "206": {"acRate": 74.87879940970834, "difficulty": "Easy", "likes": 19797, "dislikes": 357, "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": 3473142, "totalSubmissionRaw": 4638353}, "207": {"acRate": 46.23978275127322, "difficulty": "Medium", "likes": 15247, "dislikes": 609, "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": 1354358, "totalSubmissionRaw": 2928990}, "208": {"acRate": 63.92078310907894, "difficulty": "Medium", "likes": 10945, "dislikes": 121, "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": 903088, "totalSubmissionRaw": 1412824}, "209": {"acRate": 46.475705854271524, "difficulty": "Medium", "likes": 11778, "dislikes": 353, "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": 868392, "totalSubmissionRaw": 1868494}, "210": {"acRate": 49.413290771272806, "difficulty": "Medium", "likes": 10097, "dislikes": 319, "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": 900913, "totalSubmissionRaw": 1823220}, "211": {"acRate": 44.46678317575401, "difficulty": "Medium", "likes": 7241, "dislikes": 419, "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": 568418, "totalSubmissionRaw": 1278298}, "212": {"acRate": 36.137506033318544, "difficulty": "Hard", "likes": 8948, "dislikes": 423, "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": 592976, "totalSubmissionRaw": 1640888}, "213": {"acRate": 41.53892967659343, "difficulty": "Medium", "likes": 9185, "dislikes": 132, "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": 652520, "totalSubmissionRaw": 1570867}, "214": {"acRate": 32.732324181093716, "difficulty": "Hard", "likes": 3399, "dislikes": 228, "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": 165529, "totalSubmissionRaw": 505704}, "215": {"acRate": 67.05316526976951, "difficulty": "Medium", "likes": 16130, "dislikes": 783, "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": 2009983, "totalSubmissionRaw": 2997596}, "216": {"acRate": 68.68123835216736, "difficulty": "Medium", "likes": 5562, "dislikes": 100, "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": 446290, "totalSubmissionRaw": 649799}, "217": {"acRate": 61.04531443395358, "difficulty": "Easy", "likes": 10901, "dislikes": 1243, "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": 3290625, "totalSubmissionRaw": 5390467}, "218": {"acRate": 42.25128875894437, "difficulty": "Hard", "likes": 5689, "dislikes": 254, "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": 274570, "totalSubmissionRaw": 649850}, "219": {"acRate": 43.617161239102856, "difficulty": "Easy", "likes": 5569, "dislikes": 2878, "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": 772450, "totalSubmissionRaw": 1770980}, "220": {"acRate": 22.455874889569746, "difficulty": "Hard", "likes": 809, "dislikes": 42, "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": 238935, "totalSubmissionRaw": 1064020}, "221": {"acRate": 45.784336657664745, "difficulty": "Medium", "likes": 9603, "dislikes": 205, "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": 624399, "totalSubmissionRaw": 1363783}, "222": {"acRate": 62.77857770477164, "difficulty": "Easy", "likes": 8145, "dislikes": 451, "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": "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": 613002, "totalSubmissionRaw": 976458}, "223": {"acRate": 45.47846664754829, "difficulty": "Medium", "likes": 1894, "dislikes": 1615, "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": 207743, "totalSubmissionRaw": 456794}, "224": {"acRate": 42.72837146346067, "difficulty": "Hard", "likes": 5878, "dislikes": 431, "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": 409744, "totalSubmissionRaw": 958952}, "225": {"acRate": 62.333538781356765, "difficulty": "Easy", "likes": 5641, "dislikes": 1158, "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": 580508, "totalSubmissionRaw": 931295}, "226": {"acRate": 75.8525743642559, "difficulty": "Easy", "likes": 13204, "dislikes": 186, "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": 1761696, "totalSubmissionRaw": 2322529}, "227": {"acRate": 42.780261503567516, "difficulty": "Medium", "likes": 5824, "dislikes": 752, "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": 548495, "totalSubmissionRaw": 1282122}, "228": {"acRate": 49.61958312517937, "difficulty": "Easy", "likes": 3685, "dislikes": 1965, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 466826, "totalSubmissionRaw": 940809}, "229": {"acRate": 50.24838851437614, "difficulty": "Medium", "likes": 9044, "dislikes": 387, "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": 578568, "totalSubmissionRaw": 1151417}, "230": {"acRate": 71.35570372838623, "difficulty": "Medium", "likes": 10721, "dislikes": 201, "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": 1224898, "totalSubmissionRaw": 1716604}, "231": {"acRate": 46.347874435327654, "difficulty": "Easy", "likes": 5997, "dislikes": 382, "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": 1009470, "totalSubmissionRaw": 2178031}, "232": {"acRate": 64.04938455528695, "difficulty": "Easy", "likes": 6744, "dislikes": 384, "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": 739470, "totalSubmissionRaw": 1154530}, "233": {"acRate": 34.24571274359876, "difficulty": "Hard", "likes": 1392, "dislikes": 1406, "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": 83752, "totalSubmissionRaw": 244562}, "234": {"acRate": 51.08748609675704, "difficulty": "Easy", "likes": 15344, "dislikes": 824, "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": 1608507, "totalSubmissionRaw": 3148532}, "235": {"acRate": 63.19932109179799, "difficulty": "Medium", "likes": 10336, "dislikes": 288, "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": 1308468, "totalSubmissionRaw": 2070383}, "236": {"acRate": 60.45446463557681, "difficulty": "Medium", "likes": 15329, "dislikes": 353, "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": 1417841, "totalSubmissionRaw": 2345306}, "237": {"acRate": 77.3464794039771, "difficulty": "Medium", "likes": 3928, "dislikes": 1122, "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": 1157661, "totalSubmissionRaw": 1496721}, "238": {"acRate": 65.02994656929405, "difficulty": "Medium", "likes": 20251, "dislikes": 1164, "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": 1968248, "totalSubmissionRaw": 3026692}, "239": {"acRate": 46.431211805953765, "difficulty": "Hard", "likes": 17190, "dislikes": 593, "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": 906878, "totalSubmissionRaw": 1953168}, "240": {"acRate": 51.75930482806399, "difficulty": "Medium", "likes": 11298, "dislikes": 184, "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": 848732, "totalSubmissionRaw": 1639765}, "241": {"acRate": 64.72470303702117, "difficulty": "Medium", "likes": 5119, "dislikes": 240, "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": 205532, "totalSubmissionRaw": 317548}, "242": {"acRate": 63.36345276392693, "difficulty": "Easy", "likes": 10760, "dislikes": 338, "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": 2698792, "totalSubmissionRaw": 4259223}, "243": {"acRate": 65.12457429080088, "difficulty": "Easy", "likes": 1239, "dislikes": 109, "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": 205948, "totalSubmissionRaw": 316237}, "244": {"acRate": 60.99168687360205, "difficulty": "Medium", "likes": 1031, "dislikes": 313, "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": 149157, "totalSubmissionRaw": 244553}, "245": {"acRate": 58.21548723475526, "difficulty": "Medium", "likes": 489, "dislikes": 99, "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": 79945, "totalSubmissionRaw": 137326}, "246": {"acRate": 47.66178774659126, "difficulty": "Easy", "likes": 565, "dislikes": 983, "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": 163662, "totalSubmissionRaw": 343382}, "247": {"acRate": 51.735959926411454, "difficulty": "Medium", "likes": 878, "dislikes": 232, "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": 131891, "totalSubmissionRaw": 254931}, "248": {"acRate": 41.99547919375051, "difficulty": "Hard", "likes": 297, "dislikes": 185, "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": 35857, "totalSubmissionRaw": 85383}, "249": {"acRate": 64.62550028587765, "difficulty": "Medium", "likes": 1566, "dislikes": 316, "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": 203454, "totalSubmissionRaw": 314820}, "250": {"acRate": 56.05650817344869, "difficulty": "Medium", "likes": 1161, "dislikes": 395, "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": 145705, "totalSubmissionRaw": 259923}, "251": {"acRate": 49.287100039930465, "difficulty": "Medium", "likes": 700, "dislikes": 395, "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": 122198, "totalSubmissionRaw": 247931}, "252": {"acRate": 57.61763362265875, "difficulty": "Easy", "likes": 1937, "dislikes": 96, "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": 363236, "totalSubmissionRaw": 630428}, "253": {"acRate": 50.79747038929167, "difficulty": "Medium", "likes": 6707, "dislikes": 144, "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": 818426, "totalSubmissionRaw": 1611153}, "254": {"acRate": 49.26299890918245, "difficulty": "Medium", "likes": 1102, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123288, "totalSubmissionRaw": 250266}, "255": {"acRate": 48.569024693171656, "difficulty": "Medium", "likes": 1113, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"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": 72736, "totalSubmissionRaw": 149758}, "256": {"acRate": 61.653800096817754, "difficulty": "Medium", "likes": 2209, "dislikes": 128, "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": 193588, "totalSubmissionRaw": 313992}, "257": {"acRate": 62.558585236851236, "difficulty": "Easy", "likes": 6217, "dislikes": 266, "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": 661648, "totalSubmissionRaw": 1057646}, "258": {"acRate": 66.0174068078917, "difficulty": "Easy", "likes": 4535, "dislikes": 1912, "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": 703531, "totalSubmissionRaw": 1065675}, "259": {"acRate": 50.59484384218089, "difficulty": "Medium", "likes": 1491, "dislikes": 148, "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": 139789, "totalSubmissionRaw": 276291}, "260": {"acRate": 67.95356017510098, "difficulty": "Medium", "likes": 5435, "dislikes": 221, "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": 321330, "totalSubmissionRaw": 472863}, "261": {"acRate": 47.53088525932594, "difficulty": "Medium", "likes": 3152, "dislikes": 95, "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": 362192, "totalSubmissionRaw": 762014}, "262": {"acRate": 36.38209907884239, "difficulty": "Hard", "likes": 1157, "dislikes": 642, "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": 160511, "totalSubmissionRaw": 441183}, "263": {"acRate": 42.008153558998416, "difficulty": "Easy", "likes": 3117, "dislikes": 1622, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460701, "totalSubmissionRaw": 1096696}, "264": {"acRate": 46.189449120089435, "difficulty": "Medium", "likes": 5727, "dislikes": 284, "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": 321443, "totalSubmissionRaw": 695923}, "265": {"acRate": 54.02250552941557, "difficulty": "Hard", "likes": 1255, "dislikes": 34, "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": 116993, "totalSubmissionRaw": 216564}, "266": {"acRate": 66.3990322717562, "difficulty": "Easy", "likes": 1016, "dislikes": 68, "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": 187726, "totalSubmissionRaw": 282724}, "267": {"acRate": 40.906723591402134, "difficulty": "Medium", "likes": 851, "dislikes": 95, "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": 63621, "totalSubmissionRaw": 155527}, "268": {"acRate": 64.09483387038706, "difficulty": "Easy", "likes": 10791, "dislikes": 3228, "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": 1723337, "totalSubmissionRaw": 2688733}, "269": {"acRate": 35.46427645840407, "difficulty": "Hard", "likes": 4252, "dislikes": 949, "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": 353048, "totalSubmissionRaw": 995503}, "270": {"acRate": 53.21787014832579, "difficulty": "Easy", "likes": 1713, "dislikes": 113, "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": 299585, "totalSubmissionRaw": 562925}, "271": {"acRate": 44.857446592554204, "difficulty": "Medium", "likes": 1357, "dislikes": 364, "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": 167936, "totalSubmissionRaw": 374380}, "272": {"acRate": 58.67997177076199, "difficulty": "Hard", "likes": 1253, "dislikes": 41, "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": 113081, "totalSubmissionRaw": 192708}, "273": {"acRate": 30.206930173381735, "difficulty": "Hard", "likes": 2839, "dislikes": 6014, "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": 355656, "totalSubmissionRaw": 1177401}, "274": {"acRate": 38.48601962744021, "difficulty": "Medium", "likes": 783, "dislikes": 272, "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": 338468, "totalSubmissionRaw": 879468}, "275": {"acRate": 37.82233749977433, "difficulty": "Medium", "likes": 228, "dislikes": 41, "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": 188547, "totalSubmissionRaw": 498507}, "276": {"acRate": 45.215047121527654, "difficulty": "Medium", "likes": 1473, "dislikes": 378, "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": 102479, "totalSubmissionRaw": 226648}, "277": {"acRate": 46.85489069377682, "difficulty": "Medium", "likes": 2737, "dislikes": 261, "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": 254408, "totalSubmissionRaw": 542970}, "278": {"acRate": 43.797205728687146, "difficulty": "Easy", "likes": 8021, "dislikes": 3172, "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": 1565066, "totalSubmissionRaw": 3573429}, "279": {"acRate": 52.991328009286306, "difficulty": "Medium", "likes": 10137, "dislikes": 415, "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": 703027, "totalSubmissionRaw": 1326684}, "280": {"acRate": 67.37561528030955, "difficulty": "Medium", "likes": 1166, "dislikes": 99, "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": 135648, "totalSubmissionRaw": 201331}, "281": {"acRate": 63.26390559336663, "difficulty": "Medium", "likes": 650, "dislikes": 36, "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": 89421, "totalSubmissionRaw": 141346}, "282": {"acRate": 39.386420845213735, "difficulty": "Hard", "likes": 3200, "dislikes": 564, "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": 207478, "totalSubmissionRaw": 526775}, "283": {"acRate": 61.40219720462341, "difficulty": "Easy", "likes": 15418, "dislikes": 384, "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": false, "totalAcceptedRaw": 2524759, "totalSubmissionRaw": 4111845}, "284": {"acRate": 58.99896858361442, "difficulty": "Medium", "likes": 1794, "dislikes": 1021, "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": 211647, "totalSubmissionRaw": 358730}, "285": {"acRate": 49.11739908123143, "difficulty": "Medium", "likes": 2484, "dislikes": 88, "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": 311671, "totalSubmissionRaw": 634544}, "286": {"acRate": 60.822028578420415, "difficulty": "Medium", "likes": 2996, "dislikes": 54, "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": 285823, "totalSubmissionRaw": 469934}, "287": {"acRate": 59.35892805683876, "difficulty": "Medium", "likes": 21664, "dislikes": 3677, "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": 1415118, "totalSubmissionRaw": 2384003}, "288": {"acRate": 25.85730804726001, "difficulty": "Medium", "likes": 197, "dislikes": 1788, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 70886, "totalSubmissionRaw": 274143}, "289": {"acRate": 68.15470184134263, "difficulty": "Medium", "likes": 6030, "dislikes": 514, "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": 422139, "totalSubmissionRaw": 619384}, "290": {"acRate": 41.71303879552135, "difficulty": "Easy", "likes": 6807, "dislikes": 868, "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": 594884, "totalSubmissionRaw": 1426137}, "291": {"acRate": 47.327801509423665, "difficulty": "Medium", "likes": 863, "dislikes": 67, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 69357, "totalSubmissionRaw": 146546}, "292": {"acRate": 56.35689669581975, "difficulty": "Easy", "likes": 1586, "dislikes": 2627, "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": 343904, "totalSubmissionRaw": 610223}, "293": {"acRate": 63.44196906313844, "difficulty": "Easy", "likes": 202, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65211, "totalSubmissionRaw": 102789}, "294": {"acRate": 51.96374850145896, "difficulty": "Medium", "likes": 604, "dislikes": 61, "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": 68919, "totalSubmissionRaw": 132629}, "295": {"acRate": 51.48847094762413, "difficulty": "Hard", "likes": 11214, "dislikes": 218, "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": 689700, "totalSubmissionRaw": 1339525}, "296": {"acRate": 60.117604580388914, "difficulty": "Hard", "likes": 1072, "dislikes": 90, "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": 69929, "totalSubmissionRaw": 116320}, "297": {"acRate": 56.00219614515757, "difficulty": "Hard", "likes": 9590, "dislikes": 352, "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": 792544, "totalSubmissionRaw": 1415202}, "298": {"acRate": 53.155329835502364, "difficulty": "Medium", "likes": 1099, "dislikes": 234, "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": 142342, "totalSubmissionRaw": 267785}, "299": {"acRate": 49.81688666814778, "difficulty": "Medium", "likes": 2299, "dislikes": 1750, "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": 356527, "totalSubmissionRaw": 715676}, "300": {"acRate": 53.435731231203185, "difficulty": "Medium", "likes": 19004, "dislikes": 360, "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": 1373054, "totalSubmissionRaw": 2569547}, "301": {"acRate": 47.41936564690565, "difficulty": "Hard", "likes": 5675, "dislikes": 268, "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": 396272, "totalSubmissionRaw": 835678}, "302": {"acRate": 58.70964625176632, "difficulty": "Hard", "likes": 519, "dislikes": 96, "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": 48611, "totalSubmissionRaw": 82799}, "303": {"acRate": 61.375063431406055, "difficulty": "Easy", "likes": 3000, "dislikes": 1860, "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": 474110, "totalSubmissionRaw": 772483}, "304": {"acRate": 53.55122235710641, "difficulty": "Medium", "likes": 4733, "dislikes": 334, "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": 337902, "totalSubmissionRaw": 630991}, "305": {"acRate": 39.58734784039103, "difficulty": "Hard", "likes": 1772, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134768, "totalSubmissionRaw": 340432}, "306": {"acRate": 31.265336046442037, "difficulty": "Medium", "likes": 1084, "dislikes": 779, "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": 83586, "totalSubmissionRaw": 267344}, "307": {"acRate": 40.7560452284725, "difficulty": "Medium", "likes": 4562, "dislikes": 243, "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": 256241, "totalSubmissionRaw": 628719}, "308": {"acRate": 43.52939127810122, "difficulty": "Hard", "likes": 780, "dislikes": 89, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 74990, "totalSubmissionRaw": 172277}, "309": {"acRate": 57.364016259689166, "difficulty": "Medium", "likes": 8980, "dislikes": 292, "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": 453130, "totalSubmissionRaw": 789921}, "310": {"acRate": 38.67407316207623, "difficulty": "Medium", "likes": 7202, "dislikes": 299, "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": 266997, "totalSubmissionRaw": 690381}, "311": {"acRate": 67.78927831039464, "difficulty": "Medium", "likes": 1021, "dislikes": 347, "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": 181156, "totalSubmissionRaw": 267234}, "312": {"acRate": 58.056338478911364, "difficulty": "Hard", "likes": 8549, "dislikes": 218, "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": 253974, "totalSubmissionRaw": 437462}, "313": {"acRate": 45.31369995659287, "difficulty": "Medium", "likes": 2053, "dislikes": 369, "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": 122139, "totalSubmissionRaw": 269541}, "314": {"acRate": 52.761890768583896, "difficulty": "Medium", "likes": 3005, "dislikes": 296, "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": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337550, "totalSubmissionRaw": 639761}, "315": {"acRate": 42.40398052263244, "difficulty": "Hard", "likes": 8529, "dislikes": 230, "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": 303137, "totalSubmissionRaw": 714880}, "316": {"acRate": 48.846592742032556, "difficulty": "Medium", "likes": 8257, "dislikes": 563, "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": 304343, "totalSubmissionRaw": 623063}, "317": {"acRate": 42.65431717718798, "difficulty": "Hard", "likes": 1798, "dislikes": 254, "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": 158927, "totalSubmissionRaw": 372593}, "318": {"acRate": 59.805541744146275, "difficulty": "Medium", "likes": 3393, "dislikes": 137, "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": 208088, "totalSubmissionRaw": 347941}, "319": {"acRate": 52.529963650021486, "difficulty": "Medium", "likes": 2508, "dislikes": 3024, "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": 204195, "totalSubmissionRaw": 388721}, "320": {"acRate": 58.001359856343385, "difficulty": "Medium", "likes": 671, "dislikes": 221, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 66538, "totalSubmissionRaw": 114718}, "321": {"acRate": 29.496094395767898, "difficulty": "Hard", "likes": 1817, "dislikes": 342, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"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": 57095, "totalSubmissionRaw": 193568}, "322": {"acRate": 42.9820116404054, "difficulty": "Medium", "likes": 17825, "dislikes": 403, "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": 1553944, "totalSubmissionRaw": 3615335}, "323": {"acRate": 62.4441789118985, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "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": 360064, "totalSubmissionRaw": 576618}, "324": {"acRate": 33.8262000921584, "difficulty": "Medium", "likes": 2939, "dislikes": 940, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149754, "totalSubmissionRaw": 442716}, "325": {"acRate": 49.34116938250668, "difficulty": "Medium", "likes": 1979, "dislikes": 60, "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": 176895, "totalSubmissionRaw": 358514}, "326": {"acRate": 45.901313048520116, "difficulty": "Easy", "likes": 2898, "dislikes": 263, "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": 742574, "totalSubmissionRaw": 1617762}, "327": {"acRate": 35.756021020647054, "difficulty": "Hard", "likes": 2186, "dislikes": 226, "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": 71782, "totalSubmissionRaw": 200753}, "328": {"acRate": 61.34542361274254, "difficulty": "Medium", "likes": 9212, "dislikes": 490, "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": 799044, "totalSubmissionRaw": 1302530}, "329": {"acRate": 52.94034600937558, "difficulty": "Hard", "likes": 8586, "dislikes": 127, "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": 476233, "totalSubmissionRaw": 899568}, "330": {"acRate": 40.79730893979323, "difficulty": "Hard", "likes": 1407, "dislikes": 129, "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": 64401, "totalSubmissionRaw": 157856}, "331": {"acRate": 44.82757464275773, "difficulty": "Medium", "likes": 2211, "dislikes": 114, "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": 133670, "totalSubmissionRaw": 298187}, "332": {"acRate": 43.50537022236334, "difficulty": "Hard", "likes": 5633, "dislikes": 1808, "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": 397360, "totalSubmissionRaw": 913360}, "333": {"acRate": 43.16868125696611, "difficulty": "Medium", "likes": 1427, "dislikes": 118, "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": 99924, "totalSubmissionRaw": 231474}, "334": {"acRate": 41.017037116575395, "difficulty": "Medium", "likes": 7415, "dislikes": 382, "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": 458383, "totalSubmissionRaw": 1117532}, "335": {"acRate": 29.70672422692506, "difficulty": "Hard", "likes": 356, "dislikes": 497, "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": 31654, "totalSubmissionRaw": 106555}, "336": {"acRate": 35.00413963787476, "difficulty": "Hard", "likes": 4354, "dislikes": 442, "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": 197444, "totalSubmissionRaw": 564059}, "337": {"acRate": 54.06387224942127, "difficulty": "Medium", "likes": 8184, "dislikes": 132, "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": 355688, "totalSubmissionRaw": 657905}, "338": {"acRate": 77.58136281092679, "difficulty": "Easy", "likes": 10553, "dislikes": 481, "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": 960388, "totalSubmissionRaw": 1237911}, "339": {"acRate": 82.53378701346523, "difficulty": "Medium", "likes": 1617, "dislikes": 372, "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": 233101, "totalSubmissionRaw": 282431}, "340": {"acRate": 48.37494659081943, "difficulty": "Medium", "likes": 2743, "dislikes": 79, "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": 324934, "totalSubmissionRaw": 671697}, "341": {"acRate": 62.10999633445069, "difficulty": "Medium", "likes": 4328, "dislikes": 1523, "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": 374468, "totalSubmissionRaw": 602911}, "342": {"acRate": 46.8071834421621, "difficulty": "Easy", "likes": 3286, "dislikes": 348, "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": 503503, "totalSubmissionRaw": 1075696}, "343": {"acRate": 59.91494204135477, "difficulty": "Medium", "likes": 4895, "dislikes": 420, "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": 330645, "totalSubmissionRaw": 551858}, "344": {"acRate": 77.28410121885332, "difficulty": "Easy", "likes": 7951, "dislikes": 1129, "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": 2274416, "totalSubmissionRaw": 2942929}, "345": {"acRate": 51.42161681261172, "difficulty": "Easy", "likes": 4050, "dislikes": 2672, "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": 639246, "totalSubmissionRaw": 1243147}, "346": {"acRate": 77.30374939997243, "difficulty": "Easy", "likes": 1543, "dislikes": 156, "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": 325302, "totalSubmissionRaw": 420811}, "347": {"acRate": 62.99815132948103, "difficulty": "Medium", "likes": 16129, "dislikes": 586, "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": 1734546, "totalSubmissionRaw": 2753328}, "348": {"acRate": 57.70332547787379, "difficulty": "Medium", "likes": 1985, "dislikes": 114, "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": 220369, "totalSubmissionRaw": 381900}, "349": {"acRate": 71.7115155962514, "difficulty": "Easy", "likes": 5315, "dislikes": 2195, "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": 934241, "totalSubmissionRaw": 1302776}, "350": {"acRate": 56.18746260586139, "difficulty": "Easy", "likes": 6881, "dislikes": 910, "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": 1122235, "totalSubmissionRaw": 1997305}, "351": {"acRate": 51.73375701044062, "difficulty": "Medium", "likes": 149, "dislikes": 168, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70659, "totalSubmissionRaw": 136582}, "352": {"acRate": 59.84992267678898, "difficulty": "Hard", "likes": 1686, "dislikes": 352, "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": 102171, "totalSubmissionRaw": 170712}, "353": {"acRate": 38.85400197261143, "difficulty": "Medium", "likes": 902, "dislikes": 318, "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": 78393, "totalSubmissionRaw": 201763}, "354": {"acRate": 37.31343007705858, "difficulty": "Hard", "likes": 5641, "dislikes": 137, "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": 201872, "totalSubmissionRaw": 541017}, "355": {"acRate": 38.47894508929986, "difficulty": "Medium", "likes": 3509, "dislikes": 446, "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": 145729, "totalSubmissionRaw": 378724}, "356": {"acRate": 35.14424913133797, "difficulty": "Medium", "likes": 276, "dislikes": 580, "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": 37727, "totalSubmissionRaw": 107349}, "357": {"acRate": 52.3613784538963, "difficulty": "Medium", "likes": 1418, "dislikes": 1457, "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": 126492, "totalSubmissionRaw": 241575}, "358": {"acRate": 38.42750616205423, "difficulty": "Hard", "likes": 932, "dislikes": 37, "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": 61582, "totalSubmissionRaw": 160254}, "359": {"acRate": 75.65300886291368, "difficulty": "Easy", "likes": 1639, "dislikes": 185, "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"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 290733, "totalSubmissionRaw": 384298}, "360": {"acRate": 55.3100792157206, "difficulty": "Medium", "likes": 655, "dislikes": 202, "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": 63189, "totalSubmissionRaw": 114245}, "361": {"acRate": 51.55847675836834, "difficulty": "Medium", "likes": 931, "dislikes": 114, "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": 76090, "totalSubmissionRaw": 147580}, "362": {"acRate": 68.46569509378521, "difficulty": "Medium", "likes": 1939, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "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": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219957, "totalSubmissionRaw": 321266}, "363": {"acRate": 43.97654294604081, "difficulty": "Hard", "likes": 3375, "dislikes": 167, "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": 121410, "totalSubmissionRaw": 276079}, "364": {"acRate": 66.09156261823685, "difficulty": "Medium", "likes": 1098, "dislikes": 421, "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": 131010, "totalSubmissionRaw": 198225}, "365": {"acRate": 38.99982453061941, "difficulty": "Medium", "likes": 1335, "dislikes": 1402, "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": 88904, "totalSubmissionRaw": 227960}, "366": {"acRate": 80.38963685608351, "difficulty": "Medium", "likes": 3129, "dislikes": 53, "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": 244571, "totalSubmissionRaw": 304232}, "367": {"acRate": 43.40536155283108, "difficulty": "Easy", "likes": 3971, "dislikes": 290, "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": 533958, "totalSubmissionRaw": 1230166}, "368": {"acRate": 42.174611584202346, "difficulty": "Medium", "likes": 4944, "dislikes": 187, "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": 195826, "totalSubmissionRaw": 464322}, "369": {"acRate": 60.933258410959766, "difficulty": "Medium", "likes": 913, "dislikes": 42, "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": 76985, "totalSubmissionRaw": 126345}, "370": {"acRate": 71.35718521446927, "difficulty": "Medium", "likes": 1600, "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": 90249, "totalSubmissionRaw": 126475}, "371": {"acRate": 51.068677679663544, "difficulty": "Medium", "likes": 3858, "dislikes": 5254, "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": 422937, "totalSubmissionRaw": 828173}, "372": {"acRate": 35.66268661673614, "difficulty": "Medium", "likes": 845, "dislikes": 1393, "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": 64425, "totalSubmissionRaw": 180651}, "373": {"acRate": 40.09198763991936, "difficulty": "Medium", "likes": 5854, "dislikes": 380, "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": 264294, "totalSubmissionRaw": 659219}, "374": {"acRate": 52.60021627364308, "difficulty": "Easy", "likes": 3398, "dislikes": 440, "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": 554522, "totalSubmissionRaw": 1054217}, "375": {"acRate": 47.963963203645875, "difficulty": "Medium", "likes": 2017, "dislikes": 2052, "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": 113665, "totalSubmissionRaw": 236980}, "376": {"acRate": 48.37481172299831, "difficulty": "Medium", "likes": 4941, "dislikes": 155, "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": 231561, "totalSubmissionRaw": 478680}, "377": {"acRate": 53.9562112811086, "difficulty": "Medium", "likes": 7145, "dislikes": 639, "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": 449676, "totalSubmissionRaw": 833410}, "378": {"acRate": 62.03533083262938, "difficulty": "Medium", "likes": 9528, "dislikes": 329, "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": 566925, "totalSubmissionRaw": 913874}, "379": {"acRate": 51.40708845596627, "difficulty": "Medium", "likes": 340, "dislikes": 457, "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": 63515, "totalSubmissionRaw": 123553}, "380": {"acRate": 52.80519349483127, "difficulty": "Medium", "likes": 8112, "dislikes": 450, "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": 690822, "totalSubmissionRaw": 1308247}, "381": {"acRate": 35.40003025620522, "difficulty": "Hard", "likes": 2174, "dislikes": 140, "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": 131041, "totalSubmissionRaw": 370172}, "382": {"acRate": 62.89946096180049, "difficulty": "Medium", "likes": 2997, "dislikes": 691, "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": 231743, "totalSubmissionRaw": 368434}, "383": {"acRate": 59.63817663632999, "difficulty": "Easy", "likes": 4569, "dislikes": 461, "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": 920097, "totalSubmissionRaw": 1542798}, "384": {"acRate": 57.976889479438356, "difficulty": "Medium", "likes": 1284, "dislikes": 894, "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": 317649, "totalSubmissionRaw": 547889}, "385": {"acRate": 37.38215394853594, "difficulty": "Medium", "likes": 439, "dislikes": 1305, "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": 53926, "totalSubmissionRaw": 144256}, "386": {"acRate": 62.615537917053224, "difficulty": "Medium", "likes": 1830, "dislikes": 134, "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": 109338, "totalSubmissionRaw": 174618}, "387": {"acRate": 60.18079607830954, "difficulty": "Easy", "likes": 8267, "dislikes": 266, "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": 1472198, "totalSubmissionRaw": 2446292}, "388": {"acRate": 46.880832930464265, "difficulty": "Medium", "likes": 1202, "dislikes": 2419, "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": 146429, "totalSubmissionRaw": 312343}, "389": {"acRate": 60.35286967575517, "difficulty": "Easy", "likes": 4750, "dislikes": 457, "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": 650443, "totalSubmissionRaw": 1077734}, "390": {"acRate": 45.90778097982709, "difficulty": "Medium", "likes": 1423, "dislikes": 665, "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": 63720, "totalSubmissionRaw": 138800}, "391": {"acRate": 33.1708258917797, "difficulty": "Hard", "likes": 829, "dislikes": 113, "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": 41232, "totalSubmissionRaw": 124302}, "392": {"acRate": 47.99355978546281, "difficulty": "Easy", "likes": 8912, "dislikes": 476, "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": 1124084, "totalSubmissionRaw": 2342150}, "393": {"acRate": 44.994726914659175, "difficulty": "Medium", "likes": 881, "dislikes": 2840, "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": 119034, "totalSubmissionRaw": 264551}, "394": {"acRate": 58.4808584825961, "difficulty": "Medium", "likes": 11869, "dislikes": 539, "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": 706761, "totalSubmissionRaw": 1208535}, "395": {"acRate": 44.86950413767368, "difficulty": "Medium", "likes": 5851, "dislikes": 466, "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": 204412, "totalSubmissionRaw": 455569}, "396": {"acRate": 41.7895021386888, "difficulty": "Medium", "likes": 1472, "dislikes": 257, "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": 78843, "totalSubmissionRaw": 188667}, "397": {"acRate": 35.42685120696086, "difficulty": "Medium", "likes": 1249, "dislikes": 474, "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": 107325, "totalSubmissionRaw": 302950}, "398": {"acRate": 62.52872610673202, "difficulty": "Medium", "likes": 1195, "dislikes": 1245, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 196176, "totalSubmissionRaw": 313738}, "399": {"acRate": 61.40782831114121, "difficulty": "Medium", "likes": 8694, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 410776, "totalSubmissionRaw": 668931}, "400": {"acRate": 34.3020037214166, "difficulty": "Medium", "likes": 985, "dislikes": 1943, "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": 89223, "totalSubmissionRaw": 260114}, "401": {"acRate": 53.17421319306273, "difficulty": "Easy", "likes": 1290, "dislikes": 2373, "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": 132022, "totalSubmissionRaw": 248282}, "402": {"acRate": 30.784200346573513, "difficulty": "Medium", "likes": 8250, "dislikes": 359, "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": 336466, "totalSubmissionRaw": 1092985}, "403": {"acRate": 45.859474424523874, "difficulty": "Hard", "likes": 5338, "dislikes": 240, "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": 246477, "totalSubmissionRaw": 537462}, "404": {"acRate": 57.276764717410046, "difficulty": "Easy", "likes": 4834, "dislikes": 280, "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": 467635, "totalSubmissionRaw": 816448}, "405": {"acRate": 47.50479533266374, "difficulty": "Easy", "likes": 1259, "dislikes": 204, "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": 131013, "totalSubmissionRaw": 275789}, "406": {"acRate": 73.18172763925274, "difficulty": "Medium", "likes": 6911, "dislikes": 692, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290238, "totalSubmissionRaw": 396599}, "407": {"acRate": 47.62077670574403, "difficulty": "Hard", "likes": 3600, "dislikes": 84, "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": 82623, "totalSubmissionRaw": 173502}, "408": {"acRate": 35.005199325434674, "difficulty": "Easy", "likes": 610, "dislikes": 2006, "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": 129937, "totalSubmissionRaw": 371190}, "409": {"acRate": 53.89826665370991, "difficulty": "Easy", "likes": 5053, "dislikes": 329, "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": 565740, "totalSubmissionRaw": 1049639}, "410": {"acRate": 54.37870668881969, "difficulty": "Hard", "likes": 9091, "dislikes": 189, "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": 296526, "totalSubmissionRaw": 545298}, "411": {"acRate": 39.60108496123181, "difficulty": "Hard", "likes": 179, "dislikes": 142, "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": 14454, "totalSubmissionRaw": 36499}, "412": {"acRate": 70.98340431130954, "difficulty": "Easy", "likes": 2399, "dislikes": 312, "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": 1089750, "totalSubmissionRaw": 1535213}, "413": {"acRate": 65.02119450835353, "difficulty": "Medium", "likes": 5053, "dislikes": 286, "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": 285155, "totalSubmissionRaw": 438557}, "414": {"acRate": 33.93395269287851, "difficulty": "Easy", "likes": 2808, "dislikes": 2969, "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": 472608, "totalSubmissionRaw": 1392728}, "415": {"acRate": 51.88978350454229, "difficulty": "Easy", "likes": 4764, "dislikes": 694, "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": 602773, "totalSubmissionRaw": 1161640}, "416": {"acRate": 46.17938501739906, "difficulty": "Medium", "likes": 11580, "dislikes": 210, "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": 713960, "totalSubmissionRaw": 1546059}, "417": {"acRate": 54.79109804459673, "difficulty": "Medium", "likes": 6926, "dislikes": 1345, "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": 403293, "totalSubmissionRaw": 736053}, "418": {"acRate": 35.719952102978596, "difficulty": "Medium", "likes": 1074, "dislikes": 524, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "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": 95457, "totalSubmissionRaw": 267239}, "419": {"acRate": 75.02834179026293, "difficulty": "Medium", "likes": 2149, "dislikes": 932, "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": 191926, "totalSubmissionRaw": 255804}, "420": {"acRate": 13.539809025034424, "difficulty": "Hard", "likes": 790, "dislikes": 1667, "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": 35988, "totalSubmissionRaw": 265794}, "421": {"acRate": 53.640509965882565, "difficulty": "Medium", "likes": 5225, "dislikes": 375, "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": 149362, "totalSubmissionRaw": 278449}, "422": {"acRate": 40.46293246731363, "difficulty": "Easy", "likes": 403, "dislikes": 261, "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": 52828, "totalSubmissionRaw": 130558}, "423": {"acRate": 51.134514767932494, "difficulty": "Medium", "likes": 784, "dislikes": 2615, "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": 75743, "totalSubmissionRaw": 148125}, "424": {"acRate": 52.72195739366384, "difficulty": "Medium", "likes": 9580, "dislikes": 418, "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": 564830, "totalSubmissionRaw": 1071338}, "425": {"acRate": 53.12263969314159, "difficulty": "Hard", "likes": 1069, "dislikes": 70, "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": 71740, "totalSubmissionRaw": 135046}, "426": {"acRate": 64.69608681494111, "difficulty": "Medium", "likes": 2459, "dislikes": 190, "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": 244369, "totalSubmissionRaw": 377718}, "427": {"acRate": 74.94114323382615, "difficulty": "Medium", "likes": 1387, "dislikes": 1732, "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": 103454, "totalSubmissionRaw": 138047}, "428": {"acRate": 66.31656381543995, "difficulty": "Hard", "likes": 1015, "dislikes": 56, "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": 81135, "totalSubmissionRaw": 122345}, "429": {"acRate": 70.72523800917355, "difficulty": "Medium", "likes": 3521, "dislikes": 134, "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": 289576, "totalSubmissionRaw": 409438}, "430": {"acRate": 59.79198361441789, "difficulty": "Medium", "likes": 4814, "dislikes": 310, "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": 303017, "totalSubmissionRaw": 506786}, "431": {"acRate": 79.14357682619647, "difficulty": "Hard", "likes": 503, "dislikes": 26, "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": 20423, "totalSubmissionRaw": 25805}, "432": {"acRate": 36.519243143247806, "difficulty": "Hard", "likes": 1474, "dislikes": 163, "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": 72646, "totalSubmissionRaw": 198927}, "433": {"acRate": 52.98735349760965, "difficulty": "Medium", "likes": 2721, "dislikes": 283, "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": 134998, "totalSubmissionRaw": 254774}, "434": {"acRate": 36.62339392742034, "difficulty": "Easy", "likes": 725, "dislikes": 1234, "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": 159420, "totalSubmissionRaw": 435299}, "435": {"acRate": 52.2968353296014, "difficulty": "Medium", "likes": 7578, "dislikes": 201, "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": 475609, "totalSubmissionRaw": 909444}, "436": {"acRate": 51.487220142700885, "difficulty": "Medium", "likes": 1993, "dislikes": 320, "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": 102613, "totalSubmissionRaw": 199298}, "437": {"acRate": 47.08362980388887, "difficulty": "Medium", "likes": 10305, "dislikes": 483, "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": 496953, "totalSubmissionRaw": 1055469}, "438": {"acRate": 50.4646005110887, "difficulty": "Medium", "likes": 11834, "dislikes": 321, "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": 807092, "totalSubmissionRaw": 1599324}, "439": {"acRate": 60.37042107527723, "difficulty": "Medium", "likes": 464, "dislikes": 61, "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": 30868, "totalSubmissionRaw": 51131}, "440": {"acRate": 31.612635571623304, "difficulty": "Hard", "likes": 734, "dislikes": 86, "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": 21336, "totalSubmissionRaw": 67492}, "441": {"acRate": 46.379408920291716, "difficulty": "Easy", "likes": 3627, "dislikes": 1278, "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": 391810, "totalSubmissionRaw": 844793}, "442": {"acRate": 73.60880066488825, "difficulty": "Medium", "likes": 9295, "dislikes": 326, "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": 565942, "totalSubmissionRaw": 768851}, "443": {"acRate": 53.04575630657219, "difficulty": "Medium", "likes": 4403, "dislikes": 7008, "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": 451131, "totalSubmissionRaw": 850448}, "444": {"acRate": 27.370336001845413, "difficulty": "Medium", "likes": 539, "dislikes": 1478, "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": 52207, "totalSubmissionRaw": 190743}, "445": {"acRate": 61.03008777882363, "difficulty": "Medium", "likes": 5701, "dislikes": 279, "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": 446085, "totalSubmissionRaw": 730925}, "446": {"acRate": 46.582088104017075, "difficulty": "Hard", "likes": 2394, "dislikes": 116, "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": 76812, "totalSubmissionRaw": 164896}, "447": {"acRate": 55.13003912376553, "difficulty": "Medium", "likes": 795, "dislikes": 994, "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": 95961, "totalSubmissionRaw": 174063}, "448": {"acRate": 60.414233547409694, "difficulty": "Easy", "likes": 8964, "dislikes": 454, "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": 791972, "totalSubmissionRaw": 1310903}, "449": {"acRate": 57.328351903411836, "difficulty": "Medium", "likes": 3405, "dislikes": 161, "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": 225258, "totalSubmissionRaw": 392926}, "450": {"acRate": 50.676212137128395, "difficulty": "Medium", "likes": 8419, "dislikes": 225, "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": 414872, "totalSubmissionRaw": 818675}, "451": {"acRate": 70.4050405040504, "difficulty": "Medium", "likes": 7322, "dislikes": 242, "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": 547540, "totalSubmissionRaw": 777699}, "452": {"acRate": 55.643244426510975, "difficulty": "Medium", "likes": 6519, "dislikes": 184, "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": 340614, "totalSubmissionRaw": 612139}, "453": {"acRate": 56.390788467781626, "difficulty": "Medium", "likes": 2449, "dislikes": 1869, "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": 161541, "totalSubmissionRaw": 286467}, "454": {"acRate": 57.129266460819494, "difficulty": "Medium", "likes": 4777, "dislikes": 135, "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": 308061, "totalSubmissionRaw": 539235}, "455": {"acRate": 49.69989375907677, "difficulty": "Easy", "likes": 2677, "dislikes": 242, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 254953, "totalSubmissionRaw": 512985}, "456": {"acRate": 33.70171883166729, "difficulty": "Medium", "likes": 6890, "dislikes": 394, "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": 236641, "totalSubmissionRaw": 702162}, "457": {"acRate": 33.1740869197515, "difficulty": "Medium", "likes": 624, "dislikes": 644, "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": 73745, "totalSubmissionRaw": 222297}, "458": {"acRate": 61.482144309769794, "difficulty": "Hard", "likes": 1411, "dislikes": 2867, "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": 75580, "totalSubmissionRaw": 122930}, "459": {"acRate": 46.05279606870671, "difficulty": "Easy", "likes": 6151, "dislikes": 486, "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": 405223, "totalSubmissionRaw": 879910}, "460": {"acRate": 43.61264114699808, "difficulty": "Hard", "likes": 5365, "dislikes": 319, "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": 229539, "totalSubmissionRaw": 526310}, "461": {"acRate": 75.16841989011293, "difficulty": "Easy", "likes": 3714, "dislikes": 215, "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": 544505, "totalSubmissionRaw": 724380}, "462": {"acRate": 59.95631431112115, "difficulty": "Medium", "likes": 3219, "dislikes": 119, "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": 169909, "totalSubmissionRaw": 283388}, "463": {"acRate": 69.93922823475506, "difficulty": "Easy", "likes": 6027, "dislikes": 303, "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": 464021, "totalSubmissionRaw": 663463}, "464": {"acRate": 29.530849178853835, "difficulty": "Medium", "likes": 2557, "dislikes": 367, "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": 89332, "totalSubmissionRaw": 302504}, "465": {"acRate": 49.35621037816304, "difficulty": "Hard", "likes": 1387, "dislikes": 129, "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": 82760, "totalSubmissionRaw": 167679}, "466": {"acRate": 29.6386770236547, "difficulty": "Hard", "likes": 387, "dislikes": 338, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 16865, "totalSubmissionRaw": 56902}, "467": {"acRate": 39.0925559332163, "difficulty": "Medium", "likes": 1375, "dislikes": 167, "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": 41865, "totalSubmissionRaw": 107092}, "468": {"acRate": 26.729992286572703, "difficulty": "Medium", "likes": 933, "dislikes": 2654, "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": 148665, "totalSubmissionRaw": 556173}, "469": {"acRate": 39.29669340931244, "difficulty": "Medium", "likes": 97, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10482, "totalSubmissionRaw": 26674}, "470": {"acRate": 46.014794970927575, "difficulty": "Medium", "likes": 1055, "dislikes": 353, "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": 75577, "totalSubmissionRaw": 164245}, "471": {"acRate": 50.49352818371607, "difficulty": "Hard", "likes": 618, "dislikes": 49, "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": 30233, "totalSubmissionRaw": 59875}, "472": {"acRate": 49.74689722493376, "difficulty": "Hard", "likes": 3743, "dislikes": 276, "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": 214041, "totalSubmissionRaw": 430260}, "473": {"acRate": 40.172178611425146, "difficulty": "Medium", "likes": 3669, "dislikes": 280, "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": 151373, "totalSubmissionRaw": 376812}, "474": {"acRate": 47.15092747239379, "difficulty": "Medium", "likes": 5221, "dislikes": 432, "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": 186042, "totalSubmissionRaw": 394567}, "475": {"acRate": 36.99203516653116, "difficulty": "Medium", "likes": 1970, "dislikes": 1129, "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": 107378, "totalSubmissionRaw": 290274}, "476": {"acRate": 67.49195703794291, "difficulty": "Easy", "likes": 2577, "dislikes": 118, "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": 312371, "totalSubmissionRaw": 462827}, "477": {"acRate": 52.27659781213402, "difficulty": "Medium", "likes": 2127, "dislikes": 88, "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": 102217, "totalSubmissionRaw": 195532}, "478": {"acRate": 39.56081185130432, "difficulty": "Medium", "likes": 434, "dislikes": 758, "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": 38535, "totalSubmissionRaw": 97407}, "479": {"acRate": 32.470658190930585, "difficulty": "Hard", "likes": 165, "dislikes": 1540, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22935, "totalSubmissionRaw": 70633}, "480": {"acRate": 39.8566856616933, "difficulty": "Hard", "likes": 3031, "dislikes": 178, "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": 133380, "totalSubmissionRaw": 334649}, "481": {"acRate": 50.92231394962049, "difficulty": "Medium", "likes": 281, "dislikes": 1204, "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": 33679, "totalSubmissionRaw": 66138}, "482": {"acRate": 43.411171008887536, "difficulty": "Easy", "likes": 1035, "dislikes": 1362, "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": 262200, "totalSubmissionRaw": 603990}, "483": {"acRate": 39.40844186411423, "difficulty": "Hard", "likes": 364, "dislikes": 479, "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": 20092, "totalSubmissionRaw": 50984}, "484": {"acRate": 66.8800057208238, "difficulty": "Medium", "likes": 676, "dislikes": 133, "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": 37410, "totalSubmissionRaw": 55936}, "485": {"acRate": 57.778655208181775, "difficulty": "Easy", "likes": 5218, "dislikes": 445, "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": 984818, "totalSubmissionRaw": 1704469}, "486": {"acRate": 55.450194873723916, "difficulty": "Medium", "likes": 5576, "dislikes": 259, "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": 212267, "totalSubmissionRaw": 382808}, "487": {"acRate": 49.8695944809019, "difficulty": "Medium", "likes": 1459, "dislikes": 24, "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": 130405, "totalSubmissionRaw": 261492}, "488": {"acRate": 33.228600924637554, "difficulty": "Hard", "likes": 427, "dislikes": 481, "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": 22209, "totalSubmissionRaw": 66837}, "489": {"acRate": 76.56653986555327, "difficulty": "Hard", "likes": 2672, "dislikes": 163, "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": 149547, "totalSubmissionRaw": 195315}, "490": {"acRate": 56.99562183708588, "difficulty": "Medium", "likes": 1772, "dislikes": 177, "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": 156999, "totalSubmissionRaw": 275458}, "491": {"acRate": 60.39502112770311, "difficulty": "Medium", "likes": 3529, "dislikes": 224, "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": 157935, "totalSubmissionRaw": 261504}, "492": {"acRate": 56.09897203220502, "difficulty": "Easy", "likes": 653, "dislikes": 374, "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": 104725, "totalSubmissionRaw": 186679}, "493": {"acRate": 30.44906382515144, "difficulty": "Hard", "likes": 5675, "dislikes": 242, "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": 148131, "totalSubmissionRaw": 486490}, "494": {"acRate": 46.0912690983459, "difficulty": "Medium", "likes": 10258, "dislikes": 331, "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": 516999, "totalSubmissionRaw": 1121688}, "495": {"acRate": 56.50282713551555, "difficulty": "Easy", "likes": 1033, "dislikes": 107, "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": 136004, "totalSubmissionRaw": 240703}, "496": {"acRate": 71.69865303476752, "difficulty": "Easy", "likes": 7198, "dislikes": 543, "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": 603944, "totalSubmissionRaw": 842336}, "497": {"acRate": 39.519060490260046, "difficulty": "Medium", "likes": 449, "dislikes": 656, "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": 38160, "totalSubmissionRaw": 96561}, "498": {"acRate": 58.70667678507323, "difficulty": "Medium", "likes": 3165, "dislikes": 635, "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": 258379, "totalSubmissionRaw": 440113}, "499": {"acRate": 48.14324923117621, "difficulty": "Hard", "likes": 453, "dislikes": 68, "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": 29118, "totalSubmissionRaw": 60482}, "500": {"acRate": 70.05841295844453, "difficulty": "Easy", "likes": 1479, "dislikes": 1102, "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": 201852, "totalSubmissionRaw": 288120}, "501": {"acRate": 50.18999203772891, "difficulty": "Easy", "likes": 3077, "dislikes": 676, "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": 204863, "totalSubmissionRaw": 408175}, "502": {"acRate": 49.61758629186648, "difficulty": "Hard", "likes": 2878, "dislikes": 181, "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": 104707, "totalSubmissionRaw": 211028}, "503": {"acRate": 63.43340518358851, "difficulty": "Medium", "likes": 7440, "dislikes": 180, "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": 342548, "totalSubmissionRaw": 540012}, "504": {"acRate": 49.21354249637374, "difficulty": "Easy", "likes": 746, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117393, "totalSubmissionRaw": 238538}, "505": {"acRate": 53.13867239567816, "difficulty": "Medium", "likes": 1286, "dislikes": 56, "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": 101653, "totalSubmissionRaw": 191301}, "506": {"acRate": 62.27971935105465, "difficulty": "Easy", "likes": 1245, "dislikes": 62, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 140693, "totalSubmissionRaw": 225905}, "507": {"acRate": 38.48442956384909, "difficulty": "Easy", "likes": 975, "dislikes": 1180, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155058, "totalSubmissionRaw": 402911}, "508": {"acRate": 65.63546720153346, "difficulty": "Medium", "likes": 2136, "dislikes": 297, "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": 132858, "totalSubmissionRaw": 202418}, "509": {"acRate": 70.37634934310906, "difficulty": "Easy", "likes": 7598, "dislikes": 332, "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": 1525819, "totalSubmissionRaw": 2168086}, "510": {"acRate": 60.98650779744174, "difficulty": "Medium", "likes": 840, "dislikes": 40, "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": 62649, "totalSubmissionRaw": 102726}, "511": {"acRate": 74.42913001635384, "difficulty": "Easy", "likes": 754, "dislikes": 25, "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": 221187, "totalSubmissionRaw": 297178}, "512": {"acRate": 52.4393000558466, "difficulty": "Easy", "likes": 253, "dislikes": 41, "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": 78875, "totalSubmissionRaw": 150412}, "513": {"acRate": 67.50656446436622, "difficulty": "Medium", "likes": 3118, "dislikes": 252, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 229068, "totalSubmissionRaw": 339327}, "514": {"acRate": 47.242056902468725, "difficulty": "Hard", "likes": 874, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 34139, "totalSubmissionRaw": 72264}, "515": {"acRate": 64.48101393845998, "difficulty": "Medium", "likes": 2837, "dislikes": 98, "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": 242270, "totalSubmissionRaw": 375723}, "516": {"acRate": 62.22452623696791, "difficulty": "Medium", "likes": 9063, "dislikes": 315, "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": 432111, "totalSubmissionRaw": 694439}, "517": {"acRate": 40.79736300450437, "difficulty": "Hard", "likes": 733, "dislikes": 209, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 27353, "totalSubmissionRaw": 67046}, "518": {"acRate": 63.154702904968296, "difficulty": "Medium", "likes": 8846, "dislikes": 154, "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": 538386, "totalSubmissionRaw": 852494}, "519": {"acRate": 40.49092362141797, "difficulty": "Medium", "likes": 390, "dislikes": 112, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 17733, "totalSubmissionRaw": 43795}, "520": {"acRate": 56.691689202780324, "difficulty": "Easy", "likes": 3309, "dislikes": 452, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 405849, "totalSubmissionRaw": 715888}, "521": {"acRate": 60.461487540782066, "difficulty": "Easy", "likes": 787, "dislikes": 6375, "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": 102296, "totalSubmissionRaw": 169192}, "522": {"acRate": 40.85758627594954, "difficulty": "Medium", "likes": 485, "dislikes": 1254, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 48967, "totalSubmissionRaw": 119848}, "523": {"acRate": 28.565454966299814, "difficulty": "Medium", "likes": 5192, "dislikes": 502, "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": 414663, "totalSubmissionRaw": 1451622}, "524": {"acRate": 51.067888171084874, "difficulty": "Medium", "likes": 1710, "dislikes": 355, "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": 146716, "totalSubmissionRaw": 287296}, "525": {"acRate": 46.85694213493055, "difficulty": "Medium", "likes": 6769, "dislikes": 270, "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": 310810, "totalSubmissionRaw": 663316}, "526": {"acRate": 64.28307030985691, "difficulty": "Medium", "likes": 3075, "dislikes": 348, "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": 161508, "totalSubmissionRaw": 251245}, "527": {"acRate": 60.7781958337157, "difficulty": "Hard", "likes": 382, "dislikes": 284, "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": 26492, "totalSubmissionRaw": 43588}, "528": {"acRate": 46.23633398918152, "difficulty": "Medium", "likes": 1603, "dislikes": 655, "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": 384217, "totalSubmissionRaw": 830985}, "529": {"acRate": 66.09183795246533, "difficulty": "Medium", "likes": 1867, "dislikes": 1022, "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": 143988, "totalSubmissionRaw": 217860}, "530": {"acRate": 58.64936274574241, "difficulty": "Easy", "likes": 4097, "dislikes": 198, "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": 312319, "totalSubmissionRaw": 532519}, "531": {"acRate": 62.14883805594321, "difficulty": "Medium", "likes": 419, "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": 40971, "totalSubmissionRaw": 65924}, "532": {"acRate": 41.94824214820835, "difficulty": "Medium", "likes": 3648, "dislikes": 2218, "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": 312775, "totalSubmissionRaw": 745624}, "533": {"acRate": 48.49108881234087, "difficulty": "Medium", "likes": 83, "dislikes": 753, "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": 12951, "totalSubmissionRaw": 26708}, "534": {"acRate": 81.09803460044722, "difficulty": "Medium", "likes": 377, "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": 68909, "totalSubmissionRaw": 84970}, "535": {"acRate": 86.14665600319904, "difficulty": "Medium", "likes": 1918, "dislikes": 3688, "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": 241283, "totalSubmissionRaw": 280084}, "536": {"acRate": 56.39066803836326, "difficulty": "Medium", "likes": 1013, "dislikes": 153, "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": "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": 84961, "totalSubmissionRaw": 150665}, "537": {"acRate": 71.54640795003732, "difficulty": "Medium", "likes": 677, "dislikes": 1230, "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": 91075, "totalSubmissionRaw": 127295}, "538": {"acRate": 68.46316129537534, "difficulty": "Medium", "likes": 5031, "dislikes": 170, "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": 279735, "totalSubmissionRaw": 408592}, "539": {"acRate": 56.53320748674818, "difficulty": "Medium", "likes": 1728, "dislikes": 242, "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": 134168, "totalSubmissionRaw": 237326}, "540": {"acRate": 59.00007707915596, "difficulty": "Medium", "likes": 10359, "dislikes": 159, "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": 543463, "totalSubmissionRaw": 921125}, "541": {"acRate": 50.39572519508314, "difficulty": "Easy", "likes": 1804, "dislikes": 3523, "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": 217576, "totalSubmissionRaw": 431734}, "542": {"acRate": 47.72923257981439, "difficulty": "Medium", "likes": 8885, "dislikes": 391, "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": 493156, "totalSubmissionRaw": 1033233}, "543": {"acRate": 58.092255373072966, "difficulty": "Easy", "likes": 12597, "dislikes": 795, "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": 1188229, "totalSubmissionRaw": 2045420}, "544": {"acRate": 77.07436285348538, "difficulty": "Medium", "likes": 382, "dislikes": 129, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 26492, "totalSubmissionRaw": 34372}, "545": {"acRate": 44.76295963240374, "difficulty": "Medium", "likes": 1272, "dislikes": 2053, "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": 122454, "totalSubmissionRaw": 273561}, "546": {"acRate": 47.695415383241816, "difficulty": "Hard", "likes": 2152, "dislikes": 118, "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": 42737, "totalSubmissionRaw": 89604}, "547": {"acRate": 65.53799343339345, "difficulty": "Medium", "likes": 9057, "dislikes": 327, "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": 759915, "totalSubmissionRaw": 1159501}, "548": {"acRate": 50.118037389140554, "difficulty": "Hard", "likes": 410, "dislikes": 132, "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23565, "totalSubmissionRaw": 47019}, "549": {"acRate": 49.43474282228238, "difficulty": "Medium", "likes": 1130, "dislikes": 88, "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": 51861, "totalSubmissionRaw": 104908}, "550": {"acRate": 36.20741826057874, "difficulty": "Medium", "likes": 637, "dislikes": 134, "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": 90940, "totalSubmissionRaw": 251164}, "551": {"acRate": 48.45849225598036, "difficulty": "Easy", "likes": 660, "dislikes": 41, "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": 192607, "totalSubmissionRaw": 397468}, "552": {"acRate": 42.082483358385225, "difficulty": "Hard", "likes": 1680, "dislikes": 248, "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": 62713, "totalSubmissionRaw": 149024}, "553": {"acRate": 60.39201779554466, "difficulty": "Medium", "likes": 357, "dislikes": 1553, "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": 37466, "totalSubmissionRaw": 62038}, "554": {"acRate": 54.21057587768484, "difficulty": "Medium", "likes": 2396, "dislikes": 141, "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": 126650, "totalSubmissionRaw": 233626}, "555": {"acRate": 43.55150143152007, "difficulty": "Medium", "likes": 73, "dislikes": 255, "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": 6541, "totalSubmissionRaw": 15019}, "556": {"acRate": 33.92263684987776, "difficulty": "Medium", "likes": 3476, "dislikes": 436, "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": 136675, "totalSubmissionRaw": 402903}, "557": {"acRate": 82.87680967132482, "difficulty": "Easy", "likes": 5687, "dislikes": 241, "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": 833899, "totalSubmissionRaw": 1006191}, "558": {"acRate": 48.992999461497035, "difficulty": "Medium", "likes": 178, "dislikes": 464, "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": 13647, "totalSubmissionRaw": 27855}, "559": {"acRate": 71.83814997337993, "difficulty": "Easy", "likes": 2664, "dislikes": 83, "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": 263118, "totalSubmissionRaw": 366265}, "560": {"acRate": 43.2415502123662, "difficulty": "Medium", "likes": 20046, "dislikes": 591, "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": 1065124, "totalSubmissionRaw": 2463196}, "561": {"acRate": 77.91540227554191, "difficulty": "Easy", "likes": 1888, "dislikes": 235, "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": 430332, "totalSubmissionRaw": 552307}, "562": {"acRate": 50.315980966474115, "difficulty": "Medium", "likes": 869, "dislikes": 114, "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": 74125, "totalSubmissionRaw": 147319}, "563": {"acRate": 60.904821569162046, "difficulty": "Easy", "likes": 2150, "dislikes": 2138, "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": 198811, "totalSubmissionRaw": 326427}, "564": {"acRate": 21.795339169799824, "difficulty": "Hard", "likes": 681, "dislikes": 1373, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 40057, "totalSubmissionRaw": 183787}, "565": {"acRate": 56.326636864688254, "difficulty": "Medium", "likes": 2158, "dislikes": 151, "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": 125498, "totalSubmissionRaw": 222804}, "566": {"acRate": 62.99890371007591, "difficulty": "Easy", "likes": 3389, "dislikes": 391, "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": 360308, "totalSubmissionRaw": 571926}, "567": {"acRate": 44.175929041211035, "difficulty": "Medium", "likes": 10734, "dislikes": 354, "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": 737905, "totalSubmissionRaw": 1670373}, "568": {"acRate": 45.34305232414237, "difficulty": "Hard", "likes": 552, "dislikes": 106, "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": 36639, "totalSubmissionRaw": 80804}, "569": {"acRate": 66.43376896064873, "difficulty": "Hard", "likes": 311, "dislikes": 149, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36702, "totalSubmissionRaw": 55246}, "570": {"acRate": 55.27308766199558, "difficulty": "Medium", "likes": 744, "dislikes": 75, "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": 167864, "totalSubmissionRaw": 303695}, "571": {"acRate": 42.738005690551724, "difficulty": "Hard", "likes": 292, "dislikes": 76, "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": 26136, "totalSubmissionRaw": 61154}, "572": {"acRate": 47.06680017824308, "difficulty": "Easy", "likes": 7780, "dislikes": 452, "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": 735133, "totalSubmissionRaw": 1561894}, "573": {"acRate": 55.32362216549031, "difficulty": "Medium", "likes": 338, "dislikes": 36, "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": false, "totalAcceptedRaw": 18420, "totalSubmissionRaw": 33295}, "574": {"acRate": 60.083540667920786, "difficulty": "Medium", "likes": 164, "dislikes": 414, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59406, "totalSubmissionRaw": 98873}, "575": {"acRate": 66.96311864722647, "difficulty": "Easy", "likes": 1418, "dislikes": 1314, "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": 258710, "totalSubmissionRaw": 386347}, "576": {"acRate": 44.234690521607575, "difficulty": "Medium", "likes": 3104, "dislikes": 232, "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": 121050, "totalSubmissionRaw": 273654}, "577": {"acRate": 73.80935610972776, "difficulty": "Easy", "likes": 605, "dislikes": 164, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178147, "totalSubmissionRaw": 241361}, "578": {"acRate": 40.60437514360644, "difficulty": "Medium", "likes": 118, "dislikes": 900, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51248, "totalSubmissionRaw": 126213}, "579": {"acRate": 45.88018459516224, "difficulty": "Hard", "likes": 221, "dislikes": 399, "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": 32112, "totalSubmissionRaw": 69991}, "580": {"acRate": 58.677092178067234, "difficulty": "Medium", "likes": 237, "dislikes": 35, "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": 62886, "totalSubmissionRaw": 107173}, "581": {"acRate": 36.61030582634376, "difficulty": "Medium", "likes": 7573, "dislikes": 255, "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": 313136, "totalSubmissionRaw": 855322}, "582": {"acRate": 69.01205350705312, "difficulty": "Medium", "likes": 1085, "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": 81359, "totalSubmissionRaw": 117891}, "583": {"acRate": 60.93776485117214, "difficulty": "Medium", "likes": 5500, "dislikes": 80, "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": 226488, "totalSubmissionRaw": 371671}, "584": {"acRate": 68.93410802504066, "difficulty": "Easy", "likes": 1556, "dislikes": 319, "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": 505535, "totalSubmissionRaw": 733355}, "585": {"acRate": 47.60273458042221, "difficulty": "Medium", "likes": 416, "dislikes": 371, "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": 63361, "totalSubmissionRaw": 133105}, "586": {"acRate": 65.63613302743737, "difficulty": "Easy", "likes": 887, "dislikes": 65, "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": 211136, "totalSubmissionRaw": 321677}, "587": {"acRate": 51.903016633775025, "difficulty": "Hard", "likes": 1399, "dislikes": 637, "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": 55230, "totalSubmissionRaw": 106410}, "588": {"acRate": 48.4062387664111, "difficulty": "Hard", "likes": 1398, "dislikes": 146, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90221, "totalSubmissionRaw": 186381}, "589": {"acRate": 75.67712751966272, "difficulty": "Easy", "likes": 3039, "dislikes": 181, "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": 408541, "totalSubmissionRaw": 539849}, "590": {"acRate": 77.58411699153453, "difficulty": "Easy", "likes": 2253, "dislikes": 92, "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": 238099, "totalSubmissionRaw": 306891}, "591": {"acRate": 37.634819648854545, "difficulty": "Hard", "likes": 161, "dislikes": 637, "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": 13783, "totalSubmissionRaw": 36623}, "592": {"acRate": 52.77240691074658, "difficulty": "Medium", "likes": 373, "dislikes": 498, "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": 33844, "totalSubmissionRaw": 64132}, "593": {"acRate": 43.883371519401265, "difficulty": "Medium", "likes": 1000, "dislikes": 890, "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": 101321, "totalSubmissionRaw": 230887}, "594": {"acRate": 54.00589663152093, "difficulty": "Easy", "likes": 2035, "dislikes": 200, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143060, "totalSubmissionRaw": 264897}, "595": {"acRate": 68.60585717249053, "difficulty": "Easy", "likes": 2314, "dislikes": 1241, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 836750, "totalSubmissionRaw": 1219649}, "596": {"acRate": 51.168164829129104, "difficulty": "Easy", "likes": 882, "dislikes": 1055, "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": 305560, "totalSubmissionRaw": 597172}, "597": {"acRate": 42.1421290141819, "difficulty": "Easy", "likes": 290, "dislikes": 755, "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": 70693, "totalSubmissionRaw": 167749}, "598": {"acRate": 55.667196421213724, "difficulty": "Easy", "likes": 902, "dislikes": 940, "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": 94573, "totalSubmissionRaw": 169890}, "599": {"acRate": 54.301399901482526, "difficulty": "Easy", "likes": 1853, "dislikes": 384, "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": 205041, "totalSubmissionRaw": 377598}, "600": {"acRate": 39.62740798073616, "difficulty": "Hard", "likes": 1461, "dislikes": 126, "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": 36863, "totalSubmissionRaw": 93024}, "601": {"acRate": 48.57581650240863, "difficulty": "Hard", "likes": 604, "dislikes": 552, "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": 87930, "totalSubmissionRaw": 181016}, "602": {"acRate": 57.20159716929015, "difficulty": "Medium", "likes": 480, "dislikes": 93, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81797, "totalSubmissionRaw": 143000}, "603": {"acRate": 66.61598242946444, "difficulty": "Easy", "likes": 617, "dislikes": 67, "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": 78860, "totalSubmissionRaw": 118380}, "604": {"acRate": 39.62929487097883, "difficulty": "Easy", "likes": 427, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "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": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31130, "totalSubmissionRaw": 78552}, "605": {"acRate": 30.062481255100966, "difficulty": "Easy", "likes": 5921, "dislikes": 1024, "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": 575348, "totalSubmissionRaw": 1913843}, "606": {"acRate": 64.73227022980551, "difficulty": "Easy", "likes": 2692, "dislikes": 3208, "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": 229149, "totalSubmissionRaw": 353995}, "607": {"acRate": 66.37179482347265, "difficulty": "Easy", "likes": 1033, "dislikes": 85, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176091, "totalSubmissionRaw": 265311}, "608": {"acRate": 71.5285183639614, "difficulty": "Medium", "likes": 1155, "dislikes": 123, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138838, "totalSubmissionRaw": 194100}, "609": {"acRate": 67.61328944529374, "difficulty": "Medium", "likes": 1471, "dislikes": 1638, "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": 147280, "totalSubmissionRaw": 217827}, "610": {"acRate": 70.59345032247586, "difficulty": "Easy", "likes": 447, "dislikes": 113, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104311, "totalSubmissionRaw": 147763}, "611": {"acRate": 50.75184667824589, "difficulty": "Medium", "likes": 3625, "dislikes": 200, "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": 179119, "totalSubmissionRaw": 352930}, "612": {"acRate": 62.16725406441345, "difficulty": "Medium", "likes": 211, "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": 38277, "totalSubmissionRaw": 61571}, "613": {"acRate": 80.48985253321653, "difficulty": "Easy", "likes": 308, "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": 66153, "totalSubmissionRaw": 82188}, "614": {"acRate": 37.88835081437959, "difficulty": "Medium", "likes": 151, "dislikes": 740, "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": 49524, "totalSubmissionRaw": 130712}, "615": {"acRate": 55.98006922266624, "difficulty": "Hard", "likes": 225, "dislikes": 72, "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": 33480, "totalSubmissionRaw": 59807}, "616": {"acRate": 49.218193515774, "difficulty": "Medium", "likes": 1026, "dislikes": 180, "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": 85681, "totalSubmissionRaw": 174084}, "617": {"acRate": 78.76508070064727, "difficulty": "Easy", "likes": 8483, "dislikes": 285, "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": 718930, "totalSubmissionRaw": 912753}, "618": {"acRate": 63.69980021426297, "difficulty": "Hard", "likes": 170, "dislikes": 168, "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": 22000, "totalSubmissionRaw": 34537}, "619": {"acRate": 56.480557822717984, "difficulty": "Easy", "likes": 437, "dislikes": 166, "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": 112106, "totalSubmissionRaw": 198486}, "620": {"acRate": 72.64088315715685, "difficulty": "Easy", "likes": 927, "dislikes": 530, "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": 312945, "totalSubmissionRaw": 430813}, "621": {"acRate": 57.44974309550122, "difficulty": "Medium", "likes": 9033, "dislikes": 1837, "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": 471509, "totalSubmissionRaw": 820733}, "622": {"acRate": 51.338608739137236, "difficulty": "Medium", "likes": 3358, "dislikes": 259, "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": 285397, "totalSubmissionRaw": 555912}, "623": {"acRate": 59.52200808312771, "difficulty": "Medium", "likes": 2907, "dislikes": 227, "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": 156553, "totalSubmissionRaw": 263017}, "624": {"acRate": 41.50956542511894, "difficulty": "Medium", "likes": 693, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": true, "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": 41703, "totalSubmissionRaw": 100466}, "625": {"acRate": 33.506557026258676, "difficulty": "Medium", "likes": 125, "dislikes": 110, "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": 10961, "totalSubmissionRaw": 32713}, "626": {"acRate": 68.4945198721661, "difficulty": "Medium", "likes": 1206, "dislikes": 555, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159670, "totalSubmissionRaw": 233114}, "627": {"acRate": 82.96672752960201, "difficulty": "Easy", "likes": 1651, "dislikes": 562, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 377599, "totalSubmissionRaw": 455121}, "628": {"acRate": 45.31029658159744, "difficulty": "Easy", "likes": 3996, "dislikes": 644, "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": 286927, "totalSubmissionRaw": 633249}, "629": {"acRate": 42.582509722767334, "difficulty": "Hard", "likes": 1968, "dislikes": 220, "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": 59673, "totalSubmissionRaw": 140135}, "630": {"acRate": 40.098058502186646, "difficulty": "Hard", "likes": 3652, "dislikes": 93, "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": 105992, "totalSubmissionRaw": 264332}, "631": {"acRate": 43.53638654216689, "difficulty": "Hard", "likes": 222, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14687, "totalSubmissionRaw": 33735}, "632": {"acRate": 61.94271613409782, "difficulty": "Hard", "likes": 3236, "dislikes": 56, "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": 93881, "totalSubmissionRaw": 151561}, "633": {"acRate": 34.0724500195856, "difficulty": "Medium", "likes": 2396, "dislikes": 532, "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": 183535, "totalSubmissionRaw": 538661}, "634": {"acRate": 42.04336784528228, "difficulty": "Medium", "likes": 214, "dislikes": 161, "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": 10761, "totalSubmissionRaw": 25595}, "635": {"acRate": 61.973038545030015, "difficulty": "Medium", "likes": 462, "dislikes": 203, "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": 33973, "totalSubmissionRaw": 54819}, "636": {"acRate": 61.43572568186998, "difficulty": "Medium", "likes": 1834, "dislikes": 2625, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 194072, "totalSubmissionRaw": 315895}, "637": {"acRate": 71.96272073576098, "difficulty": "Easy", "likes": 4989, "dislikes": 306, "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": 433638, "totalSubmissionRaw": 602587}, "638": {"acRate": 52.41088775967718, "difficulty": "Medium", "likes": 1416, "dislikes": 729, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 56109, "totalSubmissionRaw": 107056}, "639": {"acRate": 30.49047823690025, "difficulty": "Hard", "likes": 1483, "dislikes": 805, "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": 70240, "totalSubmissionRaw": 230367}, "640": {"acRate": 43.57477999019585, "difficulty": "Medium", "likes": 466, "dislikes": 819, "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": 37334, "totalSubmissionRaw": 85678}, "641": {"acRate": 56.80939555506696, "difficulty": "Medium", "likes": 1095, "dislikes": 72, "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": 62012, "totalSubmissionRaw": 109158}, "642": {"acRate": 48.66479256304994, "difficulty": "Hard", "likes": 2034, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"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": 133123, "totalSubmissionRaw": 273552}, "643": {"acRate": 43.096622829643344, "difficulty": "Easy", "likes": 3031, "dislikes": 252, "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": 304916, "totalSubmissionRaw": 707526}, "644": {"acRate": 36.34633327113267, "difficulty": "Hard", "likes": 600, "dislikes": 68, "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": 19478, "totalSubmissionRaw": 53590}, "645": {"acRate": 42.50099800105176, "difficulty": "Easy", "likes": 3903, "dislikes": 907, "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": 288519, "totalSubmissionRaw": 678854}, "646": {"acRate": 59.50615564592502, "difficulty": "Medium", "likes": 4375, "dislikes": 127, "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": 213637, "totalSubmissionRaw": 359017}, "647": {"acRate": 67.84013210795293, "difficulty": "Medium", "likes": 9693, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 628547, "totalSubmissionRaw": 926512}, "648": {"acRate": 62.712808979897815, "difficulty": "Medium", "likes": 2142, "dislikes": 170, "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": 127159, "totalSubmissionRaw": 202764}, "649": {"acRate": 47.38379245300212, "difficulty": "Medium", "likes": 2040, "dislikes": 1546, "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": 103997, "totalSubmissionRaw": 219478}, "650": {"acRate": 53.785977224291216, "difficulty": "Medium", "likes": 3347, "dislikes": 199, "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": 124926, "totalSubmissionRaw": 232265}, "651": {"acRate": 56.058620759167056, "difficulty": "Medium", "likes": 678, "dislikes": 89, "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": 27809, "totalSubmissionRaw": 49607}, "652": {"acRate": 59.18903383997497, "difficulty": "Medium", "likes": 5569, "dislikes": 437, "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": 244050, "totalSubmissionRaw": 412323}, "653": {"acRate": 61.109244405980675, "difficulty": "Easy", "likes": 6406, "dislikes": 253, "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": 492865, "totalSubmissionRaw": 806531}, "654": {"acRate": 85.07679835090939, "difficulty": "Medium", "likes": 5004, "dislikes": 326, "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": 270745, "totalSubmissionRaw": 318236}, "655": {"acRate": 62.60731924783859, "difficulty": "Medium", "likes": 424, "dislikes": 414, "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": 62494, "totalSubmissionRaw": 99819}, "656": {"acRate": 31.961833837561088, "difficulty": "Hard", "likes": 240, "dislikes": 107, "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": 13734, "totalSubmissionRaw": 42970}, "657": {"acRate": 75.44954417151662, "difficulty": "Easy", "likes": 2305, "dislikes": 738, "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": 393197, "totalSubmissionRaw": 521139}, "658": {"acRate": 46.94715600707767, "difficulty": "Medium", "likes": 7640, "dislikes": 602, "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": 472278, "totalSubmissionRaw": 1005976}, "659": {"acRate": 50.897501028134606, "difficulty": "Medium", "likes": 4311, "dislikes": 789, "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": 126237, "totalSubmissionRaw": 248022}, "660": {"acRate": 57.327068079991264, "difficulty": "Hard", "likes": 160, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10492, "totalSubmissionRaw": 18302}, "661": {"acRate": 55.883694916252104, "difficulty": "Easy", "likes": 490, "dislikes": 1886, "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": 75937, "totalSubmissionRaw": 135884}, "662": {"acRate": 42.65860742641425, "difficulty": "Medium", "likes": 8229, "dislikes": 1127, "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": 335161, "totalSubmissionRaw": 785680}, "663": {"acRate": 41.43147934202563, "difficulty": "Medium", "likes": 476, "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": 30124, "totalSubmissionRaw": 72708}, "664": {"acRate": 55.059971188776146, "difficulty": "Hard", "likes": 2130, "dislikes": 204, "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": 70327, "totalSubmissionRaw": 127728}, "665": {"acRate": 24.467364417815105, "difficulty": "Medium", "likes": 5577, "dislikes": 763, "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": 250652, "totalSubmissionRaw": 1024434}, "666": {"acRate": 60.159964342313785, "difficulty": "Medium", "likes": 352, "dislikes": 443, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 24295, "totalSubmissionRaw": 40384}, "667": {"acRate": 59.99676629556059, "difficulty": "Medium", "likes": 769, "dislikes": 1040, "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": 51950, "totalSubmissionRaw": 86588}, "668": {"acRate": 51.528471182715684, "difficulty": "Hard", "likes": 2055, "dislikes": 55, "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": 59553, "totalSubmissionRaw": 115573}, "669": {"acRate": 66.29701994753042, "difficulty": "Medium", "likes": 5624, "dislikes": 251, "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": 277218, "totalSubmissionRaw": 418145}, "670": {"acRate": 47.97783037930836, "difficulty": "Medium", "likes": 3178, "dislikes": 178, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 207755, "totalSubmissionRaw": 433023}, "671": {"acRate": 44.25579433222492, "difficulty": "Easy", "likes": 1736, "dislikes": 1828, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 178342, "totalSubmissionRaw": 402980}, "672": {"acRate": 50.35122091078511, "difficulty": "Medium", "likes": 134, "dislikes": 199, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21074, "totalSubmissionRaw": 41854}, "673": {"acRate": 47.57913894102258, "difficulty": "Medium", "likes": 6457, "dislikes": 257, "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": 209146, "totalSubmissionRaw": 439575}, "674": {"acRate": 49.60522151573565, "difficulty": "Easy", "likes": 2270, "dislikes": 173, "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": 241380, "totalSubmissionRaw": 486602}, "675": {"acRate": 34.11900531923306, "difficulty": "Hard", "likes": 1166, "dislikes": 658, "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": 64720, "totalSubmissionRaw": 189689}, "676": {"acRate": 56.96400744935578, "difficulty": "Medium", "likes": 1337, "dislikes": 197, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 74939, "totalSubmissionRaw": 131555}, "677": {"acRate": 56.67513789666491, "difficulty": "Medium", "likes": 1583, "dislikes": 145, "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": 108606, "totalSubmissionRaw": 191629}, "678": {"acRate": 34.47319500177476, "difficulty": "Medium", "likes": 4910, "dislikes": 123, "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": 229203, "totalSubmissionRaw": 664873}, "679": {"acRate": 49.2427436571834, "difficulty": "Hard", "likes": 1414, "dislikes": 238, "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": 73579, "totalSubmissionRaw": 149421}, "680": {"acRate": 39.685333478308685, "difficulty": "Easy", "likes": 7748, "dislikes": 392, "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": 642366, "totalSubmissionRaw": 1618655}, "681": {"acRate": 46.42196175200494, "difficulty": "Medium", "likes": 709, "dislikes": 1043, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103845, "totalSubmissionRaw": 223698}, "682": {"acRate": 75.16928908968168, "difficulty": "Easy", "likes": 2586, "dislikes": 1845, "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": 289505, "totalSubmissionRaw": 385138}, "683": {"acRate": 36.99529705109057, "difficulty": "Hard", "likes": 788, "dislikes": 685, "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": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59942, "totalSubmissionRaw": 162026}, "684": {"acRate": 62.49616273245763, "difficulty": "Medium", "likes": 5790, "dislikes": 367, "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": 309440, "totalSubmissionRaw": 495127}, "685": {"acRate": 34.14904282737298, "difficulty": "Hard", "likes": 2222, "dislikes": 304, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 65057, "totalSubmissionRaw": 190509}, "686": {"acRate": 34.48030234974389, "difficulty": "Medium", "likes": 2356, "dislikes": 968, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 151994, "totalSubmissionRaw": 440814}, "687": {"acRate": 40.82445467683931, "difficulty": "Medium", "likes": 4068, "dislikes": 659, "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": 170051, "totalSubmissionRaw": 416542}, "688": {"acRate": 56.20430614976365, "difficulty": "Medium", "likes": 3692, "dislikes": 443, "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": 145296, "totalSubmissionRaw": 258514}, "689": {"acRate": 49.150008149150715, "difficulty": "Hard", "likes": 1893, "dislikes": 106, "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": 69360, "totalSubmissionRaw": 141119}, "690": {"acRate": 66.13447572581258, "difficulty": "Medium", "likes": 1989, "dislikes": 1323, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200072, "totalSubmissionRaw": 302523}, "691": {"acRate": 46.678089116391924, "difficulty": "Hard", "likes": 1072, "dislikes": 79, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43862, "totalSubmissionRaw": 93967}, "692": {"acRate": 57.52364230077352, "difficulty": "Medium", "likes": 7373, "dislikes": 337, "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": 574633, "totalSubmissionRaw": 998951}, "693": {"acRate": 61.8734734249783, "difficulty": "Easy", "likes": 1289, "dislikes": 110, "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": 122604, "totalSubmissionRaw": 198154}, "694": {"acRate": 60.952328251666984, "difficulty": "Medium", "likes": 2150, "dislikes": 133, "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": 154210, "totalSubmissionRaw": 253001}, "695": {"acRate": 71.8548690382417, "difficulty": "Medium", "likes": 9548, "dislikes": 198, "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": 768083, "totalSubmissionRaw": 1068932}, "696": {"acRate": 65.45575145641476, "difficulty": "Easy", "likes": 3841, "dislikes": 822, "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": 195390, "totalSubmissionRaw": 298507}, "697": {"acRate": 56.11255991997178, "difficulty": "Easy", "likes": 2875, "dislikes": 1650, "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": 194079, "totalSubmissionRaw": 345876}, "698": {"acRate": 38.88537009438649, "difficulty": "Medium", "likes": 6863, "dislikes": 473, "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": 250484, "totalSubmissionRaw": 644160}, "699": {"acRate": 44.78618151340123, "difficulty": "Hard", "likes": 602, "dislikes": 73, "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": 24580, "totalSubmissionRaw": 54883}, "700": {"acRate": 78.72995267304856, "difficulty": "Easy", "likes": 5538, "dislikes": 177, "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": 732618, "totalSubmissionRaw": 930546}, "701": {"acRate": 73.89725973295333, "difficulty": "Medium", "likes": 5450, "dislikes": 163, "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": 458412, "totalSubmissionRaw": 620338}, "702": {"acRate": 71.6786235694887, "difficulty": "Medium", "likes": 880, "dislikes": 44, "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": 91319, "totalSubmissionRaw": 127401}, "703": {"acRate": 56.60206113128001, "difficulty": "Easy", "likes": 5097, "dislikes": 3151, "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": 463987, "totalSubmissionRaw": 819733}, "704": {"acRate": 56.7045498418317, "difficulty": "Easy", "likes": 10943, "dislikes": 218, "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": 2041516, "totalSubmissionRaw": 3600270}, "705": {"acRate": 67.16510318610683, "difficulty": "Easy", "likes": 3616, "dislikes": 290, "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": 372094, "totalSubmissionRaw": 553999}, "706": {"acRate": 65.95626055497547, "difficulty": "Easy", "likes": 4928, "dislikes": 433, "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": 529978, "totalSubmissionRaw": 803530}, "707": {"acRate": 27.97416627570284, "difficulty": "Medium", "likes": 2442, "dislikes": 1532, "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": 287993, "totalSubmissionRaw": 1029490}, "708": {"acRate": 34.864141221325795, "difficulty": "Medium", "likes": 1105, "dislikes": 717, "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": 137891, "totalSubmissionRaw": 395508}, "709": {"acRate": 82.79518635774932, "difficulty": "Easy", "likes": 1726, "dislikes": 2735, "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": 460275, "totalSubmissionRaw": 555920}, "710": {"acRate": 33.43939957285281, "difficulty": "Hard", "likes": 818, "dislikes": 113, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 38673, "totalSubmissionRaw": 115650}, "711": {"acRate": 52.39320638188369, "difficulty": "Hard", "likes": 254, "dislikes": 258, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 10180, "totalSubmissionRaw": 19430}, "712": {"acRate": 64.88799042064797, "difficulty": "Medium", "likes": 3854, "dislikes": 101, "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": 133849, "totalSubmissionRaw": 206277}, "713": {"acRate": 46.52645448827656, "difficulty": "Medium", "likes": 5815, "dislikes": 178, "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": 249292, "totalSubmissionRaw": 535807}, "714": {"acRate": 68.06380517189005, "difficulty": "Medium", "likes": 6788, "dislikes": 188, "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": 315927, "totalSubmissionRaw": 464163}, "715": {"acRate": 44.42825467215712, "difficulty": "Hard", "likes": 1365, "dislikes": 106, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 63117, "totalSubmissionRaw": 142065}, "716": {"acRate": 45.0957357492826, "difficulty": "Hard", "likes": 1857, "dislikes": 502, "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": 143951, "totalSubmissionRaw": 319212}, "717": {"acRate": 45.256181141195356, "difficulty": "Easy", "likes": 836, "dislikes": 2037, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 124340, "totalSubmissionRaw": 274747}, "718": {"acRate": 51.03702784388734, "difficulty": "Medium", "likes": 6532, "dislikes": 160, "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": 279637, "totalSubmissionRaw": 547910}, "719": {"acRate": 37.18243428885429, "difficulty": "Hard", "likes": 2821, "dislikes": 86, "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": 81199, "totalSubmissionRaw": 218380}, "720": {"acRate": 52.134431582616344, "difficulty": "Medium", "likes": 1852, "dislikes": 1459, "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": 142095, "totalSubmissionRaw": 272555}, "721": {"acRate": 56.61953684492337, "difficulty": "Medium", "likes": 6235, "dislikes": 1052, "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": 338380, "totalSubmissionRaw": 597637}, "722": {"acRate": 38.417255536132195, "difficulty": "Medium", "likes": 675, "dislikes": 1749, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 67468, "totalSubmissionRaw": 175619}, "723": {"acRate": 76.96977813490469, "difficulty": "Medium", "likes": 987, "dislikes": 510, "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": 68968, "totalSubmissionRaw": 89604}, "724": {"acRate": 56.15342207855427, "difficulty": "Easy", "likes": 7782, "dislikes": 787, "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": 940134, "totalSubmissionRaw": 1674225}, "725": {"acRate": 63.77026353337574, "difficulty": "Medium", "likes": 3753, "dislikes": 298, "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": 185479, "totalSubmissionRaw": 290855}, "726": {"acRate": 52.506094130883184, "difficulty": "Hard", "likes": 1211, "dislikes": 281, "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": 56003, "totalSubmissionRaw": 106660}, "727": {"acRate": 43.211143331598386, "difficulty": "Hard", "likes": 1430, "dislikes": 87, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 87172, "totalSubmissionRaw": 201735}, "728": {"acRate": 78.10629922654752, "difficulty": "Easy", "likes": 1675, "dislikes": 364, "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": 220448, "totalSubmissionRaw": 282241}, "729": {"acRate": 56.6542386268573, "difficulty": "Medium", "likes": 4072, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"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": 266828, "totalSubmissionRaw": 470977}, "730": {"acRate": 44.80318729222451, "difficulty": "Hard", "likes": 1850, "dislikes": 94, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 34636, "totalSubmissionRaw": 77307}, "731": {"acRate": 55.223548558950434, "difficulty": "Medium", "likes": 1667, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"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": 94329, "totalSubmissionRaw": 170812}, "732": {"acRate": 71.56321629829453, "difficulty": "Hard", "likes": 1901, "dislikes": 261, "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": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86482, "totalSubmissionRaw": 120847}, "733": {"acRate": 63.11091432506149, "difficulty": "Easy", "likes": 7893, "dislikes": 778, "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": 801058, "totalSubmissionRaw": 1269286}, "734": {"acRate": 44.07895195046698, "difficulty": "Easy", "likes": 27, "dislikes": 38, "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": 63285, "totalSubmissionRaw": 143574}, "735": {"acRate": 45.14481618011555, "difficulty": "Medium", "likes": 7197, "dislikes": 797, "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": 400706, "totalSubmissionRaw": 887603}, "736": {"acRate": 51.514258345000364, "difficulty": "Hard", "likes": 457, "dislikes": 345, "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": 20973, "totalSubmissionRaw": 40713}, "737": {"acRate": 49.357207435665615, "difficulty": "Medium", "likes": 815, "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": 67149, "totalSubmissionRaw": 136047}, "738": {"acRate": 47.53201772838008, "difficulty": "Medium", "likes": 1259, "dislikes": 101, "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": 48582, "totalSubmissionRaw": 102209}, "739": {"acRate": 65.88666808518086, "difficulty": "Medium", "likes": 11762, "dislikes": 256, "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": 715286, "totalSubmissionRaw": 1085635}, "740": {"acRate": 56.63332174533801, "difficulty": "Medium", "likes": 7167, "dislikes": 356, "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": 304632, "totalSubmissionRaw": 537904}, "741": {"acRate": 36.52780607048279, "difficulty": "Hard", "likes": 4022, "dislikes": 144, "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": 71726, "totalSubmissionRaw": 196359}, "742": {"acRate": 46.03551775887944, "difficulty": "Medium", "likes": 846, "dislikes": 172, "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": 44172, "totalSubmissionRaw": 95952}, "743": {"acRate": 52.816672701549535, "difficulty": "Medium", "likes": 6989, "dislikes": 346, "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": 424467, "totalSubmissionRaw": 803656}, "744": {"acRate": 51.23019824386711, "difficulty": "Easy", "likes": 4145, "dislikes": 2171, "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": 424453, "totalSubmissionRaw": 828522}, "745": {"acRate": 41.03935481576327, "difficulty": "Hard", "likes": 2221, "dislikes": 476, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "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": 92308, "totalSubmissionRaw": 224927}, "746": {"acRate": 65.00975685743225, "difficulty": "Easy", "likes": 10775, "dislikes": 1627, "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": 1005767, "totalSubmissionRaw": 1547102}, "747": {"acRate": 47.940568968809124, "difficulty": "Easy", "likes": 1123, "dislikes": 870, "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": 220960, "totalSubmissionRaw": 460904}, "748": {"acRate": 59.28767608753434, "difficulty": "Easy", "likes": 500, "dislikes": 1061, "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": 66918, "totalSubmissionRaw": 112870}, "749": {"acRate": 51.1332936489766, "difficulty": "Hard", "likes": 362, "dislikes": 448, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 11167, "totalSubmissionRaw": 21839}, "750": {"acRate": 67.6486380069442, "difficulty": "Medium", "likes": 611, "dislikes": 91, "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": 37798, "totalSubmissionRaw": 55874}, "751": {"acRate": 54.45176815233312, "difficulty": "Medium", "likes": 70, "dislikes": 271, "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": 20816, "totalSubmissionRaw": 38227}, "752": {"acRate": 55.871647309491976, "difficulty": "Medium", "likes": 3802, "dislikes": 141, "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": 213975, "totalSubmissionRaw": 382976}, "753": {"acRate": 56.272383200390685, "difficulty": "Hard", "likes": 497, "dislikes": 79, "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": 55309, "totalSubmissionRaw": 98288}, "754": {"acRate": 42.838513554359935, "difficulty": "Medium", "likes": 1701, "dislikes": 766, "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": 49604, "totalSubmissionRaw": 115793}, "755": {"acRate": 46.56085341066504, "difficulty": "Medium", "likes": 289, "dislikes": 744, "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": 35965, "totalSubmissionRaw": 77243}, "756": {"acRate": 52.49393457709361, "difficulty": "Medium", "likes": 512, "dislikes": 470, "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": 31373, "totalSubmissionRaw": 59765}, "757": {"acRate": 43.976416367373204, "difficulty": "Hard", "likes": 679, "dislikes": 78, "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": 21183, "totalSubmissionRaw": 48169}, "758": {"acRate": 51.08628702614928, "difficulty": "Medium", "likes": 260, "dislikes": 123, "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": 18247, "totalSubmissionRaw": 35718}, "759": {"acRate": 71.94332782815535, "difficulty": "Hard", "likes": 1820, "dislikes": 123, "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": 138524, "totalSubmissionRaw": 192546}, "760": {"acRate": 83.45100132591739, "difficulty": "Easy", "likes": 594, "dislikes": 226, "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": 96925, "totalSubmissionRaw": 116146}, "761": {"acRate": 60.743454698114654, "difficulty": "Hard", "likes": 676, "dislikes": 204, "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": 15916, "totalSubmissionRaw": 26202}, "762": {"acRate": 68.67762898016406, "difficulty": "Easy", "likes": 671, "dislikes": 502, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 88669, "totalSubmissionRaw": 129109}, "763": {"acRate": 79.77244914619932, "difficulty": "Medium", "likes": 9930, "dislikes": 365, "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": 493460, "totalSubmissionRaw": 618585}, "764": {"acRate": 48.211739750321655, "difficulty": "Medium", "likes": 1407, "dislikes": 220, "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": 55457, "totalSubmissionRaw": 115028}, "765": {"acRate": 56.74561057706886, "difficulty": "Hard", "likes": 2230, "dislikes": 110, "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": 56139, "totalSubmissionRaw": 98931}, "766": {"acRate": 68.47561504166657, "difficulty": "Easy", "likes": 3405, "dislikes": 158, "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": 292275, "totalSubmissionRaw": 426834}, "767": {"acRate": 54.331115561010265, "difficulty": "Medium", "likes": 8039, "dislikes": 236, "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": 344851, "totalSubmissionRaw": 634721}, "768": {"acRate": 52.86411649521499, "difficulty": "Hard", "likes": 1765, "dislikes": 50, "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": 57502, "totalSubmissionRaw": 108775}, "769": {"acRate": 58.2139264827229, "difficulty": "Medium", "likes": 2698, "dislikes": 226, "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": 96652, "totalSubmissionRaw": 166029}, "770": {"acRate": 54.97590019846895, "difficulty": "Hard", "likes": 154, "dislikes": 1375, "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": 9695, "totalSubmissionRaw": 17635}, "771": {"acRate": 88.32327815910892, "difficulty": "Easy", "likes": 4847, "dislikes": 564, "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": 939726, "totalSubmissionRaw": 1063962}, "772": {"acRate": 49.47563314744432, "difficulty": "Hard", "likes": 1080, "dislikes": 276, "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": 111428, "totalSubmissionRaw": 225220}, "773": {"acRate": 64.42049298478165, "difficulty": "Hard", "likes": 1950, "dislikes": 49, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 88937, "totalSubmissionRaw": 138057}, "774": {"acRate": 51.93160681070253, "difficulty": "Hard", "likes": 657, "dislikes": 92, "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": 29036, "totalSubmissionRaw": 55912}, "775": {"acRate": 42.68859974381447, "difficulty": "Medium", "likes": 1738, "dislikes": 363, "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": 69652, "totalSubmissionRaw": 163163}, "776": {"acRate": 83.06778806526732, "difficulty": "Medium", "likes": 987, "dislikes": 100, "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": 103804, "totalSubmissionRaw": 124963}, "777": {"acRate": 36.78550271140613, "difficulty": "Medium", "likes": 1169, "dislikes": 909, "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": 72651, "totalSubmissionRaw": 197499}, "778": {"acRate": 60.22062124168337, "difficulty": "Hard", "likes": 3387, "dislikes": 217, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 135496, "totalSubmissionRaw": 225000}, "779": {"acRate": 41.929149824936125, "difficulty": "Medium", "likes": 2762, "dislikes": 306, "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": 124063, "totalSubmissionRaw": 295882}, "780": {"acRate": 32.81961218036003, "difficulty": "Hard", "likes": 1376, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59052, "totalSubmissionRaw": 179927}, "781": {"acRate": 54.01794700653678, "difficulty": "Medium", "likes": 1203, "dislikes": 574, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 50985, "totalSubmissionRaw": 94387}, "782": {"acRate": 51.35939359769467, "difficulty": "Hard", "likes": 344, "dislikes": 304, "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": 16397, "totalSubmissionRaw": 31926}, "783": {"acRate": 59.455917190235866, "difficulty": "Easy", "likes": 3358, "dislikes": 405, "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": 230903, "totalSubmissionRaw": 388360}, "784": {"acRate": 73.98831314939578, "difficulty": "Medium", "likes": 4503, "dislikes": 153, "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": 284760, "totalSubmissionRaw": 384873}, "785": {"acRate": 55.04760745564291, "difficulty": "Medium", "likes": 7788, "dislikes": 349, "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": 497489, "totalSubmissionRaw": 903744}, "786": {"acRate": 52.93853196011117, "difficulty": "Medium", "likes": 1217, "dislikes": 50, "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": "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": 38859, "totalSubmissionRaw": 73404}, "787": {"acRate": 37.31280316820877, "difficulty": "Medium", "likes": 8789, "dislikes": 360, "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": 415688, "totalSubmissionRaw": 1114061}, "788": {"acRate": 56.476434035489156, "difficulty": "Medium", "likes": 718, "dislikes": 1889, "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": 100702, "totalSubmissionRaw": 178308}, "789": {"acRate": 61.32710537161699, "difficulty": "Medium", "likes": 264, "dislikes": 25, "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": 26784, "totalSubmissionRaw": 43674}, "790": {"acRate": 51.6214523426691, "difficulty": "Medium", "likes": 3176, "dislikes": 990, "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": 110441, "totalSubmissionRaw": 213941}, "791": {"acRate": 69.02084709835776, "difficulty": "Medium", "likes": 2714, "dislikes": 330, "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": 230857, "totalSubmissionRaw": 334477}, "792": {"acRate": 51.28014694512518, "difficulty": "Medium", "likes": 5322, "dislikes": 225, "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": 218876, "totalSubmissionRaw": 426825}, "793": {"acRate": 43.65050367973276, "difficulty": "Hard", "likes": 418, "dislikes": 91, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 16726, "totalSubmissionRaw": 38318}, "794": {"acRate": 34.92428610825583, "difficulty": "Medium", "likes": 525, "dislikes": 1125, "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": 55721, "totalSubmissionRaw": 159548}, "795": {"acRate": 52.859870054321554, "difficulty": "Medium", "likes": 2194, "dislikes": 113, "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": 64516, "totalSubmissionRaw": 122051}, "796": {"acRate": 56.555722792416674, "difficulty": "Easy", "likes": 3271, "dislikes": 125, "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": 249123, "totalSubmissionRaw": 440490}, "797": {"acRate": 82.41800906259346, "difficulty": "Medium", "likes": 6893, "dislikes": 139, "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": 471267, "totalSubmissionRaw": 571801}, "798": {"acRate": 50.53596333931062, "difficulty": "Hard", "likes": 515, "dislikes": 35, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 12682, "totalSubmissionRaw": 25095}, "799": {"acRate": 57.86803665469537, "difficulty": "Medium", "likes": 3522, "dislikes": 190, "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": 143727, "totalSubmissionRaw": 248369}, "800": {"acRate": 67.07625587278642, "difficulty": "Easy", "likes": 105, "dislikes": 675, "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": 16704, "totalSubmissionRaw": 24903}, "801": {"acRate": 39.5625782722011, "difficulty": "Hard", "likes": 2701, "dislikes": 134, "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": 70130, "totalSubmissionRaw": 177264}, "802": {"acRate": 61.70479103437688, "difficulty": "Medium", "likes": 5300, "dislikes": 430, "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": 209003, "totalSubmissionRaw": 338715}, "803": {"acRate": 34.510014306151646, "difficulty": "Hard", "likes": 1057, "dislikes": 187, "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": 28947, "totalSubmissionRaw": 83880}, "804": {"acRate": 82.66471134916907, "difficulty": "Easy", "likes": 2422, "dislikes": 1507, "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": 330887, "totalSubmissionRaw": 400276}, "805": {"acRate": 25.350587470897178, "difficulty": "Hard", "likes": 1207, "dislikes": 132, "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": 32774, "totalSubmissionRaw": 129283}, "806": {"acRate": 67.31492322776556, "difficulty": "Easy", "likes": 553, "dislikes": 1285, "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": 70715, "totalSubmissionRaw": 105051}, "807": {"acRate": 85.99366724558689, "difficulty": "Medium", "likes": 2443, "dislikes": 501, "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": 153988, "totalSubmissionRaw": 179069}, "808": {"acRate": 54.87109735035928, "difficulty": "Medium", "likes": 919, "dislikes": 2478, "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": 61318, "totalSubmissionRaw": 111750}, "809": {"acRate": 46.147663907600275, "difficulty": "Medium", "likes": 827, "dislikes": 1863, "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": 111394, "totalSubmissionRaw": 241386}, "810": {"acRate": 57.535258976411896, "difficulty": "Hard", "likes": 205, "dislikes": 275, "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": 9342, "totalSubmissionRaw": 16237}, "811": {"acRate": 75.78928636230408, "difficulty": "Medium", "likes": 1475, "dislikes": 1285, "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": 217202, "totalSubmissionRaw": 286586}, "812": {"acRate": 60.10341289196285, "difficulty": "Easy", "likes": 506, "dislikes": 1561, "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": 45101, "totalSubmissionRaw": 75039}, "813": {"acRate": 53.137191854233656, "difficulty": "Medium", "likes": 2005, "dislikes": 94, "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": 49577, "totalSubmissionRaw": 93300}, "814": {"acRate": 72.29313277989012, "difficulty": "Medium", "likes": 4380, "dislikes": 109, "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": 233294, "totalSubmissionRaw": 322706}, "815": {"acRate": 45.52434761536444, "difficulty": "Hard", "likes": 3291, "dislikes": 80, "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": 137137, "totalSubmissionRaw": 301240}, "816": {"acRate": 56.37582565360123, "difficulty": "Medium", "likes": 302, "dislikes": 648, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28507, "totalSubmissionRaw": 50566}, "817": {"acRate": 57.19845396954667, "difficulty": "Medium", "likes": 986, "dislikes": 2146, "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": 85685, "totalSubmissionRaw": 149803}, "818": {"acRate": 43.47194372661083, "difficulty": "Hard", "likes": 1815, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81081, "totalSubmissionRaw": 186516}, "819": {"acRate": 44.47025246515917, "difficulty": "Easy", "likes": 1618, "dislikes": 2982, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "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": 335624, "totalSubmissionRaw": 754717}, "820": {"acRate": 60.51097205055361, "difficulty": "Medium", "likes": 1709, "dislikes": 638, "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": 93506, "totalSubmissionRaw": 154527}, "821": {"acRate": 71.28325839277866, "difficulty": "Easy", "likes": 3008, "dislikes": 153, "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": 168679, "totalSubmissionRaw": 236632}, "822": {"acRate": 46.57318683789024, "difficulty": "Medium", "likes": 155, "dislikes": 723, "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": 16574, "totalSubmissionRaw": 35587}, "823": {"acRate": 49.58753189465035, "difficulty": "Medium", "likes": 2560, "dislikes": 184, "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": 91729, "totalSubmissionRaw": 184984}, "824": {"acRate": 67.91777523078133, "difficulty": "Easy", "likes": 857, "dislikes": 1213, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 164143, "totalSubmissionRaw": 241679}, "825": {"acRate": 46.37379058334537, "difficulty": "Medium", "likes": 665, "dislikes": 1153, "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": 73860, "totalSubmissionRaw": 159271}, "826": {"acRate": 45.41406009447495, "difficulty": "Medium", "likes": 1485, "dislikes": 129, "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": 60469, "totalSubmissionRaw": 133153}, "827": {"acRate": 45.774858936391674, "difficulty": "Hard", "likes": 3572, "dislikes": 62, "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": 142049, "totalSubmissionRaw": 310321}, "828": {"acRate": 51.918664144624636, "difficulty": "Hard", "likes": 2054, "dislikes": 241, "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": 66973, "totalSubmissionRaw": 128996}, "829": {"acRate": 41.669754856919496, "difficulty": "Hard", "likes": 1328, "dislikes": 1366, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 82084, "totalSubmissionRaw": 196987}, "830": {"acRate": 51.98196871040924, "difficulty": "Easy", "likes": 829, "dislikes": 122, "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": 88216, "totalSubmissionRaw": 169702}, "831": {"acRate": 48.035347529996756, "difficulty": "Medium", "likes": 156, "dislikes": 434, "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": 17774, "totalSubmissionRaw": 37003}, "832": {"acRate": 81.27713931497598, "difficulty": "Easy", "likes": 3268, "dislikes": 232, "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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 388764, "totalSubmissionRaw": 478319}, "833": {"acRate": 53.606870668416576, "difficulty": "Medium", "likes": 1123, "dislikes": 958, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 139692, "totalSubmissionRaw": 260586}, "834": {"acRate": 59.27130685684732, "difficulty": "Hard", "likes": 4823, "dislikes": 108, "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": 87098, "totalSubmissionRaw": 146948}, "835": {"acRate": 63.73747986271626, "difficulty": "Medium", "likes": 1289, "dislikes": 466, "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": 90998, "totalSubmissionRaw": 142770}, "836": {"acRate": 44.2623936104498, "difficulty": "Easy", "likes": 1903, "dislikes": 449, "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": 132561, "totalSubmissionRaw": 299489}, "837": {"acRate": 45.19656888910957, "difficulty": "Medium", "likes": 1924, "dislikes": 1776, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 72817, "totalSubmissionRaw": 161109}, "838": {"acRate": 57.06207043220199, "difficulty": "Medium", "likes": 3299, "dislikes": 209, "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": 118057, "totalSubmissionRaw": 206893}, "839": {"acRate": 54.54934796208075, "difficulty": "Hard", "likes": 2258, "dislikes": 214, "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": 113359, "totalSubmissionRaw": 207810}, "840": {"acRate": 38.776369974828064, "difficulty": "Medium", "likes": 316, "dislikes": 1573, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36817, "totalSubmissionRaw": 94947}, "841": {"acRate": 72.22829971841665, "difficulty": "Medium", "likes": 5739, "dislikes": 253, "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": 365780, "totalSubmissionRaw": 506422}, "842": {"acRate": 38.72647638207804, "difficulty": "Medium", "likes": 1094, "dislikes": 295, "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": 36959, "totalSubmissionRaw": 95436}, "843": {"acRate": 40.19587107993467, "difficulty": "Hard", "likes": 1465, "dislikes": 1735, "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": 136838, "totalSubmissionRaw": 340428}, "844": {"acRate": 48.09326249602038, "difficulty": "Easy", "likes": 6711, "dislikes": 309, "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": 676752, "totalSubmissionRaw": 1407166}, "845": {"acRate": 40.21854095177203, "difficulty": "Medium", "likes": 2656, "dislikes": 73, "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": 118259, "totalSubmissionRaw": 294041}, "846": {"acRate": 55.992348312529636, "difficulty": "Medium", "likes": 2363, "dislikes": 160, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 139324, "totalSubmissionRaw": 248827}, "847": {"acRate": 65.96831208907619, "difficulty": "Hard", "likes": 4113, "dislikes": 159, "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": 114583, "totalSubmissionRaw": 173694}, "848": {"acRate": 44.881173632804774, "difficulty": "Medium", "likes": 1306, "dislikes": 120, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90800, "totalSubmissionRaw": 202312}, "849": {"acRate": 47.80383476481877, "difficulty": "Medium", "likes": 3111, "dislikes": 193, "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": 210998, "totalSubmissionRaw": 441383}, "850": {"acRate": 54.050272591306026, "difficulty": "Hard", "likes": 925, "dislikes": 60, "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": 33609, "totalSubmissionRaw": 62181}, "851": {"acRate": 58.84738785640777, "difficulty": "Medium", "likes": 1173, "dislikes": 751, "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": 38884, "totalSubmissionRaw": 66076}, "852": {"acRate": 68.81275152445639, "difficulty": "Medium", "likes": 6917, "dislikes": 1890, "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": 713535, "totalSubmissionRaw": 1036924}, "853": {"acRate": 50.33527760009541, "difficulty": "Medium", "likes": 3066, "dislikes": 743, "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": 185711, "totalSubmissionRaw": 368948}, "854": {"acRate": 39.85925925925926, "difficulty": "Hard", "likes": 1089, "dislikes": 58, "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": 43048, "totalSubmissionRaw": 108000}, "855": {"acRate": 43.30444803299444, "difficulty": "Medium", "likes": 1253, "dislikes": 455, "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": 57119, "totalSubmissionRaw": 131901}, "856": {"acRate": 64.318244128309, "difficulty": "Medium", "likes": 5256, "dislikes": 179, "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": 168909, "totalSubmissionRaw": 262615}, "857": {"acRate": 52.688554283150935, "difficulty": "Hard", "likes": 2138, "dislikes": 273, "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": 62251, "totalSubmissionRaw": 118149}, "858": {"acRate": 62.74762048217295, "difficulty": "Medium", "likes": 1084, "dislikes": 2528, "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": 77066, "totalSubmissionRaw": 122819}, "859": {"acRate": 32.867631942200944, "difficulty": "Easy", "likes": 3045, "dislikes": 1736, "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": 223822, "totalSubmissionRaw": 680980}, "860": {"acRate": 53.02397009210714, "difficulty": "Easy", "likes": 2148, "dislikes": 147, "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": 152612, "totalSubmissionRaw": 287817}, "861": {"acRate": 74.94081557800673, "difficulty": "Medium", "likes": 1502, "dislikes": 175, "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": 44951, "totalSubmissionRaw": 59982}, "862": {"acRate": 25.92458712694576, "difficulty": "Hard", "likes": 4057, "dislikes": 110, "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": 91800, "totalSubmissionRaw": 354104}, "863": {"acRate": 64.07136137170721, "difficulty": "Medium", "likes": 10364, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-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": 386822, "totalSubmissionRaw": 603731}, "864": {"acRate": 54.102953011824425, "difficulty": "Hard", "likes": 2223, "dislikes": 96, "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": 69914, "totalSubmissionRaw": 129224}, "865": {"acRate": 69.55331444504407, "difficulty": "Medium", "likes": 2516, "dislikes": 360, "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": 123727, "totalSubmissionRaw": 177888}, "866": {"acRate": 25.818542796994542, "difficulty": "Medium", "likes": 408, "dislikes": 802, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30170, "totalSubmissionRaw": 116854}, "867": {"acRate": 65.87977705065124, "difficulty": "Easy", "likes": 3077, "dislikes": 427, "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": 270198, "totalSubmissionRaw": 410138}, "868": {"acRate": 62.671723556679304, "difficulty": "Easy", "likes": 593, "dislikes": 647, "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": 74360, "totalSubmissionRaw": 118650}, "869": {"acRate": 63.03280196903825, "difficulty": "Medium", "likes": 2079, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"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": 109609, "totalSubmissionRaw": 173892}, "870": {"acRate": 52.15591923206412, "difficulty": "Medium", "likes": 1556, "dislikes": 93, "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": 63516, "totalSubmissionRaw": 121781}, "871": {"acRate": 39.82026909951341, "difficulty": "Hard", "likes": 4497, "dislikes": 80, "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": 128236, "totalSubmissionRaw": 322037}, "872": {"acRate": 67.83729722802006, "difficulty": "Easy", "likes": 3318, "dislikes": 71, "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": 296410, "totalSubmissionRaw": 436943}, "873": {"acRate": 48.13067002969774, "difficulty": "Medium", "likes": 1942, "dislikes": 66, "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": 59155, "totalSubmissionRaw": 122905}, "874": {"acRate": 39.41554766682101, "difficulty": "Medium", "likes": 182, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38306, "totalSubmissionRaw": 97185}, "875": {"acRate": 49.70845757915329, "difficulty": "Medium", "likes": 9295, "dislikes": 458, "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": 471090, "totalSubmissionRaw": 947705}, "876": {"acRate": 76.67206729911223, "difficulty": "Easy", "likes": 10604, "dislikes": 314, "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": 1533735, "totalSubmissionRaw": 2000383}, "877": {"acRate": 70.22891365829312, "difficulty": "Medium", "likes": 3040, "dislikes": 2780, "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": 211073, "totalSubmissionRaw": 300550}, "878": {"acRate": 35.28990188557354, "difficulty": "Hard", "likes": 1227, "dislikes": 153, "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": 34961, "totalSubmissionRaw": 99068}, "879": {"acRate": 48.739262501224815, "difficulty": "Hard", "likes": 1766, "dislikes": 117, "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": 59690, "totalSubmissionRaw": 122468}, "880": {"acRate": 36.55174618141429, "difficulty": "Medium", "likes": 2409, "dislikes": 339, "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": 91485, "totalSubmissionRaw": 250289}, "881": {"acRate": 56.18327560779641, "difficulty": "Medium", "likes": 5648, "dislikes": 134, "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": 267814, "totalSubmissionRaw": 476680}, "882": {"acRate": 50.004929313642364, "difficulty": "Hard", "likes": 756, "dislikes": 216, "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": 25361, "totalSubmissionRaw": 50717}, "883": {"acRate": 71.82707673329783, "difficulty": "Easy", "likes": 542, "dislikes": 1376, "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": 51240, "totalSubmissionRaw": 71338}, "884": {"acRate": 66.66002150932509, "difficulty": "Easy", "likes": 1280, "dislikes": 164, "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": 127064, "totalSubmissionRaw": 190615}, "885": {"acRate": 74.07051386490274, "difficulty": "Medium", "likes": 867, "dislikes": 835, "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": 45463, "totalSubmissionRaw": 61378}, "886": {"acRate": 50.30449913000249, "difficulty": "Medium", "likes": 4502, "dislikes": 104, "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": 194280, "totalSubmissionRaw": 386208}, "887": {"acRate": 27.36444041368867, "difficulty": "Hard", "likes": 3488, "dislikes": 173, "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": 65777, "totalSubmissionRaw": 240374}, "888": {"acRate": 61.10823580479824, "difficulty": "Easy", "likes": 1981, "dislikes": 347, "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": 109806, "totalSubmissionRaw": 179691}, "889": {"acRate": 71.25490255007739, "difficulty": "Medium", "likes": 2646, "dislikes": 104, "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": 94836, "totalSubmissionRaw": 133094}, "890": {"acRate": 77.15151965909936, "difficulty": "Medium", "likes": 3809, "dislikes": 167, "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": 176346, "totalSubmissionRaw": 228571}, "891": {"acRate": 37.21075199758212, "difficulty": "Hard", "likes": 694, "dislikes": 166, "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": 19699, "totalSubmissionRaw": 52939}, "892": {"acRate": 64.85579555288675, "difficulty": "Easy", "likes": 526, "dislikes": 718, "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": 36722, "totalSubmissionRaw": 56621}, "893": {"acRate": 71.34534304331162, "difficulty": "Medium", "likes": 506, "dislikes": 1468, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46535, "totalSubmissionRaw": 65225}, "894": {"acRate": 82.76453861445935, "difficulty": "Medium", "likes": 4830, "dislikes": 324, "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": 164449, "totalSubmissionRaw": 198695}, "895": {"acRate": 66.4893001735107, "difficulty": "Hard", "likes": 4515, "dislikes": 66, "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": 160944, "totalSubmissionRaw": 242060}, "896": {"acRate": 61.05799801959525, "difficulty": "Easy", "likes": 2879, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 386004, "totalSubmissionRaw": 632193}, "897": {"acRate": 78.30119686780944, "difficulty": "Easy", "likes": 4160, "dislikes": 659, "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": 263388, "totalSubmissionRaw": 336378}, "898": {"acRate": 38.09370582759691, "difficulty": "Medium", "likes": 1368, "dislikes": 197, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 33148, "totalSubmissionRaw": 87017}, "899": {"acRate": 65.98776197936681, "difficulty": "Hard", "likes": 1707, "dislikes": 604, "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": 66969, "totalSubmissionRaw": 101487}, "900": {"acRate": 59.39885496183206, "difficulty": "Medium", "likes": 691, "dislikes": 174, "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": 65985, "totalSubmissionRaw": 111088}, "901": {"acRate": 65.5437347789699, "difficulty": "Medium", "likes": 5860, "dislikes": 349, "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": 260790, "totalSubmissionRaw": 397887}, "902": {"acRate": 42.12987733586985, "difficulty": "Hard", "likes": 1346, "dislikes": 95, "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": 42520, "totalSubmissionRaw": 100926}, "903": {"acRate": 57.539070227497525, "difficulty": "Hard", "likes": 692, "dislikes": 41, "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": 14543, "totalSubmissionRaw": 25275}, "904": {"acRate": 43.78409385831508, "difficulty": "Medium", "likes": 4310, "dislikes": 302, "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": 361027, "totalSubmissionRaw": 824559}, "905": {"acRate": 76.23751642880815, "difficulty": "Easy", "likes": 5186, "dislikes": 142, "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": 738416, "totalSubmissionRaw": 968573}, "906": {"acRate": 38.85506496972528, "difficulty": "Hard", "likes": 349, "dislikes": 414, "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": 23294, "totalSubmissionRaw": 59951}, "907": {"acRate": 35.22198806304165, "difficulty": "Medium", "likes": 6701, "dislikes": 436, "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": 159277, "totalSubmissionRaw": 452209}, "908": {"acRate": 69.13784915598153, "difficulty": "Easy", "likes": 640, "dislikes": 1959, "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": 80072, "totalSubmissionRaw": 115815}, "909": {"acRate": 44.32101783369243, "difficulty": "Medium", "likes": 2643, "dislikes": 813, "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": 155924, "totalSubmissionRaw": 351806}, "910": {"acRate": 35.81855104048001, "difficulty": "Medium", "likes": 1589, "dislikes": 438, "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": 50622, "totalSubmissionRaw": 141329}, "911": {"acRate": 51.94976736850406, "difficulty": "Medium", "likes": 942, "dislikes": 636, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 52702, "totalSubmissionRaw": 101447}, "912": {"acRate": 57.88431797784745, "difficulty": "Medium", "likes": 5578, "dislikes": 722, "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": 517261, "totalSubmissionRaw": 893614}, "913": {"acRate": 34.25164319248826, "difficulty": "Hard", "likes": 869, "dislikes": 147, "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": 18239, "totalSubmissionRaw": 53250}, "914": {"acRate": 30.316328743358994, "difficulty": "Easy", "likes": 1740, "dislikes": 463, "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": 111843, "totalSubmissionRaw": 368917}, "915": {"acRate": 48.685440487318694, "difficulty": "Medium", "likes": 1602, "dislikes": 74, "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": 78645, "totalSubmissionRaw": 161537}, "916": {"acRate": 52.90014351717199, "difficulty": "Medium", "likes": 2653, "dislikes": 224, "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": 110948, "totalSubmissionRaw": 209731}, "917": {"acRate": 63.17810816987111, "difficulty": "Easy", "likes": 2103, "dislikes": 66, "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": 185230, "totalSubmissionRaw": 293187}, "918": {"acRate": 43.842337196642234, "difficulty": "Medium", "likes": 6233, "dislikes": 269, "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": 229119, "totalSubmissionRaw": 522601}, "919": {"acRate": 64.73158129657934, "difficulty": "Medium", "likes": 1036, "dislikes": 109, "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": 47858, "totalSubmissionRaw": 73933}, "920": {"acRate": 60.952275311278115, "difficulty": "Hard", "likes": 2243, "dislikes": 191, "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": 65940, "totalSubmissionRaw": 108183}, "921": {"acRate": 75.0823167947747, "difficulty": "Medium", "likes": 3781, "dislikes": 180, "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": 279562, "totalSubmissionRaw": 372341}, "922": {"acRate": 70.59315587048829, "difficulty": "Easy", "likes": 2493, "dislikes": 88, "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": 232920, "totalSubmissionRaw": 329947}, "923": {"acRate": 45.27539022209998, "difficulty": "Medium", "likes": 2548, "dislikes": 303, "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": 98766, "totalSubmissionRaw": 218145}, "924": {"acRate": 41.995342678416506, "difficulty": "Hard", "likes": 927, "dislikes": 540, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45986, "totalSubmissionRaw": 109504}, "925": {"acRate": 32.59545856559184, "difficulty": "Easy", "likes": 2329, "dislikes": 334, "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": 127886, "totalSubmissionRaw": 392343}, "926": {"acRate": 61.42498146302838, "difficulty": "Medium", "likes": 4307, "dislikes": 176, "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": 183079, "totalSubmissionRaw": 298053}, "927": {"acRate": 39.626859492727625, "difficulty": "Hard", "likes": 811, "dislikes": 119, "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": 28716, "totalSubmissionRaw": 72466}, "928": {"acRate": 42.826706089527576, "difficulty": "Hard", "likes": 632, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19699, "totalSubmissionRaw": 45997}, "929": {"acRate": 67.01457548562584, "difficulty": "Easy", "likes": 2557, "dislikes": 313, "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": 449385, "totalSubmissionRaw": 670578}, "930": {"acRate": 54.950040160642565, "difficulty": "Medium", "likes": 2614, "dislikes": 73, "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": 85515, "totalSubmissionRaw": 155624}, "931": {"acRate": 65.51571817713318, "difficulty": "Medium", "likes": 5372, "dislikes": 132, "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": 284767, "totalSubmissionRaw": 434655}, "932": {"acRate": 65.44464098429941, "difficulty": "Medium", "likes": 1007, "dislikes": 1464, "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": 41808, "totalSubmissionRaw": 63883}, "933": {"acRate": 73.75937136989505, "difficulty": "Easy", "likes": 321, "dislikes": 464, "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": 186044, "totalSubmissionRaw": 252231}, "934": {"acRate": 57.74600619618347, "difficulty": "Medium", "likes": 5104, "dislikes": 189, "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": 185833, "totalSubmissionRaw": 321811}, "935": {"acRate": 51.37676943959667, "difficulty": "Medium", "likes": 2127, "dislikes": 394, "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": 105978, "totalSubmissionRaw": 206278}, "936": {"acRate": 62.575669986147616, "difficulty": "Hard", "likes": 1520, "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": 57370, "totalSubmissionRaw": 91681}, "937": {"acRate": 56.349061818603765, "difficulty": "Medium", "likes": 2034, "dislikes": 4356, "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": 349651, "totalSubmissionRaw": 620509}, "938": {"acRate": 85.91484488753245, "difficulty": "Easy", "likes": 6126, "dislikes": 357, "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": 829026, "totalSubmissionRaw": 964940}, "939": {"acRate": 53.14956164487143, "difficulty": "Medium", "likes": 1840, "dislikes": 268, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 126522, "totalSubmissionRaw": 238049}, "940": {"acRate": 43.23754629574496, "difficulty": "Hard", "likes": 1627, "dislikes": 35, "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": 36307, "totalSubmissionRaw": 83971}, "941": {"acRate": 33.34739048093481, "difficulty": "Easy", "likes": 2805, "dislikes": 176, "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": 388262, "totalSubmissionRaw": 1164295}, "942": {"acRate": 77.95603708719658, "difficulty": "Easy", "likes": 2348, "dislikes": 946, "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": 142177, "totalSubmissionRaw": 182381}, "943": {"acRate": 43.807239775306215, "difficulty": "Hard", "likes": 1376, "dislikes": 144, "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": 27217, "totalSubmissionRaw": 62129}, "944": {"acRate": 74.62840894403516, "difficulty": "Easy", "likes": 1653, "dislikes": 2842, "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": 178994, "totalSubmissionRaw": 239847}, "945": {"acRate": 51.94845393386185, "difficulty": "Medium", "likes": 1722, "dislikes": 53, "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": 82237, "totalSubmissionRaw": 158305}, "946": {"acRate": 69.405232128264, "difficulty": "Medium", "likes": 5744, "dislikes": 117, "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": 285360, "totalSubmissionRaw": 411151}, "947": {"acRate": 58.87699168700544, "difficulty": "Medium", "likes": 5086, "dislikes": 631, "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": 191299, "totalSubmissionRaw": 324913}, "948": {"acRate": 52.185975365912185, "difficulty": "Medium", "likes": 2305, "dislikes": 426, "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": 104397, "totalSubmissionRaw": 200048}, "949": {"acRate": 35.12602460327958, "difficulty": "Medium", "likes": 675, "dislikes": 1029, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82321, "totalSubmissionRaw": 234354}, "950": {"acRate": 77.94257484179118, "difficulty": "Medium", "likes": 2419, "dislikes": 337, "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": 71312, "totalSubmissionRaw": 91493}, "951": {"acRate": 66.91371740708797, "difficulty": "Medium", "likes": 2194, "dislikes": 91, "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": 137321, "totalSubmissionRaw": 205221}, "952": {"acRate": 40.32871384187267, "difficulty": "Hard", "likes": 1558, "dislikes": 88, "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": 51013, "totalSubmissionRaw": 126493}, "953": {"acRate": 54.6422701949061, "difficulty": "Easy", "likes": 4750, "dislikes": 1565, "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": 475782, "totalSubmissionRaw": 870721}, "954": {"acRate": 39.0629060400193, "difficulty": "Medium", "likes": 1471, "dislikes": 145, "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": 84179, "totalSubmissionRaw": 215496}, "955": {"acRate": 34.92268041237113, "difficulty": "Medium", "likes": 624, "dislikes": 85, "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": 18970, "totalSubmissionRaw": 54320}, "956": {"acRate": 52.572016460905346, "difficulty": "Hard", "likes": 2237, "dislikes": 55, "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": 55699, "totalSubmissionRaw": 105948}, "957": {"acRate": 38.995808763221454, "difficulty": "Medium", "likes": 1442, "dislikes": 1713, "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": 155472, "totalSubmissionRaw": 398689}, "958": {"acRate": 56.339341955370905, "difficulty": "Medium", "likes": 4090, "dislikes": 53, "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": 210184, "totalSubmissionRaw": 373071}, "959": {"acRate": 69.32508372594653, "difficulty": "Medium", "likes": 2984, "dislikes": 559, "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": 48852, "totalSubmissionRaw": 70468}, "960": {"acRate": 57.51873223667212, "difficulty": "Hard", "likes": 567, "dislikes": 13, "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": 13357, "totalSubmissionRaw": 23222}, "961": {"acRate": 76.28241924542087, "difficulty": "Easy", "likes": 1290, "dislikes": 325, "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": 219270, "totalSubmissionRaw": 287445}, "962": {"acRate": 49.326545153653434, "difficulty": "Medium", "likes": 1585, "dislikes": 42, "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": 42921, "totalSubmissionRaw": 87014}, "963": {"acRate": 54.63591516633638, "difficulty": "Medium", "likes": 355, "dislikes": 441, "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": 25916, "totalSubmissionRaw": 47434}, "964": {"acRate": 48.072550640760646, "difficulty": "Hard", "likes": 307, "dislikes": 67, "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": 9303, "totalSubmissionRaw": 19352}, "965": {"acRate": 70.25776739783105, "difficulty": "Easy", "likes": 1809, "dislikes": 63, "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": 203359, "totalSubmissionRaw": 289447}, "966": {"acRate": 51.25592878955234, "difficulty": "Medium", "likes": 403, "dislikes": 798, "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": 39444, "totalSubmissionRaw": 76955}, "967": {"acRate": 57.657653516231946, "difficulty": "Medium", "likes": 2729, "dislikes": 190, "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": 125425, "totalSubmissionRaw": 217534}, "968": {"acRate": 46.48278415401703, "difficulty": "Hard", "likes": 5111, "dislikes": 66, "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": 128061, "totalSubmissionRaw": 275502}, "969": {"acRate": 70.35040862347466, "difficulty": "Medium", "likes": 1413, "dislikes": 1478, "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": 87976, "totalSubmissionRaw": 125054}, "970": {"acRate": 43.66327474560592, "difficulty": "Medium", "likes": 361, "dislikes": 76, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52392, "totalSubmissionRaw": 119991}, "971": {"acRate": 50.25472843570454, "difficulty": "Medium", "likes": 912, "dislikes": 265, "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": 40148, "totalSubmissionRaw": 79889}, "972": {"acRate": 43.479113551676804, "difficulty": "Hard", "likes": 90, "dislikes": 208, "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": 6651, "totalSubmissionRaw": 15297}, "973": {"acRate": 65.8941021175085, "difficulty": "Medium", "likes": 7976, "dislikes": 279, "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": 1056283, "totalSubmissionRaw": 1602998}, "974": {"acRate": 53.964318053406956, "difficulty": "Medium", "likes": 6347, "dislikes": 263, "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": 218715, "totalSubmissionRaw": 405297}, "975": {"acRate": 39.28172588832488, "difficulty": "Hard", "likes": 1885, "dislikes": 468, "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": 77385, "totalSubmissionRaw": 196999}, "976": {"acRate": 55.04814298428514, "difficulty": "Easy", "likes": 2883, "dislikes": 396, "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": 218338, "totalSubmissionRaw": 396631}, "977": {"acRate": 71.7773416347015, "difficulty": "Easy", "likes": 8400, "dislikes": 206, "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": 1524306, "totalSubmissionRaw": 2123660}, "978": {"acRate": 47.23189786684577, "difficulty": "Medium", "likes": 1849, "dislikes": 210, "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": 90714, "totalSubmissionRaw": 192061}, "979": {"acRate": 72.4032937960526, "difficulty": "Medium", "likes": 4791, "dislikes": 161, "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": 107007, "totalSubmissionRaw": 147793}, "980": {"acRate": 81.74249443422283, "difficulty": "Hard", "likes": 4922, "dislikes": 182, "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": 186153, "totalSubmissionRaw": 227731}, "981": {"acRate": 50.40017537401403, "difficulty": "Medium", "likes": 4459, "dislikes": 454, "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": 365555, "totalSubmissionRaw": 725306}, "982": {"acRate": 57.852066145219474, "difficulty": "Hard", "likes": 411, "dislikes": 211, "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": 16198, "totalSubmissionRaw": 27999}, "983": {"acRate": 65.54687983369011, "difficulty": "Medium", "likes": 7542, "dislikes": 135, "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": 264852, "totalSubmissionRaw": 404065}, "984": {"acRate": 43.57030893470109, "difficulty": "Medium", "likes": 760, "dislikes": 362, "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": 43918, "totalSubmissionRaw": 100798}, "985": {"acRate": 68.01852066912734, "difficulty": "Medium", "likes": 2036, "dislikes": 314, "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": 134710, "totalSubmissionRaw": 198049}, "986": {"acRate": 71.28161480951321, "difficulty": "Medium", "likes": 5318, "dislikes": 104, "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": 368501, "totalSubmissionRaw": 516965}, "987": {"acRate": 46.28650304750501, "difficulty": "Hard", "likes": 6977, "dislikes": 4251, "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": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 369532, "totalSubmissionRaw": 798357}, "988": {"acRate": 50.761898655724394, "difficulty": "Medium", "likes": 1625, "dislikes": 223, "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": "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": 71252, "totalSubmissionRaw": 140368}, "989": {"acRate": 46.0884412470024, "difficulty": "Easy", "likes": 3296, "dislikes": 266, "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": 240236, "totalSubmissionRaw": 521248}, "990": {"acRate": 50.461024784897916, "difficulty": "Medium", "likes": 3572, "dislikes": 56, "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": 117882, "totalSubmissionRaw": 233610}, "991": {"acRate": 54.23957764632382, "difficulty": "Medium", "likes": 2608, "dislikes": 205, "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": 96368, "totalSubmissionRaw": 177671}, "992": {"acRate": 55.86914016428246, "difficulty": "Hard", "likes": 4809, "dislikes": 65, "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": 106581, "totalSubmissionRaw": 190769}, "993": {"acRate": 55.2668232525748, "difficulty": "Easy", "likes": 3790, "dislikes": 186, "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": 255534, "totalSubmissionRaw": 462363}, "994": {"acRate": 53.55014797060155, "difficulty": "Medium", "likes": 11800, "dislikes": 369, "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": 700629, "totalSubmissionRaw": 1308361}, "995": {"acRate": 51.40622531205562, "difficulty": "Hard", "likes": 1152, "dislikes": 56, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 32535, "totalSubmissionRaw": 63290}, "996": {"acRate": 49.186752313041424, "difficulty": "Hard", "likes": 947, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "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": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33386, "totalSubmissionRaw": 67876}, "997": {"acRate": 49.258497757029794, "difficulty": "Easy", "likes": 5868, "dislikes": 467, "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": 432195, "totalSubmissionRaw": 877402}, "998": {"acRate": 68.14179180713045, "difficulty": "Medium", "likes": 502, "dislikes": 761, "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": 33352, "totalSubmissionRaw": 48945}, "999": {"acRate": 68.48001423978462, "difficulty": "Easy", "likes": 625, "dislikes": 625, "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": 61556, "totalSubmissionRaw": 89889}, "1000": {"acRate": 42.823416663744844, "difficulty": "Hard", "likes": 2333, "dislikes": 103, "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": 36641, "totalSubmissionRaw": 85563}, "1001": {"acRate": 36.3073039187561, "difficulty": "Hard", "likes": 576, "dislikes": 142, "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": 18984, "totalSubmissionRaw": 52287}, "1002": {"acRate": 68.64134298741126, "difficulty": "Easy", "likes": 3348, "dislikes": 269, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 194058, "totalSubmissionRaw": 282713}, "1003": {"acRate": 58.83376662441183, "difficulty": "Medium", "likes": 916, "dislikes": 466, "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": 54766, "totalSubmissionRaw": 93086}, "1004": {"acRate": 62.779173852344584, "difficulty": "Medium", "likes": 7650, "dislikes": 93, "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": 382227, "totalSubmissionRaw": 608842}, "1005": {"acRate": 50.81330015137132, "difficulty": "Easy", "likes": 1448, "dislikes": 104, "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": 79221, "totalSubmissionRaw": 155907}, "1006": {"acRate": 56.32122213047068, "difficulty": "Medium", "likes": 336, "dislikes": 336, "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": 27282, "totalSubmissionRaw": 48440}, "1007": {"acRate": 52.243168977778254, "difficulty": "Medium", "likes": 2778, "dislikes": 250, "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": 196589, "totalSubmissionRaw": 376297}, "1008": {"acRate": 81.67192405272945, "difficulty": "Medium", "likes": 5795, "dislikes": 73, "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": 325451, "totalSubmissionRaw": 398486}, "1009": {"acRate": 60.85020942055922, "difficulty": "Easy", "likes": 2245, "dislikes": 108, "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": 207899, "totalSubmissionRaw": 341657}, "1010": {"acRate": 52.66888557612498, "difficulty": "Medium", "likes": 4080, "dislikes": 159, "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": 255083, "totalSubmissionRaw": 484317}, "1011": {"acRate": 68.4802873400721, "difficulty": "Medium", "likes": 8745, "dislikes": 184, "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": 310012, "totalSubmissionRaw": 452703}, "1012": {"acRate": 41.34947118375658, "difficulty": "Hard", "likes": 711, "dislikes": 78, "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": 14622, "totalSubmissionRaw": 35362}, "1013": {"acRate": 42.184165837380746, "difficulty": "Easy", "likes": 1630, "dislikes": 148, "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": 85204, "totalSubmissionRaw": 201981}, "1014": {"acRate": 59.375693319259646, "difficulty": "Medium", "likes": 2429, "dislikes": 57, "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": 88316, "totalSubmissionRaw": 148741}, "1015": {"acRate": 46.80556090422459, "difficulty": "Medium", "likes": 1111, "dislikes": 845, "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": 60770, "totalSubmissionRaw": 129835}, "1016": {"acRate": 57.35128702541448, "difficulty": "Medium", "likes": 333, "dislikes": 518, "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": 35181, "totalSubmissionRaw": 61343}, "1017": {"acRate": 60.48780487804878, "difficulty": "Medium", "likes": 489, "dislikes": 277, "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": 24428, "totalSubmissionRaw": 40385}, "1018": {"acRate": 46.74265892522585, "difficulty": "Easy", "likes": 699, "dislikes": 179, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50397, "totalSubmissionRaw": 107818}, "1019": {"acRate": 60.129727400064645, "difficulty": "Medium", "likes": 3132, "dislikes": 112, "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": 139516, "totalSubmissionRaw": 232025}, "1020": {"acRate": 68.77300839346194, "difficulty": "Medium", "likes": 3757, "dislikes": 70, "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": 186815, "totalSubmissionRaw": 271640}, "1021": {"acRate": 81.61756955734349, "difficulty": "Easy", "likes": 2566, "dislikes": 1507, "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": 255533, "totalSubmissionRaw": 313086}, "1022": {"acRate": 73.35706917778592, "difficulty": "Easy", "likes": 3231, "dislikes": 182, "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": 198413, "totalSubmissionRaw": 270476}, "1023": {"acRate": 61.39707456296824, "difficulty": "Medium", "likes": 839, "dislikes": 299, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"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": 43024, "totalSubmissionRaw": 70075}, "1024": {"acRate": 50.84269662921348, "difficulty": "Medium", "likes": 1684, "dislikes": 60, "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": 62264, "totalSubmissionRaw": 122464}, "1025": {"acRate": 68.09980887405041, "difficulty": "Easy", "likes": 2023, "dislikes": 3987, "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": 225187, "totalSubmissionRaw": 330672}, "1026": {"acRate": 75.60358719260142, "difficulty": "Medium", "likes": 4151, "dislikes": 98, "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": 215816, "totalSubmissionRaw": 285458}, "1027": {"acRate": 49.022975182410505, "difficulty": "Medium", "likes": 4469, "dislikes": 198, "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": 160713, "totalSubmissionRaw": 327832}, "1028": {"acRate": 73.61102148802993, "difficulty": "Hard", "likes": 1534, "dislikes": 39, "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": 45627, "totalSubmissionRaw": 61985}, "1029": {"acRate": 66.12468720789137, "difficulty": "Medium", "likes": 4545, "dislikes": 341, "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": 227785, "totalSubmissionRaw": 344478}, "1030": {"acRate": 70.15686223119161, "difficulty": "Easy", "likes": 702, "dislikes": 304, "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": 53536, "totalSubmissionRaw": 76309}, "1031": {"acRate": 59.69568390043513, "difficulty": "Medium", "likes": 2451, "dislikes": 80, "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": 66264, "totalSubmissionRaw": 111003}, "1032": {"acRate": 51.72773591237758, "difficulty": "Hard", "likes": 1766, "dislikes": 179, "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": 84774, "totalSubmissionRaw": 163885}, "1033": {"acRate": 47.069630347445134, "difficulty": "Medium", "likes": 204, "dislikes": 640, "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": 23315, "totalSubmissionRaw": 49533}, "1034": {"acRate": 49.09090909090909, "difficulty": "Medium", "likes": 668, "dislikes": 849, "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": 31752, "totalSubmissionRaw": 64680}, "1035": {"acRate": 62.46140688475519, "difficulty": "Medium", "likes": 3676, "dislikes": 52, "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": 146066, "totalSubmissionRaw": 233850}, "1036": {"acRate": 34.38449169197785, "difficulty": "Hard", "likes": 631, "dislikes": 164, "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": 19245, "totalSubmissionRaw": 55970}, "1037": {"acRate": 36.83261472374938, "difficulty": "Easy", "likes": 381, "dislikes": 506, "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": 45959, "totalSubmissionRaw": 124778}, "1038": {"acRate": 85.64564122514642, "difficulty": "Medium", "likes": 3607, "dislikes": 151, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 162908, "totalSubmissionRaw": 190212}, "1039": {"acRate": 57.84916277418122, "difficulty": "Medium", "likes": 1718, "dislikes": 159, "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": 42356, "totalSubmissionRaw": 73218}, "1040": {"acRate": 56.588256636633005, "difficulty": "Medium", "likes": 355, "dislikes": 584, "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": 9358, "totalSubmissionRaw": 16537}, "1041": {"acRate": 55.45981020605403, "difficulty": "Medium", "likes": 3600, "dislikes": 675, "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": 218632, "totalSubmissionRaw": 394217}, "1042": {"acRate": 50.89750809517105, "difficulty": "Medium", "likes": 1352, "dislikes": 705, "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": 72305, "totalSubmissionRaw": 142060}, "1043": {"acRate": 72.18598160695372, "difficulty": "Medium", "likes": 3647, "dislikes": 245, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 85871, "totalSubmissionRaw": 118958}, "1044": {"acRate": 30.428403895185145, "difficulty": "Hard", "likes": 2136, "dislikes": 374, "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": 64088, "totalSubmissionRaw": 210619}, "1045": {"acRate": 61.84512613410047, "difficulty": "Medium", "likes": 538, "dislikes": 55, "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": 89429, "totalSubmissionRaw": 144604}, "1046": {"acRate": 65.16388829068698, "difficulty": "Easy", "likes": 5673, "dislikes": 95, "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": 532560, "totalSubmissionRaw": 817262}, "1047": {"acRate": 69.06248600600063, "difficulty": "Easy", "likes": 6262, "dislikes": 235, "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": 493509, "totalSubmissionRaw": 714586}, "1048": {"acRate": 60.848121031375015, "difficulty": "Medium", "likes": 6991, "dislikes": 251, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380720, "totalSubmissionRaw": 625689}, "1049": {"acRate": 54.45382748607741, "difficulty": "Medium", "likes": 2944, "dislikes": 102, "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": 77637, "totalSubmissionRaw": 142573}, "1050": {"acRate": 69.6421387336471, "difficulty": "Easy", "likes": 588, "dislikes": 45, "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": 143678, "totalSubmissionRaw": 206309}, "1051": {"acRate": 76.06042939852043, "difficulty": "Easy", "likes": 1060, "dislikes": 73, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 302684, "totalSubmissionRaw": 397952}, "1052": {"acRate": 57.12246139289697, "difficulty": "Medium", "likes": 1612, "dislikes": 127, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 67617, "totalSubmissionRaw": 118372}, "1053": {"acRate": 50.072863123310896, "difficulty": "Medium", "likes": 416, "dislikes": 36, "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": 37797, "totalSubmissionRaw": 75484}, "1054": {"acRate": 46.11455886305997, "difficulty": "Medium", "likes": 1207, "dislikes": 47, "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": 39457, "totalSubmissionRaw": 85563}, "1055": {"acRate": 59.84833237492811, "difficulty": "Medium", "likes": 1231, "dislikes": 66, "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": 83260, "totalSubmissionRaw": 139119}, "1056": {"acRate": 48.48326979090199, "difficulty": "Easy", "likes": 293, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 40948, "totalSubmissionRaw": 84458}, "1057": {"acRate": 57.67935154481815, "difficulty": "Medium", "likes": 925, "dislikes": 178, "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": 65751, "totalSubmissionRaw": 113994}, "1058": {"acRate": 45.017270711965764, "difficulty": "Medium", "likes": 144, "dislikes": 142, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8732, "totalSubmissionRaw": 19397}, "1059": {"acRate": 38.37007972967312, "difficulty": "Medium", "likes": 674, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 54959, "totalSubmissionRaw": 143234}, "1060": {"acRate": 55.52235487054049, "difficulty": "Medium", "likes": 1575, "dislikes": 57, "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": 119850, "totalSubmissionRaw": 215859}, "1061": {"acRate": 76.53856878763155, "difficulty": "Medium", "likes": 2240, "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": 74110, "totalSubmissionRaw": 96827}, "1062": {"acRate": 59.731283399922454, "difficulty": "Medium", "likes": 628, "dislikes": 49, "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": 35432, "totalSubmissionRaw": 59319}, "1063": {"acRate": 77.89663895916155, "difficulty": "Hard", "likes": 281, "dislikes": 13, "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": 10777, "totalSubmissionRaw": 13835}, "1064": {"acRate": 64.13529036375239, "difficulty": "Easy", "likes": 425, "dislikes": 64, "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": 42210, "totalSubmissionRaw": 65814}, "1065": {"acRate": 66.96709657763786, "difficulty": "Easy", "likes": 364, "dislikes": 105, "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": 26377, "totalSubmissionRaw": 39388}, "1066": {"acRate": 54.90139594060951, "difficulty": "Medium", "likes": 866, "dislikes": 81, "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": 45740, "totalSubmissionRaw": 83313}, "1067": {"acRate": 46.01726863675058, "difficulty": "Hard", "likes": 88, "dislikes": 24, "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": 3784, "totalSubmissionRaw": 8223}, "1068": {"acRate": 80.37835054567375, "difficulty": "Easy", "likes": 536, "dislikes": 183, "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": 192001, "totalSubmissionRaw": 238873}, "1069": {"acRate": 81.8333088631136, "difficulty": "Easy", "likes": 75, "dislikes": 176, "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": 50163, "totalSubmissionRaw": 61299}, "1070": {"acRate": 43.42935528120713, "difficulty": "Medium", "likes": 241, "dislikes": 665, "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": 72816, "totalSubmissionRaw": 167666}, "1071": {"acRate": 52.184537998085545, "difficulty": "Easy", "likes": 4393, "dislikes": 942, "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": 278034, "totalSubmissionRaw": 532790}, "1072": {"acRate": 63.76364996260284, "difficulty": "Medium", "likes": 714, "dislikes": 49, "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": 21313, "totalSubmissionRaw": 33425}, "1073": {"acRate": 36.54424374707677, "difficulty": "Medium", "likes": 300, "dislikes": 122, "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": 16408, "totalSubmissionRaw": 44899}, "1074": {"acRate": 69.59837394589647, "difficulty": "Hard", "likes": 3027, "dislikes": 64, "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": 89713, "totalSubmissionRaw": 128901}, "1075": {"acRate": 64.83093047519681, "difficulty": "Easy", "likes": 395, "dislikes": 102, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109361, "totalSubmissionRaw": 168687}, "1076": {"acRate": 49.886192264820764, "difficulty": "Easy", "likes": 197, "dislikes": 59, "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": 53258, "totalSubmissionRaw": 106759}, "1077": {"acRate": 76.65620353543697, "difficulty": "Medium", "likes": 254, "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": 51039, "totalSubmissionRaw": 66582}, "1078": {"acRate": 63.37058423587769, "difficulty": "Easy", "likes": 461, "dislikes": 349, "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": 66176, "totalSubmissionRaw": 104427}, "1079": {"acRate": 76.11220177686087, "difficulty": "Medium", "likes": 2386, "dislikes": 65, "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": 91496, "totalSubmissionRaw": 120212}, "1080": {"acRate": 54.3911724849971, "difficulty": "Medium", "likes": 632, "dislikes": 677, "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": 33716, "totalSubmissionRaw": 61988}, "1081": {"acRate": 60.3571079150768, "difficulty": "Medium", "likes": 2498, "dislikes": 178, "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": 61691, "totalSubmissionRaw": 102210}, "1082": {"acRate": 74.32382817280626, "difficulty": "Easy", "likes": 189, "dislikes": 72, "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": 54657, "totalSubmissionRaw": 73539}, "1083": {"acRate": 49.710834787534374, "difficulty": "Easy", "likes": 255, "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": 54410, "totalSubmissionRaw": 109453}, "1084": {"acRate": 47.274504305367685, "difficulty": "Easy", "likes": 647, "dislikes": 137, "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": 114634, "totalSubmissionRaw": 242485}, "1085": {"acRate": 76.37722677730581, "difficulty": "Easy", "likes": 112, "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": 23195, "totalSubmissionRaw": 30369}, "1086": {"acRate": 74.81913869655665, "difficulty": "Easy", "likes": 772, "dislikes": 124, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96387, "totalSubmissionRaw": 128826}, "1087": {"acRate": 66.25476552294116, "difficulty": "Medium", "likes": 623, "dislikes": 50, "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": 49703, "totalSubmissionRaw": 75018}, "1088": {"acRate": 47.16036865161383, "difficulty": "Hard", "likes": 482, "dislikes": 140, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 36280, "totalSubmissionRaw": 76929}, "1089": {"acRate": 51.59796195652174, "difficulty": "Easy", "likes": 2469, "dislikes": 704, "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": 379760, "totalSubmissionRaw": 735999}, "1090": {"acRate": 61.52664023889772, "difficulty": "Medium", "likes": 413, "dislikes": 618, "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": 35232, "totalSubmissionRaw": 57263}, "1091": {"acRate": 46.67159553326394, "difficulty": "Medium", "likes": 6088, "dislikes": 211, "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": 394540, "totalSubmissionRaw": 845348}, "1092": {"acRate": 58.851151783093854, "difficulty": "Hard", "likes": 4483, "dislikes": 63, "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": 94246, "totalSubmissionRaw": 160143}, "1093": {"acRate": 42.681245313142554, "difficulty": "Medium", "likes": 124, "dislikes": 98, "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": 17644, "totalSubmissionRaw": 41339}, "1094": {"acRate": 56.34520440099019, "difficulty": "Medium", "likes": 4262, "dislikes": 87, "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": 203258, "totalSubmissionRaw": 360737}, "1095": {"acRate": 40.7267081771186, "difficulty": "Hard", "likes": 2994, "dislikes": 124, "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": 123293, "totalSubmissionRaw": 302733}, "1096": {"acRate": 63.73742864908942, "difficulty": "Hard", "likes": 463, "dislikes": 278, "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": 23449, "totalSubmissionRaw": 36790}, "1097": {"acRate": 51.7922116235618, "difficulty": "Hard", "likes": 172, "dislikes": 31, "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": 21067, "totalSubmissionRaw": 40676}, "1098": {"acRate": 43.457150938059776, "difficulty": "Medium", "likes": 195, "dislikes": 578, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36876, "totalSubmissionRaw": 84856}, "1099": {"acRate": 61.15421528514421, "difficulty": "Easy", "likes": 1067, "dislikes": 125, "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": 121067, "totalSubmissionRaw": 197970}, "1100": {"acRate": 74.70537227543258, "difficulty": "Medium", "likes": 537, "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": 37907, "totalSubmissionRaw": 50742}, "1101": {"acRate": 64.38615538281148, "difficulty": "Medium", "likes": 902, "dislikes": 27, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74131, "totalSubmissionRaw": 115135}, "1102": {"acRate": 53.492006466678646, "difficulty": "Medium", "likes": 1268, "dislikes": 122, "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": "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": 59558, "totalSubmissionRaw": 111340}, "1103": {"acRate": 64.65635916574493, "difficulty": "Easy", "likes": 924, "dislikes": 185, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81253, "totalSubmissionRaw": 125669}, "1104": {"acRate": 75.13453596266963, "difficulty": "Medium", "likes": 1432, "dislikes": 304, "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": 42025, "totalSubmissionRaw": 55933}, "1105": {"acRate": 59.504201379343314, "difficulty": "Medium", "likes": 1758, "dislikes": 119, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49783, "totalSubmissionRaw": 83663}, "1106": {"acRate": 58.66956975346442, "difficulty": "Hard", "likes": 1071, "dislikes": 54, "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": 25868, "totalSubmissionRaw": 44091}, "1107": {"acRate": 44.76899292681926, "difficulty": "Medium", "likes": 141, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32723, "totalSubmissionRaw": 73092}, "1108": {"acRate": 88.87884450516023, "difficulty": "Easy", "likes": 1912, "dislikes": 1723, "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": 571225, "totalSubmissionRaw": 642701}, "1109": {"acRate": 60.92717377219127, "difficulty": "Medium", "likes": 1528, "dislikes": 156, "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": 56421, "totalSubmissionRaw": 92604}, "1110": {"acRate": 69.18691404600355, "difficulty": "Medium", "likes": 3658, "dislikes": 103, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 196596, "totalSubmissionRaw": 284152}, "1111": {"acRate": 72.64803666097583, "difficulty": "Medium", "likes": 391, "dislikes": 1585, "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": 24255, "totalSubmissionRaw": 33387}, "1112": {"acRate": 71.09387367421243, "difficulty": "Medium", "likes": 279, "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": 53892, "totalSubmissionRaw": 75804}, "1113": {"acRate": 64.92790437056406, "difficulty": "Easy", "likes": 102, "dislikes": 384, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43453, "totalSubmissionRaw": 66925}, "1114": {"acRate": 68.97338217338216, "difficulty": "Easy", "likes": 1380, "dislikes": 194, "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": 141223, "totalSubmissionRaw": 204750}, "1115": {"acRate": 64.21557413110428, "difficulty": "Medium", "likes": 646, "dislikes": 50, "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": 72980, "totalSubmissionRaw": 113649}, "1116": {"acRate": 60.617107688895665, "difficulty": "Medium", "likes": 454, "dislikes": 308, "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": 43731, "totalSubmissionRaw": 72143}, "1117": {"acRate": 55.96040980230642, "difficulty": "Medium", "likes": 480, "dislikes": 126, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43479, "totalSubmissionRaw": 77696}, "1118": {"acRate": 57.77454545454545, "difficulty": "Easy", "likes": 39, "dislikes": 167, "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": 7944, "totalSubmissionRaw": 13750}, "1119": {"acRate": 90.79351323443997, "difficulty": "Easy", "likes": 341, "dislikes": 111, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 98480, "totalSubmissionRaw": 108466}, "1120": {"acRate": 65.64184790211671, "difficulty": "Medium", "likes": 777, "dislikes": 33, "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": 60999, "totalSubmissionRaw": 92927}, "1121": {"acRate": 61.111849980050536, "difficulty": "Hard", "likes": 119, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4595, "totalSubmissionRaw": 7519}, "1122": {"acRate": 68.66663960709502, "difficulty": "Easy", "likes": 2425, "dislikes": 138, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 169174, "totalSubmissionRaw": 246370}, "1123": {"acRate": 71.25313778441317, "difficulty": "Medium", "likes": 1835, "dislikes": 803, "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": 97361, "totalSubmissionRaw": 136641}, "1124": {"acRate": 34.69910984916556, "difficulty": "Medium", "likes": 1339, "dislikes": 107, "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": 28963, "totalSubmissionRaw": 83469}, "1125": {"acRate": 56.358269994984376, "difficulty": "Hard", "likes": 2073, "dislikes": 52, "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": 58430, "totalSubmissionRaw": 103676}, "1126": {"acRate": 66.0196326789107, "difficulty": "Medium", "likes": 260, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41698, "totalSubmissionRaw": 63160}, "1127": {"acRate": 48.26195440407424, "difficulty": "Hard", "likes": 175, "dislikes": 129, "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": 14120, "totalSubmissionRaw": 29257}, "1128": {"acRate": 47.68271625689531, "difficulty": "Easy", "likes": 640, "dislikes": 322, "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": 62410, "totalSubmissionRaw": 130886}, "1129": {"acRate": 47.5856525489169, "difficulty": "Medium", "likes": 3333, "dislikes": 173, "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": 105377, "totalSubmissionRaw": 221447}, "1130": {"acRate": 67.96017909031607, "difficulty": "Medium", "likes": 4112, "dislikes": 262, "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": 91681, "totalSubmissionRaw": 134904}, "1131": {"acRate": 48.541461063551445, "difficulty": "Medium", "likes": 608, "dislikes": 397, "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": 21150, "totalSubmissionRaw": 43570}, "1132": {"acRate": 32.66549866244678, "difficulty": "Medium", "likes": 144, "dislikes": 547, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34679, "totalSubmissionRaw": 106164}, "1133": {"acRate": 68.18066659160004, "difficulty": "Easy", "likes": 297, "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": 48442, "totalSubmissionRaw": 71049}, "1134": {"acRate": 77.83723216939929, "difficulty": "Easy", "likes": 197, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34039, "totalSubmissionRaw": 43731}, "1135": {"acRate": 61.66369451616052, "difficulty": "Medium", "likes": 1080, "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": 69503, "totalSubmissionRaw": 112713}, "1136": {"acRate": 61.38674884437596, "difficulty": "Medium", "likes": 1066, "dislikes": 23, "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": 69720, "totalSubmissionRaw": 113575}, "1137": {"acRate": 63.51586613013585, "difficulty": "Easy", "likes": 3887, "dislikes": 170, "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": 554186, "totalSubmissionRaw": 872513}, "1138": {"acRate": 51.874820495909965, "difficulty": "Medium", "likes": 859, "dislikes": 171, "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": 48767, "totalSubmissionRaw": 94009}, "1139": {"acRate": 50.193315576939604, "difficulty": "Medium", "likes": 685, "dislikes": 105, "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": 23368, "totalSubmissionRaw": 46556}, "1140": {"acRate": 68.31367696531456, "difficulty": "Medium", "likes": 2709, "dislikes": 593, "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": 88333, "totalSubmissionRaw": 129305}, "1141": {"acRate": 47.89083536715607, "difficulty": "Easy", "likes": 501, "dislikes": 668, "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": 136768, "totalSubmissionRaw": 285585}, "1142": {"acRate": 35.59021174083936, "difficulty": "Easy", "likes": 98, "dislikes": 360, "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": 39298, "totalSubmissionRaw": 110418}, "1143": {"acRate": 57.63363490591581, "difficulty": "Medium", "likes": 12289, "dislikes": 155, "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": 821645, "totalSubmissionRaw": 1425630}, "1144": {"acRate": 47.55402700066732, "difficulty": "Medium", "likes": 406, "dislikes": 165, "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": 18528, "totalSubmissionRaw": 38962}, "1145": {"acRate": 51.82399307891954, "difficulty": "Medium", "likes": 1306, "dislikes": 205, "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": 43130, "totalSubmissionRaw": 83224}, "1146": {"acRate": 37.31040932732508, "difficulty": "Medium", "likes": 3565, "dislikes": 466, "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": 201862, "totalSubmissionRaw": 541034}, "1147": {"acRate": 58.78242171751109, "difficulty": "Hard", "likes": 623, "dislikes": 29, "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": 21870, "totalSubmissionRaw": 37205}, "1148": {"acRate": 74.15832192527702, "difficulty": "Easy", "likes": 990, "dislikes": 49, "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": 282231, "totalSubmissionRaw": 380580}, "1149": {"acRate": 46.89050452852489, "difficulty": "Medium", "likes": 125, "dislikes": 28, "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": 34118, "totalSubmissionRaw": 72761}, "1150": {"acRate": 58.64747867762632, "difficulty": "Easy", "likes": 440, "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": 45521, "totalSubmissionRaw": 77618}, "1151": {"acRate": 60.66192689257538, "difficulty": "Medium", "likes": 1152, "dislikes": 14, "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": 59128, "totalSubmissionRaw": 97472}, "1152": {"acRate": 42.98525626475943, "difficulty": "Medium", "likes": 470, "dislikes": 3555, "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": 89009, "totalSubmissionRaw": 207070}, "1153": {"acRate": 35.12013392428338, "difficulty": "Hard", "likes": 861, "dislikes": 331, "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": 51189, "totalSubmissionRaw": 145754}, "1154": {"acRate": 48.841183381394856, "difficulty": "Easy", "likes": 400, "dislikes": 450, "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": 50303, "totalSubmissionRaw": 102993}, "1155": {"acRate": 54.59203672839767, "difficulty": "Medium", "likes": 4062, "dislikes": 126, "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": 193585, "totalSubmissionRaw": 354603}, "1156": {"acRate": 44.370860927152314, "difficulty": "Medium", "likes": 964, "dislikes": 86, "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": 28743, "totalSubmissionRaw": 64778}, "1157": {"acRate": 41.565703634669156, "difficulty": "Hard", "likes": 603, "dislikes": 58, "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": 15610, "totalSubmissionRaw": 37555}, "1158": {"acRate": 57.55521192656913, "difficulty": "Medium", "likes": 588, "dislikes": 63, "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": 87096, "totalSubmissionRaw": 151326}, "1159": {"acRate": 57.131513647642684, "difficulty": "Hard", "likes": 116, "dislikes": 47, "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": 17268, "totalSubmissionRaw": 30225}, "1160": {"acRate": 67.1281853248348, "difficulty": "Easy", "likes": 1409, "dislikes": 151, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 154710, "totalSubmissionRaw": 230470}, "1161": {"acRate": 67.37994955443791, "difficulty": "Medium", "likes": 3289, "dislikes": 96, "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": 222524, "totalSubmissionRaw": 330254}, "1162": {"acRate": 51.693039706043265, "difficulty": "Medium", "likes": 4046, "dislikes": 106, "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": 146450, "totalSubmissionRaw": 283307}, "1163": {"acRate": 34.62035626083758, "difficulty": "Hard", "likes": 567, "dislikes": 442, "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": 32943, "totalSubmissionRaw": 95155}, "1164": {"acRate": 57.544785709973176, "difficulty": "Medium", "likes": 639, "dislikes": 162, "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": 66718, "totalSubmissionRaw": 115941}, "1165": {"acRate": 86.7336625703457, "difficulty": "Easy", "likes": 497, "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": 75519, "totalSubmissionRaw": 87070}, "1166": {"acRate": 62.13334720199709, "difficulty": "Medium", "likes": 527, "dislikes": 57, "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": 47788, "totalSubmissionRaw": 76912}, "1167": {"acRate": 68.9867385390301, "difficulty": "Medium", "likes": 1251, "dislikes": 152, "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": 109295, "totalSubmissionRaw": 158429}, "1168": {"acRate": 64.66140297600973, "difficulty": "Hard", "likes": 1076, "dislikes": 39, "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": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42586, "totalSubmissionRaw": 65860}, "1169": {"acRate": 31.09861288377116, "difficulty": "Medium", "likes": 489, "dislikes": 2191, "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": 66516, "totalSubmissionRaw": 213892}, "1170": {"acRate": 61.78379169580561, "difficulty": "Medium", "likes": 665, "dislikes": 964, "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": 75978, "totalSubmissionRaw": 122974}, "1171": {"acRate": 43.32830332674229, "difficulty": "Medium", "likes": 2096, "dislikes": 89, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49961, "totalSubmissionRaw": 115308}, "1172": {"acRate": 32.76060908149104, "difficulty": "Hard", "likes": 456, "dislikes": 60, "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": 16760, "totalSubmissionRaw": 51158}, "1173": {"acRate": 81.10563228570746, "difficulty": "Easy", "likes": 275, "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": 67767, "totalSubmissionRaw": 83554}, "1174": {"acRate": 51.81521807938216, "difficulty": "Medium", "likes": 437, "dislikes": 81, "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": 65482, "totalSubmissionRaw": 126376}, "1175": {"acRate": 55.66191733338708, "difficulty": "Easy", "likes": 371, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27620, "totalSubmissionRaw": 49621}, "1176": {"acRate": 52.99789040570462, "difficulty": "Easy", "likes": 150, "dislikes": 283, "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": 30398, "totalSubmissionRaw": 57357}, "1177": {"acRate": 38.569720090225104, "difficulty": "Medium", "likes": 754, "dislikes": 269, "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": 25478, "totalSubmissionRaw": 66057}, "1178": {"acRate": 46.61032805288761, "difficulty": "Hard", "likes": 1234, "dislikes": 82, "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": 29894, "totalSubmissionRaw": 64136}, "1179": {"acRate": 78.71769924385778, "difficulty": "Easy", "likes": 681, "dislikes": 565, "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": 102751, "totalSubmissionRaw": 130527}, "1180": {"acRate": 79.33759879563418, "difficulty": "Easy", "likes": 341, "dislikes": 49, "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": 25295, "totalSubmissionRaw": 31883}, "1181": {"acRate": 45.388631090487245, "difficulty": "Medium", "likes": 72, "dislikes": 150, "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": 9390, "totalSubmissionRaw": 20688}, "1182": {"acRate": 55.34980079681275, "difficulty": "Medium", "likes": 502, "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": 34732, "totalSubmissionRaw": 62750}, "1183": {"acRate": 68.01341667937186, "difficulty": "Hard", "likes": 157, "dislikes": 25, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 4461, "totalSubmissionRaw": 6559}, "1184": {"acRate": 53.79235297027254, "difficulty": "Easy", "likes": 714, "dislikes": 79, "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": 54375, "totalSubmissionRaw": 101084}, "1185": {"acRate": 57.25027479742809, "difficulty": "Easy", "likes": 359, "dislikes": 2350, "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": 58855, "totalSubmissionRaw": 102803}, "1186": {"acRate": 42.43105501309836, "difficulty": "Medium", "likes": 1698, "dislikes": 58, "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": 44542, "totalSubmissionRaw": 104975}, "1187": {"acRate": 58.80082983091658, "difficulty": "Hard", "likes": 2142, "dislikes": 47, "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": 54703, "totalSubmissionRaw": 93031}, "1188": {"acRate": 72.68101261784365, "difficulty": "Medium", "likes": 504, "dislikes": 40, "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": 45563, "totalSubmissionRaw": 62689}, "1189": {"acRate": 60.28097334155555, "difficulty": "Easy", "likes": 1583, "dislikes": 90, "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": 170090, "totalSubmissionRaw": 282160}, "1190": {"acRate": 66.01009491634493, "difficulty": "Medium", "likes": 1780, "dislikes": 50, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 65651, "totalSubmissionRaw": 99456}, "1191": {"acRate": 23.56935509751579, "difficulty": "Medium", "likes": 1365, "dislikes": 109, "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": 32315, "totalSubmissionRaw": 137104}, "1192": {"acRate": 55.29193143867036, "difficulty": "Hard", "likes": 5914, "dislikes": 174, "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": 212744, "totalSubmissionRaw": 384765}, "1193": {"acRate": 59.804165817347254, "difficulty": "Medium", "likes": 534, "dislikes": 44, "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": 79216, "totalSubmissionRaw": 132457}, "1194": {"acRate": 49.281510154302985, "difficulty": "Hard", "likes": 145, "dislikes": 54, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18588, "totalSubmissionRaw": 37718}, "1195": {"acRate": 72.84414146307702, "difficulty": "Medium", "likes": 555, "dislikes": 382, "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": 42101, "totalSubmissionRaw": 57796}, "1196": {"acRate": 66.76044096793376, "difficulty": "Easy", "likes": 205, "dislikes": 16, "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": 29189, "totalSubmissionRaw": 43722}, "1197": {"acRate": 39.90833957735926, "difficulty": "Medium", "likes": 1438, "dislikes": 394, "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": 141676, "totalSubmissionRaw": 355005}, "1198": {"acRate": 76.51410334458649, "difficulty": "Medium", "likes": 553, "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": 41476, "totalSubmissionRaw": 54207}, "1199": {"acRate": 46.04959630911188, "difficulty": "Hard", "likes": 227, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"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": 6388, "totalSubmissionRaw": 13872}, "1200": {"acRate": 69.4481330647928, "difficulty": "Easy", "likes": 2246, "dislikes": 72, "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": 172064, "totalSubmissionRaw": 247759}, "1201": {"acRate": 29.236433326608836, "difficulty": "Medium", "likes": 1154, "dislikes": 488, "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": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28985, "totalSubmissionRaw": 99140}, "1202": {"acRate": 57.94913166243308, "difficulty": "Medium", "likes": 3535, "dislikes": 130, "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": 106310, "totalSubmissionRaw": 183454}, "1203": {"acRate": 67.33822215213164, "difficulty": "Hard", "likes": 1662, "dislikes": 277, "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": 51239, "totalSubmissionRaw": 76092}, "1204": {"acRate": 66.99754822191846, "difficulty": "Medium", "likes": 501, "dislikes": 24, "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": 61757, "totalSubmissionRaw": 92178}, "1205": {"acRate": 42.13966357238807, "difficulty": "Medium", "likes": 144, "dislikes": 526, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21018, "totalSubmissionRaw": 49877}, "1206": {"acRate": 60.51846969839626, "difficulty": "Hard", "likes": 627, "dislikes": 72, "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": 19283, "totalSubmissionRaw": 31863}, "1207": {"acRate": 74.22425008247691, "difficulty": "Easy", "likes": 4243, "dislikes": 101, "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": 357726, "totalSubmissionRaw": 481953}, "1208": {"acRate": 49.80414540245322, "difficulty": "Medium", "likes": 1067, "dislikes": 61, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44500, "totalSubmissionRaw": 89349}, "1209": {"acRate": 56.72727927913499, "difficulty": "Medium", "likes": 5489, "dislikes": 107, "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": 283358, "totalSubmissionRaw": 499510}, "1210": {"acRate": 49.28237650200267, "difficulty": "Hard", "likes": 264, "dislikes": 68, "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": 8859, "totalSubmissionRaw": 17976}, "1211": {"acRate": 64.24909888792395, "difficulty": "Easy", "likes": 386, "dislikes": 291, "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": 83598, "totalSubmissionRaw": 130114}, "1212": {"acRate": 56.19582611014802, "difficulty": "Medium", "likes": 288, "dislikes": 24, "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": 33713, "totalSubmissionRaw": 59992}, "1213": {"acRate": 79.85125620178452, "difficulty": "Easy", "likes": 566, "dislikes": 24, "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": 80633, "totalSubmissionRaw": 100979}, "1214": {"acRate": 67.01369781519104, "difficulty": "Medium", "likes": 529, "dislikes": 45, "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": 45056, "totalSubmissionRaw": 67235}, "1215": {"acRate": 46.551542592397595, "difficulty": "Medium", "likes": 177, "dislikes": 20, "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": 8842, "totalSubmissionRaw": 18994}, "1216": {"acRate": 50.18019285505568, "difficulty": "Hard", "likes": 667, "dislikes": 8, "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": 46367, "totalSubmissionRaw": 92400}, "1217": {"acRate": 71.7712596634834, "difficulty": "Easy", "likes": 2191, "dislikes": 287, "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": 119947, "totalSubmissionRaw": 167124}, "1218": {"acRate": 55.03739421787439, "difficulty": "Medium", "likes": 3060, "dislikes": 84, "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": 130918, "totalSubmissionRaw": 237871}, "1219": {"acRate": 63.65311569348924, "difficulty": "Medium", "likes": 2609, "dislikes": 64, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 107082, "totalSubmissionRaw": 168227}, "1220": {"acRate": 59.76821646299639, "difficulty": "Hard", "likes": 2594, "dislikes": 176, "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": 108921, "totalSubmissionRaw": 182239}, "1221": {"acRate": 85.57512933741994, "difficulty": "Easy", "likes": 2609, "dislikes": 905, "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": 271108, "totalSubmissionRaw": 316807}, "1222": {"acRate": 71.76139642238893, "difficulty": "Medium", "likes": 897, "dislikes": 144, "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": 39796, "totalSubmissionRaw": 55456}, "1223": {"acRate": 48.77952896608413, "difficulty": "Hard", "likes": 892, "dislikes": 187, "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": 27298, "totalSubmissionRaw": 55962}, "1224": {"acRate": 36.96148132427844, "difficulty": "Hard", "likes": 519, "dislikes": 56, "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": 13933, "totalSubmissionRaw": 37696}, "1225": {"acRate": 59.54843630816171, "difficulty": "Hard", "likes": 303, "dislikes": 22, "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": 19517, "totalSubmissionRaw": 32775}, "1226": {"acRate": 54.909535642180465, "difficulty": "Medium", "likes": 318, "dislikes": 307, "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": 28285, "totalSubmissionRaw": 51512}, "1227": {"acRate": 65.84828283923184, "difficulty": "Medium", "likes": 571, "dislikes": 932, "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": 36449, "totalSubmissionRaw": 55353}, "1228": {"acRate": 51.70812535799034, "difficulty": "Easy", "likes": 303, "dislikes": 42, "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": 25277, "totalSubmissionRaw": 48884}, "1229": {"acRate": 55.14229484996572, "difficulty": "Medium", "likes": 862, "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": 74809, "totalSubmissionRaw": 135666}, "1230": {"acRate": 56.085856095717055, "difficulty": "Medium", "likes": 376, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "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": 17063, "totalSubmissionRaw": 30423}, "1231": {"acRate": 58.03451593362868, "difficulty": "Hard", "likes": 933, "dislikes": 53, "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": 48861, "totalSubmissionRaw": 84193}, "1232": {"acRate": 39.758286825708176, "difficulty": "Easy", "likes": 2502, "dislikes": 264, "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": 241004, "totalSubmissionRaw": 606173}, "1233": {"acRate": 65.72814261371084, "difficulty": "Medium", "likes": 768, "dislikes": 102, "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": 50144, "totalSubmissionRaw": 76290}, "1234": {"acRate": 37.68813224771774, "difficulty": "Medium", "likes": 1125, "dislikes": 198, "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": 30550, "totalSubmissionRaw": 81060}, "1235": {"acRate": 53.38638834992857, "difficulty": "Hard", "likes": 5466, "dislikes": 64, "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": 200310, "totalSubmissionRaw": 375205}, "1236": {"acRate": 67.61178589217978, "difficulty": "Medium", "likes": 275, "dislikes": 311, "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": 35292, "totalSubmissionRaw": 52198}, "1237": {"acRate": 69.38905673044647, "difficulty": "Medium", "likes": 484, "dislikes": 1390, "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": 62013, "totalSubmissionRaw": 89370}, "1238": {"acRate": 69.33966335779024, "difficulty": "Medium", "likes": 392, "dislikes": 182, "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": 16066, "totalSubmissionRaw": 23170}, "1239": {"acRate": 52.165926215985095, "difficulty": "Medium", "likes": 3569, "dislikes": 243, "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": 181178, "totalSubmissionRaw": 347311}, "1240": {"acRate": 54.11250181220703, "difficulty": "Hard", "likes": 651, "dislikes": 556, "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": 22395, "totalSubmissionRaw": 41386}, "1241": {"acRate": 65.4796969266083, "difficulty": "Easy", "likes": 165, "dislikes": 519, "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": 32235, "totalSubmissionRaw": 49229}, "1242": {"acRate": 48.666064813373595, "difficulty": "Medium", "likes": 501, "dislikes": 84, "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": 46898, "totalSubmissionRaw": 96368}, "1243": {"acRate": 51.61303716005813, "difficulty": "Easy", "likes": 143, "dislikes": 66, "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": 12431, "totalSubmissionRaw": 24085}, "1244": {"acRate": 68.13335659240865, "difficulty": "Medium", "likes": 736, "dislikes": 93, "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": 66398, "totalSubmissionRaw": 97453}, "1245": {"acRate": 61.148642183223934, "difficulty": "Medium", "likes": 756, "dislikes": 17, "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": 31952, "totalSubmissionRaw": 52252}, "1246": {"acRate": 46.60635520748942, "difficulty": "Hard", "likes": 306, "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": 10355, "totalSubmissionRaw": 22218}, "1247": {"acRate": 64.3264096015431, "difficulty": "Medium", "likes": 1285, "dislikes": 234, "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": 36017, "totalSubmissionRaw": 55986}, "1248": {"acRate": 63.44631177041279, "difficulty": "Medium", "likes": 3473, "dislikes": 72, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 101362, "totalSubmissionRaw": 159761}, "1249": {"acRate": 66.28822087472585, "difficulty": "Medium", "likes": 5914, "dislikes": 109, "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": 524069, "totalSubmissionRaw": 790595}, "1250": {"acRate": 58.984765602023415, "difficulty": "Hard", "likes": 463, "dislikes": 361, "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": 20056, "totalSubmissionRaw": 34002}, "1251": {"acRate": 60.69653628741606, "difficulty": "Easy", "likes": 756, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111987, "totalSubmissionRaw": 184491}, "1252": {"acRate": 78.46556966280119, "difficulty": "Easy", "likes": 1119, "dislikes": 1459, "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": 102713, "totalSubmissionRaw": 130902}, "1253": {"acRate": 45.10985116938341, "difficulty": "Medium", "likes": 424, "dislikes": 28, "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": 24187, "totalSubmissionRaw": 53618}, "1254": {"acRate": 66.57162945809439, "difficulty": "Medium", "likes": 4370, "dislikes": 150, "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": 206408, "totalSubmissionRaw": 310054}, "1255": {"acRate": 72.44089443222347, "difficulty": "Hard", "likes": 1160, "dislikes": 53, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 33919, "totalSubmissionRaw": 46823}, "1256": {"acRate": 69.54050213169114, "difficulty": "Medium", "likes": 74, "dislikes": 243, "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": 7340, "totalSubmissionRaw": 10555}, "1257": {"acRate": 64.6389605545367, "difficulty": "Medium", "likes": 416, "dislikes": 33, "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": 20795, "totalSubmissionRaw": 32171}, "1258": {"acRate": 56.4188447177685, "difficulty": "Medium", "likes": 332, "dislikes": 155, "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": 20550, "totalSubmissionRaw": 36424}, "1259": {"acRate": 60.68758462353564, "difficulty": "Hard", "likes": 217, "dislikes": 16, "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": 10308, "totalSubmissionRaw": 16985}, "1260": {"acRate": 67.44600191573466, "difficulty": "Easy", "likes": 1680, "dislikes": 334, "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": 99986, "totalSubmissionRaw": 148246}, "1261": {"acRate": 76.69368246051538, "difficulty": "Medium", "likes": 937, "dislikes": 92, "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": 59048, "totalSubmissionRaw": 76992}, "1262": {"acRate": 50.72285856321081, "difficulty": "Medium", "likes": 1708, "dislikes": 41, "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": 49995, "totalSubmissionRaw": 98566}, "1263": {"acRate": 49.09117614658686, "difficulty": "Hard", "likes": 820, "dislikes": 56, "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": 26738, "totalSubmissionRaw": 54466}, "1264": {"acRate": 65.7948151841037, "difficulty": "Medium", "likes": 234, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36953, "totalSubmissionRaw": 56164}, "1265": {"acRate": 94.20279508094312, "difficulty": "Medium", "likes": 555, "dislikes": 100, "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": 52778, "totalSubmissionRaw": 56026}, "1266": {"acRate": 79.04789858724367, "difficulty": "Easy", "likes": 1542, "dislikes": 182, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 142736, "totalSubmissionRaw": 180569}, "1267": {"acRate": 59.97666532183319, "difficulty": "Medium", "likes": 1237, "dislikes": 80, "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": 55004, "totalSubmissionRaw": 91708}, "1268": {"acRate": 65.78708029651779, "difficulty": "Medium", "likes": 4406, "dislikes": 212, "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": 264020, "totalSubmissionRaw": 401325}, "1269": {"acRate": 43.92206796800633, "difficulty": "Hard", "likes": 766, "dislikes": 41, "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": 35250, "totalSubmissionRaw": 80438}, "1270": {"acRate": 85.77970636663008, "difficulty": "Medium", "likes": 402, "dislikes": 26, "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": 50013, "totalSubmissionRaw": 58304}, "1271": {"acRate": 57.29035218538488, "difficulty": "Easy", "likes": 70, "dislikes": 123, "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": 9988, "totalSubmissionRaw": 17434}, "1272": {"acRate": 64.19380425681929, "difficulty": "Medium", "likes": 416, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 29135, "totalSubmissionRaw": 45386}, "1273": {"acRate": 61.21772832406076, "difficulty": "Medium", "likes": 218, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9793, "totalSubmissionRaw": 15997}, "1274": {"acRate": 68.85535686837116, "difficulty": "Hard", "likes": 513, "dislikes": 55, "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": 26877, "totalSubmissionRaw": 39034}, "1275": {"acRate": 54.09257997980881, "difficulty": "Easy", "likes": 1384, "dislikes": 318, "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": 111983, "totalSubmissionRaw": 207018}, "1276": {"acRate": 50.909962729670234, "difficulty": "Medium", "likes": 307, "dislikes": 224, "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": 23358, "totalSubmissionRaw": 45881}, "1277": {"acRate": 74.82632014686297, "difficulty": "Medium", "likes": 4662, "dislikes": 73, "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": 207874, "totalSubmissionRaw": 277809}, "1278": {"acRate": 60.718667421668556, "difficulty": "Hard", "likes": 1083, "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": 25735, "totalSubmissionRaw": 42384}, "1279": {"acRate": 73.30200768902179, "difficulty": "Easy", "likes": 69, "dislikes": 334, "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": 12012, "totalSubmissionRaw": 16387}, "1280": {"acRate": 57.19670727117008, "difficulty": "Easy", "likes": 1092, "dislikes": 131, "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": 104849, "totalSubmissionRaw": 183313}, "1281": {"acRate": 86.37547213858578, "difficulty": "Easy", "likes": 2411, "dislikes": 222, "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": 432893, "totalSubmissionRaw": 501176}, "1282": {"acRate": 87.77921063283037, "difficulty": "Medium", "likes": 2818, "dislikes": 664, "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": 186508, "totalSubmissionRaw": 212474}, "1283": {"acRate": 58.1354445240285, "difficulty": "Medium", "likes": 2613, "dislikes": 180, "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": 137170, "totalSubmissionRaw": 235949}, "1284": {"acRate": 71.99486401307342, "difficulty": "Hard", "likes": 924, "dislikes": 88, "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": "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": 30839, "totalSubmissionRaw": 42835}, "1285": {"acRate": 83.8426767552695, "difficulty": "Medium", "likes": 530, "dislikes": 31, "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": 34129, "totalSubmissionRaw": 40706}, "1286": {"acRate": 73.25386165211552, "difficulty": "Medium", "likes": 1339, "dislikes": 102, "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": 69807, "totalSubmissionRaw": 95295}, "1287": {"acRate": 59.07512922728, "difficulty": "Easy", "likes": 901, "dislikes": 45, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 84914, "totalSubmissionRaw": 143739}, "1288": {"acRate": 56.66042218081553, "difficulty": "Medium", "likes": 2166, "dislikes": 57, "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": 112816, "totalSubmissionRaw": 199109}, "1289": {"acRate": 58.049322541133684, "difficulty": "Hard", "likes": 1550, "dislikes": 79, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 45970, "totalSubmissionRaw": 79192}, "1290": {"acRate": 81.45575857789275, "difficulty": "Easy", "likes": 3974, "dislikes": 148, "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": 420696, "totalSubmissionRaw": 516472}, "1291": {"acRate": 61.33206965366723, "difficulty": "Medium", "likes": 1940, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91892, "totalSubmissionRaw": 149827}, "1292": {"acRate": 53.34550804037944, "difficulty": "Medium", "likes": 1046, "dislikes": 87, "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": 31548, "totalSubmissionRaw": 59139}, "1293": {"acRate": 45.16908498667456, "difficulty": "Hard", "likes": 4333, "dislikes": 78, "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": 190670, "totalSubmissionRaw": 422123}, "1294": {"acRate": 66.65230117258345, "difficulty": "Easy", "likes": 132, "dislikes": 27, "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": 37118, "totalSubmissionRaw": 55689}, "1295": {"acRate": 77.02070416847661, "difficulty": "Easy", "likes": 2203, "dislikes": 116, "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": 604620, "totalSubmissionRaw": 785010}, "1296": {"acRate": 56.616516019396144, "difficulty": "Medium", "likes": 1648, "dislikes": 105, "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": 77294, "totalSubmissionRaw": 136522}, "1297": {"acRate": 51.817359855334544, "difficulty": "Medium", "likes": 982, "dislikes": 390, "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": 45848, "totalSubmissionRaw": 88480}, "1298": {"acRate": 58.35753468860923, "difficulty": "Hard", "likes": 314, "dislikes": 141, "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": 14468, "totalSubmissionRaw": 24792}, "1299": {"acRate": 71.74237217806248, "difficulty": "Easy", "likes": 2370, "dislikes": 231, "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": 331962, "totalSubmissionRaw": 462714}, "1300": {"acRate": 43.98723171701113, "difficulty": "Medium", "likes": 1087, "dislikes": 141, "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": 35414, "totalSubmissionRaw": 80511}, "1301": {"acRate": 38.9260884887707, "difficulty": "Hard", "likes": 482, "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": 12150, "totalSubmissionRaw": 31213}, "1302": {"acRate": 86.35812250062394, "difficulty": "Medium", "likes": 4519, "dislikes": 116, "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": 297578, "totalSubmissionRaw": 344586}, "1303": {"acRate": 89.60248034547669, "difficulty": "Easy", "likes": 317, "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": 64735, "totalSubmissionRaw": 72247}, "1304": {"acRate": 76.51286264362741, "difficulty": "Easy", "likes": 1884, "dislikes": 576, "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": 199303, "totalSubmissionRaw": 260483}, "1305": {"acRate": 79.83620771947687, "difficulty": "Medium", "likes": 2960, "dislikes": 86, "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": 200721, "totalSubmissionRaw": 251416}, "1306": {"acRate": 64.22625898161685, "difficulty": "Medium", "likes": 3965, "dislikes": 94, "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": 206481, "totalSubmissionRaw": 321490}, "1307": {"acRate": 34.10501885697708, "difficulty": "Hard", "likes": 474, "dislikes": 120, "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": 11756, "totalSubmissionRaw": 34470}, "1308": {"acRate": 86.60493261208399, "difficulty": "Medium", "likes": 204, "dislikes": 59, "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": 37784, "totalSubmissionRaw": 43628}, "1309": {"acRate": 79.59865062377479, "difficulty": "Easy", "likes": 1471, "dislikes": 104, "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": 114911, "totalSubmissionRaw": 144363}, "1310": {"acRate": 72.25902940847591, "difficulty": "Medium", "likes": 1414, "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": 51697, "totalSubmissionRaw": 71544}, "1311": {"acRate": 46.49372347150727, "difficulty": "Medium", "likes": 335, "dislikes": 400, "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": 20593, "totalSubmissionRaw": 44292}, "1312": {"acRate": 69.89086479902558, "difficulty": "Hard", "likes": 4700, "dislikes": 60, "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": 143450, "totalSubmissionRaw": 205249}, "1313": {"acRate": 85.58772452031295, "difficulty": "Easy", "likes": 1180, "dislikes": 1297, "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": 242969, "totalSubmissionRaw": 283883}, "1314": {"acRate": 75.55965843526425, "difficulty": "Medium", "likes": 2309, "dislikes": 353, "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": 81849, "totalSubmissionRaw": 108324}, "1315": {"acRate": 85.48670824568525, "difficulty": "Medium", "likes": 2625, "dislikes": 74, "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": 138986, "totalSubmissionRaw": 162582}, "1316": {"acRate": 49.7992234427372, "difficulty": "Hard", "likes": 300, "dislikes": 199, "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": 15006, "totalSubmissionRaw": 30133}, "1317": {"acRate": 54.48760840188399, "difficulty": "Easy", "likes": 391, "dislikes": 298, "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": 41531, "totalSubmissionRaw": 76221}, "1318": {"acRate": 71.27502191060474, "difficulty": "Medium", "likes": 1826, "dislikes": 94, "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": 101656, "totalSubmissionRaw": 142625}, "1319": {"acRate": 62.4188508406552, "difficulty": "Medium", "likes": 4719, "dislikes": 65, "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": 193162, "totalSubmissionRaw": 309461}, "1320": {"acRate": 59.23305731972024, "difficulty": "Hard", "likes": 963, "dislikes": 34, "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": 29472, "totalSubmissionRaw": 49756}, "1321": {"acRate": 48.49444512770057, "difficulty": "Medium", "likes": 576, "dislikes": 198, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47315, "totalSubmissionRaw": 97565}, "1322": {"acRate": 59.91320983621856, "difficulty": "Easy", "likes": 243, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38520, "totalSubmissionRaw": 64293}, "1323": {"acRate": 82.024190184902, "difficulty": "Easy", "likes": 2668, "dislikes": 209, "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": 235999, "totalSubmissionRaw": 287719}, "1324": {"acRate": 62.55974050621992, "difficulty": "Medium", "likes": 727, "dislikes": 111, "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": 36259, "totalSubmissionRaw": 57959}, "1325": {"acRate": 74.36597982788349, "difficulty": "Medium", "likes": 2122, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 94450, "totalSubmissionRaw": 127007}, "1326": {"acRate": 51.50008294801499, "difficulty": "Hard", "likes": 3204, "dislikes": 176, "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": 121070, "totalSubmissionRaw": 235087}, "1327": {"acRate": 70.72199282170142, "difficulty": "Easy", "likes": 258, "dislikes": 33, "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": 62857, "totalSubmissionRaw": 88870}, "1328": {"acRate": 52.02754578167664, "difficulty": "Medium", "likes": 2230, "dislikes": 727, "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": 155861, "totalSubmissionRaw": 299574}, "1329": {"acRate": 83.01939913047715, "difficulty": "Medium", "likes": 3262, "dislikes": 221, "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": 153336, "totalSubmissionRaw": 184699}, "1330": {"acRate": 41.38469953895444, "difficulty": "Hard", "likes": 457, "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": 5296, "totalSubmissionRaw": 12797}, "1331": {"acRate": 59.898398115888426, "difficulty": "Easy", "likes": 1557, "dislikes": 73, "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": 92322, "totalSubmissionRaw": 154131}, "1332": {"acRate": 76.27989649585258, "difficulty": "Easy", "likes": 1597, "dislikes": 1718, "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": 126170, "totalSubmissionRaw": 165404}, "1333": {"acRate": 60.67143138154874, "difficulty": "Medium", "likes": 281, "dislikes": 209, "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": 27759, "totalSubmissionRaw": 45753}, "1334": {"acRate": 58.02306256924602, "difficulty": "Medium", "likes": 2414, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 79603, "totalSubmissionRaw": 137192}, "1335": {"acRate": 58.31933463582084, "difficulty": "Hard", "likes": 2648, "dislikes": 239, "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": 127759, "totalSubmissionRaw": 219068}, "1336": {"acRate": 47.948082496744654, "difficulty": "Hard", "likes": 88, "dislikes": 304, "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": 11415, "totalSubmissionRaw": 23807}, "1337": {"acRate": 73.44468310614714, "difficulty": "Easy", "likes": 4018, "dislikes": 225, "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": 338851, "totalSubmissionRaw": 461369}, "1338": {"acRate": 69.10961081134901, "difficulty": "Medium", "likes": 3159, "dislikes": 146, "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": 180468, "totalSubmissionRaw": 261133}, "1339": {"acRate": 47.725387251267456, "difficulty": "Medium", "likes": 2931, "dislikes": 101, "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": 119082, "totalSubmissionRaw": 249515}, "1340": {"acRate": 62.804613650160434, "difficulty": "Hard", "likes": 1058, "dislikes": 37, "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": 28968, "totalSubmissionRaw": 46124}, "1341": {"acRate": 42.11650485436893, "difficulty": "Medium", "likes": 367, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47716, "totalSubmissionRaw": 113297}, "1342": {"acRate": 84.84416224522339, "difficulty": "Easy", "likes": 3731, "dislikes": 164, "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": 585271, "totalSubmissionRaw": 689819}, "1343": {"acRate": 68.16147644056512, "difficulty": "Medium", "likes": 1439, "dislikes": 94, "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": 73718, "totalSubmissionRaw": 108152}, "1344": {"acRate": 63.392998664040036, "difficulty": "Medium", "likes": 1258, "dislikes": 233, "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": 111982, "totalSubmissionRaw": 176648}, "1345": {"acRate": 46.564846063778496, "difficulty": "Hard", "likes": 3616, "dislikes": 125, "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": 135213, "totalSubmissionRaw": 290378}, "1346": {"acRate": 36.76677917870538, "difficulty": "Easy", "likes": 1815, "dislikes": 187, "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": 311640, "totalSubmissionRaw": 847613}, "1347": {"acRate": 78.1218552228459, "difficulty": "Medium", "likes": 1957, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 139735, "totalSubmissionRaw": 178868}, "1348": {"acRate": 44.1202325251666, "difficulty": "Medium", "likes": 178, "dislikes": 275, "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": 31118, "totalSubmissionRaw": 70530}, "1349": {"acRate": 49.837690073466604, "difficulty": "Hard", "likes": 785, "dislikes": 15, "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": 14585, "totalSubmissionRaw": 29265}, "1350": {"acRate": 89.70938122345395, "difficulty": "Easy", "likes": 171, "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": 50902, "totalSubmissionRaw": 56741}, "1351": {"acRate": 77.27768099842628, "difficulty": "Easy", "likes": 4744, "dislikes": 123, "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": 367307, "totalSubmissionRaw": 475308}, "1352": {"acRate": 50.260991300289994, "difficulty": "Medium", "likes": 1383, "dislikes": 66, "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": 75393, "totalSubmissionRaw": 150004}, "1353": {"acRate": 32.17198230322239, "difficulty": "Medium", "likes": 2836, "dislikes": 375, "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": 77953, "totalSubmissionRaw": 242303}, "1354": {"acRate": 36.21758423082927, "difficulty": "Hard", "likes": 2015, "dislikes": 161, "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": 64970, "totalSubmissionRaw": 179388}, "1355": {"acRate": 73.07681834272799, "difficulty": "Medium", "likes": 135, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26836, "totalSubmissionRaw": 36723}, "1356": {"acRate": 73.71051694223897, "difficulty": "Easy", "likes": 1829, "dislikes": 92, "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": 128302, "totalSubmissionRaw": 174062}, "1357": {"acRate": 70.17995791306872, "difficulty": "Medium", "likes": 173, "dislikes": 216, "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": 19343, "totalSubmissionRaw": 27562}, "1358": {"acRate": 64.59081691114284, "difficulty": "Medium", "likes": 2826, "dislikes": 45, "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": 71026, "totalSubmissionRaw": 109963}, "1359": {"acRate": 65.43679336433442, "difficulty": "Hard", "likes": 2940, "dislikes": 217, "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": 115812, "totalSubmissionRaw": 176983}, "1360": {"acRate": 48.953036357894966, "difficulty": "Easy", "likes": 336, "dislikes": 1224, "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": 44957, "totalSubmissionRaw": 91837}, "1361": {"acRate": 39.254934667778706, "difficulty": "Medium", "likes": 1232, "dislikes": 329, "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": 46595, "totalSubmissionRaw": 118697}, "1362": {"acRate": 60.317129767358836, "difficulty": "Medium", "likes": 297, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20275, "totalSubmissionRaw": 33614}, "1363": {"acRate": 32.88432039776434, "difficulty": "Hard", "likes": 569, "dislikes": 78, "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": 18650, "totalSubmissionRaw": 56714}, "1364": {"acRate": 76.2540402132393, "difficulty": "Medium", "likes": 86, "dislikes": 371, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 18166, "totalSubmissionRaw": 23823}, "1365": {"acRate": 86.53035522201152, "difficulty": "Easy", "likes": 5123, "dislikes": 110, "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": 485071, "totalSubmissionRaw": 560579}, "1366": {"acRate": 57.905593981312954, "difficulty": "Medium", "likes": 1317, "dislikes": 147, "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": 62036, "totalSubmissionRaw": 107132}, "1367": {"acRate": 43.77914171781442, "difficulty": "Medium", "likes": 2119, "dislikes": 65, "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": 70044, "totalSubmissionRaw": 159994}, "1368": {"acRate": 61.79648742658379, "difficulty": "Hard", "likes": 1642, "dislikes": 18, "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": 43349, "totalSubmissionRaw": 70147}, "1369": {"acRate": 68.01188584064681, "difficulty": "Hard", "likes": 157, "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": 19684, "totalSubmissionRaw": 28942}, "1370": {"acRate": 76.42143920379847, "difficulty": "Easy", "likes": 727, "dislikes": 825, "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": 70336, "totalSubmissionRaw": 92037}, "1371": {"acRate": 63.656849794078795, "difficulty": "Medium", "likes": 1548, "dislikes": 58, "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": 24576, "totalSubmissionRaw": 38607}, "1372": {"acRate": 66.54010466730749, "difficulty": "Medium", "likes": 3147, "dislikes": 64, "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": 124603, "totalSubmissionRaw": 187260}, "1373": {"acRate": 40.305658599385495, "difficulty": "Hard", "likes": 2411, "dislikes": 166, "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": 60737, "totalSubmissionRaw": 150691}, "1374": {"acRate": 77.57826677731472, "difficulty": "Easy", "likes": 453, "dislikes": 1241, "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": 85070, "totalSubmissionRaw": 109657}, "1375": {"acRate": 65.83725532142475, "difficulty": "Medium", "likes": 908, "dislikes": 127, "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": 49241, "totalSubmissionRaw": 74792}, "1376": {"acRate": 60.15678723696878, "difficulty": "Medium", "likes": 3899, "dislikes": 269, "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": 196827, "totalSubmissionRaw": 327192}, "1377": {"acRate": 35.5201022724308, "difficulty": "Hard", "likes": 746, "dislikes": 137, "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": 27229, "totalSubmissionRaw": 76658}, "1378": {"acRate": 83.27536966786101, "difficulty": "Easy", "likes": 716, "dislikes": 69, "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": 174071, "totalSubmissionRaw": 209032}, "1379": {"acRate": 86.09586231754962, "difficulty": "Easy", "likes": 1662, "dislikes": 1942, "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": 207807, "totalSubmissionRaw": 241367}, "1380": {"acRate": 70.92416704357004, "difficulty": "Easy", "likes": 1586, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 94088, "totalSubmissionRaw": 132660}, "1381": {"acRate": 77.10992366412214, "difficulty": "Medium", "likes": 1718, "dislikes": 91, "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": 101012, "totalSubmissionRaw": 130998}, "1382": {"acRate": 81.02870318736333, "difficulty": "Medium", "likes": 2874, "dislikes": 68, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 129320, "totalSubmissionRaw": 159598}, "1383": {"acRate": 48.04612051946943, "difficulty": "Hard", "likes": 2989, "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": 90049, "totalSubmissionRaw": 187422}, "1384": {"acRate": 62.35591674268181, "difficulty": "Hard", "likes": 213, "dislikes": 125, "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": 15039, "totalSubmissionRaw": 24118}, "1385": {"acRate": 67.37202531269497, "difficulty": "Easy", "likes": 833, "dislikes": 2914, "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": 90707, "totalSubmissionRaw": 134636}, "1386": {"acRate": 41.36531911742929, "difficulty": "Medium", "likes": 808, "dislikes": 374, "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": 41901, "totalSubmissionRaw": 101295}, "1387": {"acRate": 69.91430948419301, "difficulty": "Medium", "likes": 1367, "dislikes": 109, "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": 84032, "totalSubmissionRaw": 120195}, "1388": {"acRate": 51.14476477961679, "difficulty": "Hard", "likes": 994, "dislikes": 16, "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": 19993, "totalSubmissionRaw": 39091}, "1389": {"acRate": 85.73905726553531, "difficulty": "Easy", "likes": 1852, "dislikes": 1782, "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": 218055, "totalSubmissionRaw": 254324}, "1390": {"acRate": 41.60005771172991, "difficulty": "Medium", "likes": 373, "dislikes": 182, "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": 28833, "totalSubmissionRaw": 69310}, "1391": {"acRate": 47.6418850441581, "difficulty": "Medium", "likes": 778, "dislikes": 305, "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": 26325, "totalSubmissionRaw": 55256}, "1392": {"acRate": 44.993098822285, "difficulty": "Hard", "likes": 1231, "dislikes": 34, "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": 34880, "totalSubmissionRaw": 77523}, "1393": {"acRate": 85.7399314559269, "difficulty": "Medium", "likes": 753, "dislikes": 43, "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": 94566, "totalSubmissionRaw": 110294}, "1394": {"acRate": 65.60367283549583, "difficulty": "Easy", "likes": 1068, "dislikes": 29, "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": 106028, "totalSubmissionRaw": 161619}, "1395": {"acRate": 66.29726411233196, "difficulty": "Medium", "likes": 2593, "dislikes": 182, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105289, "totalSubmissionRaw": 158814}, "1396": {"acRate": 74.76643466126644, "difficulty": "Medium", "likes": 3407, "dislikes": 165, "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": 219672, "totalSubmissionRaw": 293812}, "1397": {"acRate": 41.98985786729519, "difficulty": "Hard", "likes": 459, "dislikes": 124, "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": 5879, "totalSubmissionRaw": 14001}, "1398": {"acRate": 74.04243365610232, "difficulty": "Medium", "likes": 281, "dislikes": 15, "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": 44809, "totalSubmissionRaw": 60518}, "1399": {"acRate": 66.64619363180863, "difficulty": "Easy", "likes": 412, "dislikes": 924, "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": 41233, "totalSubmissionRaw": 61869}, "1400": {"acRate": 62.36771717641586, "difficulty": "Medium", "likes": 1005, "dislikes": 88, "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": 48267, "totalSubmissionRaw": 77391}, "1401": {"acRate": 44.81613206281036, "difficulty": "Medium", "likes": 315, "dislikes": 70, "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": 13355, "totalSubmissionRaw": 29801}, "1402": {"acRate": 76.39021616848319, "difficulty": "Hard", "likes": 3114, "dislikes": 291, "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": 126299, "totalSubmissionRaw": 165334}, "1403": {"acRate": 72.39526223795204, "difficulty": "Easy", "likes": 547, "dislikes": 483, "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": 66684, "totalSubmissionRaw": 92111}, "1404": {"acRate": 52.754840751503295, "difficulty": "Medium", "likes": 747, "dislikes": 57, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 36672, "totalSubmissionRaw": 69514}, "1405": {"acRate": 57.269068654299524, "difficulty": "Medium", "likes": 1899, "dislikes": 237, "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": 72147, "totalSubmissionRaw": 125978}, "1406": {"acRate": 64.63232781384946, "difficulty": "Hard", "likes": 2095, "dislikes": 68, "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": 83218, "totalSubmissionRaw": 128756}, "1407": {"acRate": 58.74487483655684, "difficulty": "Easy", "likes": 574, "dislikes": 59, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99290, "totalSubmissionRaw": 169019}, "1408": {"acRate": 63.74802194108049, "difficulty": "Easy", "likes": 848, "dislikes": 85, "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": 77747, "totalSubmissionRaw": 121961}, "1409": {"acRate": 83.81558432140397, "difficulty": "Medium", "likes": 458, "dislikes": 609, "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": 46231, "totalSubmissionRaw": 55158}, "1410": {"acRate": 51.11725513302815, "difficulty": "Medium", "likes": 176, "dislikes": 316, "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": 22556, "totalSubmissionRaw": 44126}, "1411": {"acRate": 63.25774448268881, "difficulty": "Hard", "likes": 1037, "dislikes": 48, "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": 31243, "totalSubmissionRaw": 49390}, "1412": {"acRate": 60.108901515151516, "difficulty": "Hard", "likes": 198, "dislikes": 18, "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": 22851, "totalSubmissionRaw": 38016}, "1413": {"acRate": 66.45317159006682, "difficulty": "Easy", "likes": 1483, "dislikes": 305, "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": 117450, "totalSubmissionRaw": 176741}, "1414": {"acRate": 65.20800013190654, "difficulty": "Medium", "likes": 975, "dislikes": 62, "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": 39548, "totalSubmissionRaw": 60649}, "1415": {"acRate": 73.43359986461903, "difficulty": "Medium", "likes": 917, "dislikes": 24, "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": 34715, "totalSubmissionRaw": 47274}, "1416": {"acRate": 48.34321318852495, "difficulty": "Hard", "likes": 1529, "dislikes": 51, "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": 55863, "totalSubmissionRaw": 115555}, "1417": {"acRate": 53.50805241572472, "difficulty": "Easy", "likes": 558, "dislikes": 99, "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": 53491, "totalSubmissionRaw": 99969}, "1418": {"acRate": 74.40733233453777, "difficulty": "Medium", "likes": 351, "dislikes": 460, "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": 25329, "totalSubmissionRaw": 34041}, "1419": {"acRate": 50.1744314933436, "difficulty": "Medium", "likes": 979, "dislikes": 76, "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": 43003, "totalSubmissionRaw": 85707}, "1420": {"acRate": 69.98478001816959, "difficulty": "Hard", "likes": 1265, "dislikes": 82, "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": 59317, "totalSubmissionRaw": 84757}, "1421": {"acRate": 82.69710662979699, "difficulty": "Easy", "likes": 52, "dislikes": 291, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24523, "totalSubmissionRaw": 29654}, "1422": {"acRate": 57.916258912344475, "difficulty": "Easy", "likes": 641, "dislikes": 37, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49713, "totalSubmissionRaw": 85836}, "1423": {"acRate": 52.25958383537772, "difficulty": "Medium", "likes": 5751, "dislikes": 206, "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": 238114, "totalSubmissionRaw": 455636}, "1424": {"acRate": 50.59596592208205, "difficulty": "Medium", "likes": 1097, "dislikes": 88, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 50890, "totalSubmissionRaw": 100587}, "1425": {"acRate": 47.803122117106525, "difficulty": "Hard", "likes": 1208, "dislikes": 54, "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": 26427, "totalSubmissionRaw": 55283}, "1426": {"acRate": 59.86867411785739, "difficulty": "Easy", "likes": 141, "dislikes": 40, "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": 110504, "totalSubmissionRaw": 184578}, "1427": {"acRate": 54.48228132371011, "difficulty": "Easy", "likes": 222, "dislikes": 6, "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": 77148, "totalSubmissionRaw": 141602}, "1428": {"acRate": 53.63379492923328, "difficulty": "Medium", "likes": 1162, "dislikes": 133, "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": 168556, "totalSubmissionRaw": 314272}, "1429": {"acRate": 53.29856207261238, "difficulty": "Medium", "likes": 528, "dislikes": 30, "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": 81138, "totalSubmissionRaw": 152233}, "1430": {"acRate": 46.61867411625658, "difficulty": "Medium", "likes": 206, "dislikes": 13, "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": 43388, "totalSubmissionRaw": 93070}, "1431": {"acRate": 87.29538547620876, "difficulty": "Easy", "likes": 3963, "dislikes": 476, "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": 636537, "totalSubmissionRaw": 729176}, "1432": {"acRate": 41.040012063938875, "difficulty": "Medium", "likes": 217, "dislikes": 272, "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": 16329, "totalSubmissionRaw": 39788}, "1433": {"acRate": 69.24959216965743, "difficulty": "Medium", "likes": 720, "dislikes": 135, "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": 39054, "totalSubmissionRaw": 56396}, "1434": {"acRate": 43.92434833736199, "difficulty": "Hard", "likes": 856, "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": 13447, "totalSubmissionRaw": 30614}, "1435": {"acRate": 75.73202405094817, "difficulty": "Easy", "likes": 144, "dislikes": 256, "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": 21286, "totalSubmissionRaw": 28107}, "1436": {"acRate": 77.08535895986432, "difficulty": "Easy", "likes": 1420, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 136364, "totalSubmissionRaw": 176900}, "1437": {"acRate": 58.08077942499574, "difficulty": "Easy", "likes": 601, "dislikes": 219, "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": 71656, "totalSubmissionRaw": 123373}, "1438": {"acRate": 48.80954360987293, "difficulty": "Medium", "likes": 3147, "dislikes": 133, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 117385, "totalSubmissionRaw": 240496}, "1439": {"acRate": 61.379351573241934, "difficulty": "Hard", "likes": 1179, "dislikes": 15, "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": 30802, "totalSubmissionRaw": 50183}, "1440": {"acRate": 73.48375883974589, "difficulty": "Medium", "likes": 198, "dislikes": 15, "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": 24523, "totalSubmissionRaw": 33372}, "1441": {"acRate": 72.5030327537404, "difficulty": "Medium", "likes": 290, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 78892, "totalSubmissionRaw": 108812}, "1442": {"acRate": 76.64214282567514, "difficulty": "Medium", "likes": 1307, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 34794, "totalSubmissionRaw": 45398}, "1443": {"acRate": 62.35294117647059, "difficulty": "Medium", "likes": 3473, "dislikes": 299, "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": 105735, "totalSubmissionRaw": 169575}, "1444": {"acRate": 62.91714922482507, "difficulty": "Hard", "likes": 1744, "dislikes": 92, "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": 64648, "totalSubmissionRaw": 102751}, "1445": {"acRate": 88.5132189898607, "difficulty": "Medium", "likes": 229, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46703, "totalSubmissionRaw": 52764}, "1446": {"acRate": 60.563471189066206, "difficulty": "Easy", "likes": 1650, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150132, "totalSubmissionRaw": 247892}, "1447": {"acRate": 65.82929304318412, "difficulty": "Medium", "likes": 390, "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": 29192, "totalSubmissionRaw": 44345}, "1448": {"acRate": 73.44359264315997, "difficulty": "Medium", "likes": 5401, "dislikes": 139, "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": 388376, "totalSubmissionRaw": 528808}, "1449": {"acRate": 47.7603965686129, "difficulty": "Hard", "likes": 662, "dislikes": 15, "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": 16090, "totalSubmissionRaw": 33689}, "1450": {"acRate": 75.5729173725081, "difficulty": "Easy", "likes": 833, "dislikes": 150, "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": 111529, "totalSubmissionRaw": 147578}, "1451": {"acRate": 63.770703030628404, "difficulty": "Medium", "likes": 700, "dislikes": 73, "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": 47513, "totalSubmissionRaw": 74506}, "1452": {"acRate": 57.157814096016345, "difficulty": "Medium", "likes": 324, "dislikes": 220, "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": 22383, "totalSubmissionRaw": 39160}, "1453": {"acRate": 37.15627095908786, "difficulty": "Hard", "likes": 139, "dislikes": 266, "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": 5540, "totalSubmissionRaw": 14910}, "1454": {"acRate": 37.24221149627029, "difficulty": "Medium", "likes": 385, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33950, "totalSubmissionRaw": 91160}, "1455": {"acRate": 64.13120858660534, "difficulty": "Easy", "likes": 786, "dislikes": 38, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70266, "totalSubmissionRaw": 109566}, "1456": {"acRate": 57.8765578300344, "difficulty": "Medium", "likes": 3144, "dislikes": 104, "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": 205265, "totalSubmissionRaw": 354660}, "1457": {"acRate": 67.44601732273509, "difficulty": "Medium", "likes": 2486, "dislikes": 81, "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": 117350, "totalSubmissionRaw": 173991}, "1458": {"acRate": 62.643245647042725, "difficulty": "Hard", "likes": 1578, "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": 73250, "totalSubmissionRaw": 116932}, "1459": {"acRate": 68.74702032678888, "difficulty": "Medium", "likes": 90, "dislikes": 157, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15862, "totalSubmissionRaw": 23073}, "1460": {"acRate": 71.88621460646712, "difficulty": "Easy", "likes": 995, "dislikes": 140, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 114780, "totalSubmissionRaw": 159669}, "1461": {"acRate": 56.49977986970265, "difficulty": "Medium", "likes": 2173, "dislikes": 92, "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": 114209, "totalSubmissionRaw": 202145}, "1462": {"acRate": 49.46429798976716, "difficulty": "Medium", "likes": 1329, "dislikes": 60, "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": 50369, "totalSubmissionRaw": 101829}, "1463": {"acRate": 69.5093867715911, "difficulty": "Hard", "likes": 3296, "dislikes": 32, "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": 91156, "totalSubmissionRaw": 131142}, "1464": {"acRate": 80.53594094897059, "difficulty": "Easy", "likes": 1780, "dislikes": 195, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 216358, "totalSubmissionRaw": 268648}, "1465": {"acRate": 40.928303912542866, "difficulty": "Medium", "likes": 2589, "dislikes": 346, "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": 163157, "totalSubmissionRaw": 398641}, "1466": {"acRate": 65.51893537322468, "difficulty": "Medium", "likes": 3757, "dislikes": 91, "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": 149371, "totalSubmissionRaw": 227983}, "1467": {"acRate": 60.60244794150373, "difficulty": "Hard", "likes": 273, "dislikes": 167, "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": 7625, "totalSubmissionRaw": 12582}, "1468": {"acRate": 79.4633568891918, "difficulty": "Medium", "likes": 119, "dislikes": 21, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22152, "totalSubmissionRaw": 27877}, "1469": {"acRate": 82.54510343841078, "difficulty": "Easy", "likes": 477, "dislikes": 9, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 46165, "totalSubmissionRaw": 55927}, "1470": {"acRate": 88.43933643441277, "difficulty": "Easy", "likes": 5391, "dislikes": 272, "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": 594903, "totalSubmissionRaw": 672668}, "1471": {"acRate": 60.77830027942479, "difficulty": "Medium", "likes": 653, "dislikes": 143, "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": 35672, "totalSubmissionRaw": 58692}, "1472": {"acRate": 77.69614530147719, "difficulty": "Medium", "likes": 3586, "dislikes": 209, "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": 199341, "totalSubmissionRaw": 256565}, "1473": {"acRate": 61.23128812641836, "difficulty": "Hard", "likes": 2007, "dislikes": 144, "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": 58820, "totalSubmissionRaw": 96062}, "1474": {"acRate": 73.16226375691761, "difficulty": "Easy", "likes": 382, "dislikes": 13, "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": 28027, "totalSubmissionRaw": 38308}, "1475": {"acRate": 76.81421814957139, "difficulty": "Easy", "likes": 1935, "dislikes": 102, "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": 124733, "totalSubmissionRaw": 162383}, "1476": {"acRate": 88.15992871042246, "difficulty": "Medium", "likes": 586, "dislikes": 1388, "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": 96953, "totalSubmissionRaw": 109974}, "1477": {"acRate": 36.56384464483212, "difficulty": "Medium", "likes": 1635, "dislikes": 81, "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": 45292, "totalSubmissionRaw": 123871}, "1478": {"acRate": 55.279440615725136, "difficulty": "Hard", "likes": 1044, "dislikes": 17, "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": 21978, "totalSubmissionRaw": 39758}, "1479": {"acRate": 79.09307643652996, "difficulty": "Hard", "likes": 146, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 16255, "totalSubmissionRaw": 20552}, "1480": {"acRate": 86.64775245091406, "difficulty": "Easy", "likes": 7356, "dislikes": 327, "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": 1632696, "totalSubmissionRaw": 1884292}, "1481": {"acRate": 55.95571682072199, "difficulty": "Medium", "likes": 1409, "dislikes": 140, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 105631, "totalSubmissionRaw": 188777}, "1482": {"acRate": 52.22312094067654, "difficulty": "Medium", "likes": 3352, "dislikes": 83, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 86517, "totalSubmissionRaw": 165668}, "1483": {"acRate": 34.28771929824561, "difficulty": "Hard", "likes": 1819, "dislikes": 112, "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": 31759, "totalSubmissionRaw": 92625}, "1484": {"acRate": 76.9210471287602, "difficulty": "Easy", "likes": 1244, "dislikes": 89, "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": 154499, "totalSubmissionRaw": 200854}, "1485": {"acRate": 80.59195661997288, "difficulty": "Medium", "likes": 406, "dislikes": 81, "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": 24969, "totalSubmissionRaw": 30982}, "1486": {"acRate": 85.20793060718711, "difficulty": "Easy", "likes": 1307, "dislikes": 323, "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": 171906, "totalSubmissionRaw": 201749}, "1487": {"acRate": 36.626922452388136, "difficulty": "Medium", "likes": 419, "dislikes": 687, "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": 31579, "totalSubmissionRaw": 86218}, "1488": {"acRate": 26.786729099131552, "difficulty": "Medium", "likes": 1450, "dislikes": 275, "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": 33466, "totalSubmissionRaw": 124935}, "1489": {"acRate": 69.2711020624451, "difficulty": "Hard", "likes": 1732, "dislikes": 147, "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": 49675, "totalSubmissionRaw": 71711}, "1490": {"acRate": 83.25874821306482, "difficulty": "Medium", "likes": 390, "dislikes": 14, "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": 26791, "totalSubmissionRaw": 32178}, "1491": {"acRate": 63.44253013658775, "difficulty": "Easy", "likes": 2180, "dislikes": 184, "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": 322722, "totalSubmissionRaw": 508684}, "1492": {"acRate": 65.64652548617563, "difficulty": "Medium", "likes": 1520, "dislikes": 277, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 163918, "totalSubmissionRaw": 249700}, "1493": {"acRate": 66.58520273491139, "difficulty": "Medium", "likes": 3527, "dislikes": 60, "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": 187172, "totalSubmissionRaw": 281100}, "1494": {"acRate": 30.008154905270345, "difficulty": "Hard", "likes": 922, "dislikes": 64, "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": 15823, "totalSubmissionRaw": 52729}, "1495": {"acRate": 49.0447465562258, "difficulty": "Easy", "likes": 78, "dislikes": 35, "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": 27237, "totalSubmissionRaw": 55535}, "1496": {"acRate": 56.248981410054434, "difficulty": "Easy", "likes": 685, "dislikes": 18, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51770, "totalSubmissionRaw": 92037}, "1497": {"acRate": 38.58728591961487, "difficulty": "Medium", "likes": 1601, "dislikes": 87, "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": 44566, "totalSubmissionRaw": 115494}, "1498": {"acRate": 44.033155071427984, "difficulty": "Medium", "likes": 3688, "dislikes": 330, "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": 107201, "totalSubmissionRaw": 243459}, "1499": {"acRate": 44.69354910814073, "difficulty": "Hard", "likes": 1265, "dislikes": 52, "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": 39990, "totalSubmissionRaw": 89476}, "1500": {"acRate": 44.24860853432282, "difficulty": "Medium", "likes": 45, "dislikes": 113, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3816, "totalSubmissionRaw": 8624}, "1501": {"acRate": 49.6449069511276, "difficulty": "Medium", "likes": 285, "dislikes": 136, "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": 34252, "totalSubmissionRaw": 68995}, "1502": {"acRate": 69.85296162295269, "difficulty": "Easy", "likes": 2086, "dislikes": 105, "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": 226084, "totalSubmissionRaw": 323657}, "1503": {"acRate": 57.28923827595555, "difficulty": "Medium", "likes": 547, "dislikes": 209, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21134, "totalSubmissionRaw": 36890}, "1504": {"acRate": 57.28216042034893, "difficulty": "Medium", "likes": 1991, "dislikes": 157, "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": 47641, "totalSubmissionRaw": 83169}, "1505": {"acRate": 38.72813199568858, "difficulty": "Hard", "likes": 466, "dislikes": 24, "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": 9342, "totalSubmissionRaw": 24122}, "1506": {"acRate": 78.47145352126535, "difficulty": "Medium", "likes": 447, "dislikes": 184, "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": 31901, "totalSubmissionRaw": 40653}, "1507": {"acRate": 64.1049603091268, "difficulty": "Easy", "likes": 421, "dislikes": 415, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61051, "totalSubmissionRaw": 95236}, "1508": {"acRate": 58.61229760603953, "difficulty": "Medium", "likes": 881, "dislikes": 145, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 35403, "totalSubmissionRaw": 60402}, "1509": {"acRate": 54.79032564708438, "difficulty": "Medium", "likes": 1590, "dislikes": 170, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 80693, "totalSubmissionRaw": 147276}, "1510": {"acRate": 59.84752777172729, "difficulty": "Hard", "likes": 1550, "dislikes": 67, "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": 68690, "totalSubmissionRaw": 114775}, "1511": {"acRate": 69.4250471948828, "difficulty": "Easy", "likes": 296, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37879, "totalSubmissionRaw": 54561}, "1512": {"acRate": 88.96739772386047, "difficulty": "Easy", "likes": 4990, "dislikes": 217, "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": 625155, "totalSubmissionRaw": 702679}, "1513": {"acRate": 45.776728376050826, "difficulty": "Medium", "likes": 797, "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": 40132, "totalSubmissionRaw": 87669}, "1514": {"acRate": 54.62070448274626, "difficulty": "Medium", "likes": 2972, "dislikes": 67, "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": 121944, "totalSubmissionRaw": 223256}, "1515": {"acRate": 36.70053626869884, "difficulty": "Hard", "likes": 220, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13003, "totalSubmissionRaw": 35430}, "1516": {"acRate": 62.64061574896388, "difficulty": "Hard", "likes": 33, "dislikes": 57, "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": 2116, "totalSubmissionRaw": 3378}, "1517": {"acRate": 47.24844808953749, "difficulty": "Easy", "likes": 313, "dislikes": 206, "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": 56399, "totalSubmissionRaw": 119368}, "1518": {"acRate": 60.540593251892695, "difficulty": "Easy", "likes": 961, "dislikes": 76, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 68291, "totalSubmissionRaw": 112802}, "1519": {"acRate": 55.119405409796116, "difficulty": "Medium", "likes": 2179, "dislikes": 794, "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": 81429, "totalSubmissionRaw": 147732}, "1520": {"acRate": 38.50852836176121, "difficulty": "Hard", "likes": 773, "dislikes": 72, "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": 14562, "totalSubmissionRaw": 37815}, "1521": {"acRate": 43.85833761622202, "difficulty": "Hard", "likes": 352, "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": 9387, "totalSubmissionRaw": 21403}, "1522": {"acRate": 73.75289336030765, "difficulty": "Medium", "likes": 554, "dislikes": 8, "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": 40464, "totalSubmissionRaw": 54865}, "1523": {"acRate": 49.69799547617191, "difficulty": "Easy", "likes": 2670, "dislikes": 154, "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": 318589, "totalSubmissionRaw": 641050}, "1524": {"acRate": 43.328554478940084, "difficulty": "Medium", "likes": 1278, "dislikes": 56, "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": 35058, "totalSubmissionRaw": 80912}, "1525": {"acRate": 68.62941146637105, "difficulty": "Medium", "likes": 1959, "dislikes": 46, "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": "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": 94723, "totalSubmissionRaw": 138021}, "1526": {"acRate": 69.53799053715558, "difficulty": "Hard", "likes": 1368, "dislikes": 63, "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": 34979, "totalSubmissionRaw": 50302}, "1527": {"acRate": 40.387464879585224, "difficulty": "Easy", "likes": 532, "dislikes": 502, "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": 149639, "totalSubmissionRaw": 370508}, "1528": {"acRate": 84.66140778860023, "difficulty": "Easy", "likes": 2565, "dislikes": 461, "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": 332814, "totalSubmissionRaw": 393112}, "1529": {"acRate": 72.60611563280261, "difficulty": "Medium", "likes": 952, "dislikes": 39, "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": 44781, "totalSubmissionRaw": 61677}, "1530": {"acRate": 61.59753976943389, "difficulty": "Medium", "likes": 1639, "dislikes": 44, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38257, "totalSubmissionRaw": 62108}, "1531": {"acRate": 49.137873643565676, "difficulty": "Hard", "likes": 1663, "dislikes": 122, "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": 44286, "totalSubmissionRaw": 90126}, "1532": {"acRate": 68.67121191039377, "difficulty": "Medium", "likes": 144, "dislikes": 10, "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": 24677, "totalSubmissionRaw": 35935}, "1533": {"acRate": 55.9583494022368, "difficulty": "Medium", "likes": 231, "dislikes": 29, "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": 11608, "totalSubmissionRaw": 20744}, "1534": {"acRate": 80.99834192792711, "difficulty": "Easy", "likes": 704, "dislikes": 1160, "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": 106495, "totalSubmissionRaw": 131478}, "1535": {"acRate": 48.48817245326211, "difficulty": "Medium", "likes": 606, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30501, "totalSubmissionRaw": 62904}, "1536": {"acRate": 46.60567802045708, "difficulty": "Medium", "likes": 544, "dislikes": 68, "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": 13806, "totalSubmissionRaw": 29623}, "1537": {"acRate": 39.09863805200165, "difficulty": "Hard", "likes": 934, "dislikes": 47, "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": 23684, "totalSubmissionRaw": 60575}, "1538": {"acRate": 70.78435151281556, "difficulty": "Medium", "likes": 127, "dislikes": 99, "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": 3673, "totalSubmissionRaw": 5189}, "1539": {"acRate": 59.0498681559966, "difficulty": "Easy", "likes": 6020, "dislikes": 378, "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": 345313, "totalSubmissionRaw": 584782}, "1540": {"acRate": 34.03896001885162, "difficulty": "Medium", "likes": 353, "dislikes": 299, "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": 17334, "totalSubmissionRaw": 50924}, "1541": {"acRate": 49.81065088757396, "difficulty": "Medium", "likes": 974, "dislikes": 216, "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": 42090, "totalSubmissionRaw": 84500}, "1542": {"acRate": 42.63381648980685, "difficulty": "Hard", "likes": 744, "dislikes": 11, "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": 12736, "totalSubmissionRaw": 29873}, "1543": {"acRate": 59.87087241423615, "difficulty": "Easy", "likes": 83, "dislikes": 43, "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": 18639, "totalSubmissionRaw": 31132}, "1544": {"acRate": 63.1056994302231, "difficulty": "Easy", "likes": 2363, "dislikes": 109, "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": 151955, "totalSubmissionRaw": 240795}, "1545": {"acRate": 58.76702759343346, "difficulty": "Medium", "likes": 860, "dislikes": 54, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37015, "totalSubmissionRaw": 62986}, "1546": {"acRate": 47.4973298817907, "difficulty": "Medium", "likes": 1006, "dislikes": 25, "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": 26238, "totalSubmissionRaw": 55241}, "1547": {"acRate": 62.047411179822966, "difficulty": "Hard", "likes": 3927, "dislikes": 88, "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": 102341, "totalSubmissionRaw": 164940}, "1548": {"acRate": 58.92245297531641, "difficulty": "Hard", "likes": 369, "dislikes": 182, "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": 16853, "totalSubmissionRaw": 28602}, "1549": {"acRate": 65.43309969662099, "difficulty": "Medium", "likes": 126, "dislikes": 11, "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": 25019, "totalSubmissionRaw": 38236}, "1550": {"acRate": 63.10343364033785, "difficulty": "Easy", "likes": 605, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74339, "totalSubmissionRaw": 117805}, "1551": {"acRate": 81.95478356768679, "difficulty": "Medium", "likes": 1376, "dislikes": 173, "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": 89175, "totalSubmissionRaw": 108803}, "1552": {"acRate": 59.75368842210552, "difficulty": "Medium", "likes": 2000, "dislikes": 107, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 47791, "totalSubmissionRaw": 79980}, "1553": {"acRate": 34.938760574294506, "difficulty": "Hard", "likes": 948, "dislikes": 55, "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": 32463, "totalSubmissionRaw": 92914}, "1554": {"acRate": 41.96218999617897, "difficulty": "Medium", "likes": 358, "dislikes": 89, "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": 23062, "totalSubmissionRaw": 54959}, "1555": {"acRate": 51.56714401513105, "difficulty": "Medium", "likes": 129, "dislikes": 27, "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": 15268, "totalSubmissionRaw": 29608}, "1556": {"acRate": 53.97049628308746, "difficulty": "Easy", "likes": 459, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46610, "totalSubmissionRaw": 86362}, "1557": {"acRate": 81.2497515799515, "difficulty": "Medium", "likes": 3531, "dislikes": 117, "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": 163530, "totalSubmissionRaw": 201269}, "1558": {"acRate": 63.83405501782985, "difficulty": "Medium", "likes": 605, "dislikes": 34, "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": 20049, "totalSubmissionRaw": 31408}, "1559": {"acRate": 48.4379703430314, "difficulty": "Medium", "likes": 1084, "dislikes": 24, "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": 37010, "totalSubmissionRaw": 76407}, "1560": {"acRate": 58.33835522879755, "difficulty": "Easy", "likes": 297, "dislikes": 593, "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": 29042, "totalSubmissionRaw": 49782}, "1561": {"acRate": 79.6419834247594, "difficulty": "Medium", "likes": 1172, "dislikes": 129, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 73899, "totalSubmissionRaw": 92789}, "1562": {"acRate": 42.90510295434199, "difficulty": "Medium", "likes": 621, "dislikes": 130, "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": 17253, "totalSubmissionRaw": 40212}, "1563": {"acRate": 40.56548158897152, "difficulty": "Hard", "likes": 617, "dislikes": 79, "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": 17891, "totalSubmissionRaw": 44104}, "1564": {"acRate": 67.0702947845805, "difficulty": "Medium", "likes": 316, "dislikes": 27, "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": 14789, "totalSubmissionRaw": 22050}, "1565": {"acRate": 82.2791599620415, "difficulty": "Easy", "likes": 74, "dislikes": 43, "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": 19942, "totalSubmissionRaw": 24237}, "1566": {"acRate": 43.251066836998184, "difficulty": "Easy", "likes": 629, "dislikes": 125, "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": 31825, "totalSubmissionRaw": 73582}, "1567": {"acRate": 44.12278851080503, "difficulty": "Medium", "likes": 2309, "dislikes": 61, "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": 87837, "totalSubmissionRaw": 199074}, "1568": {"acRate": 45.39925373134328, "difficulty": "Hard", "likes": 642, "dislikes": 145, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12167, "totalSubmissionRaw": 26800}, "1569": {"acRate": 53.6137870445096, "difficulty": "Hard", "likes": 1731, "dislikes": 197, "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": 52482, "totalSubmissionRaw": 97889}, "1570": {"acRate": 90.17820796960514, "difficulty": "Medium", "likes": 1120, "dislikes": 142, "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": 199370, "totalSubmissionRaw": 221085}, "1571": {"acRate": 87.9854028258632, "difficulty": "Easy", "likes": 151, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37612, "totalSubmissionRaw": 42748}, "1572": {"acRate": 82.67197564754166, "difficulty": "Easy", "likes": 3255, "dislikes": 45, "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": 304174, "totalSubmissionRaw": 367929}, "1573": {"acRate": 32.47832459692445, "difficulty": "Medium", "likes": 695, "dislikes": 75, "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": 26147, "totalSubmissionRaw": 80506}, "1574": {"acRate": 37.53911594575922, "difficulty": "Medium", "likes": 1522, "dislikes": 56, "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": 27711, "totalSubmissionRaw": 73819}, "1575": {"acRate": 65.88135248110575, "difficulty": "Hard", "likes": 1569, "dislikes": 57, "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": 55005, "totalSubmissionRaw": 83491}, "1576": {"acRate": 47.20167351311228, "difficulty": "Easy", "likes": 538, "dislikes": 169, "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": 55959, "totalSubmissionRaw": 118553}, "1577": {"acRate": 40.56453639333277, "difficulty": "Medium", "likes": 352, "dislikes": 52, "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": 19372, "totalSubmissionRaw": 47756}, "1578": {"acRate": 63.01730840050739, "difficulty": "Medium", "likes": 2919, "dislikes": 87, "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": 154008, "totalSubmissionRaw": 244390}, "1579": {"acRate": 64.57098866234313, "difficulty": "Hard", "likes": 1943, "dislikes": 28, "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": 55358, "totalSubmissionRaw": 85732}, "1580": {"acRate": 63.68436934218467, "difficulty": "Medium", "likes": 163, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 4221, "totalSubmissionRaw": 6628}, "1581": {"acRate": 75.57792592309602, "difficulty": "Easy", "likes": 1318, "dislikes": 177, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 197825, "totalSubmissionRaw": 261748}, "1582": {"acRate": 65.09881250996825, "difficulty": "Easy", "likes": 702, "dislikes": 25, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44897, "totalSubmissionRaw": 68968}, "1583": {"acRate": 61.3769623605069, "difficulty": "Medium", "likes": 265, "dislikes": 814, "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": 25960, "totalSubmissionRaw": 42296}, "1584": {"acRate": 66.50231610000249, "difficulty": "Medium", "likes": 4711, "dislikes": 111, "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": 240755, "totalSubmissionRaw": 362026}, "1585": {"acRate": 48.07140580172139, "difficulty": "Hard", "likes": 425, "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": 7540, "totalSubmissionRaw": 15685}, "1586": {"acRate": 70.51970849513272, "difficulty": "Medium", "likes": 253, "dislikes": 32, "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": 13257, "totalSubmissionRaw": 18799}, "1587": {"acRate": 84.18280649104153, "difficulty": "Easy", "likes": 427, "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": 84714, "totalSubmissionRaw": 100631}, "1588": {"acRate": 83.19216304342697, "difficulty": "Easy", "likes": 3517, "dislikes": 272, "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": 176299, "totalSubmissionRaw": 211918}, "1589": {"acRate": 37.44447514399269, "difficulty": "Medium", "likes": 722, "dislikes": 35, "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": 17618, "totalSubmissionRaw": 47051}, "1590": {"acRate": 28.59796693089642, "difficulty": "Medium", "likes": 1431, "dislikes": 55, "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": 24785, "totalSubmissionRaw": 86667}, "1591": {"acRate": 58.86592411698136, "difficulty": "Hard", "likes": 589, "dislikes": 18, "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": 9883, "totalSubmissionRaw": 16789}, "1592": {"acRate": 43.32417513170166, "difficulty": "Easy", "likes": 427, "dislikes": 333, "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": 51564, "totalSubmissionRaw": 119019}, "1593": {"acRate": 55.77487700365021, "difficulty": "Medium", "likes": 798, "dislikes": 30, "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": 28115, "totalSubmissionRaw": 50408}, "1594": {"acRate": 33.25135710643913, "difficulty": "Medium", "likes": 789, "dislikes": 39, "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": 22174, "totalSubmissionRaw": 66686}, "1595": {"acRate": 47.5351506456241, "difficulty": "Hard", "likes": 447, "dislikes": 13, "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": 8283, "totalSubmissionRaw": 17425}, "1596": {"acRate": 79.81770473691479, "difficulty": "Medium", "likes": 230, "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": 28898, "totalSubmissionRaw": 36205}, "1597": {"acRate": 62.62692269025837, "difficulty": "Hard", "likes": 261, "dislikes": 44, "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": 12459, "totalSubmissionRaw": 19894}, "1598": {"acRate": 64.64119977911044, "difficulty": "Easy", "likes": 874, "dislikes": 60, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 66722, "totalSubmissionRaw": 103219}, "1599": {"acRate": 43.64010831839506, "difficulty": "Medium", "likes": 102, "dislikes": 238, "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": 11442, "totalSubmissionRaw": 26219}, "1600": {"acRate": 63.97240439485563, "difficulty": "Medium", "likes": 248, "dislikes": 289, "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": 15022, "totalSubmissionRaw": 23482}, "1601": {"acRate": 64.95273258911425, "difficulty": "Hard", "likes": 1357, "dislikes": 70, "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": 52424, "totalSubmissionRaw": 80711}, "1602": {"acRate": 75.46497687960267, "difficulty": "Medium", "likes": 319, "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": 22032, "totalSubmissionRaw": 29195}, "1603": {"acRate": 88.1965240364333, "difficulty": "Easy", "likes": 1850, "dislikes": 434, "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": 255050, "totalSubmissionRaw": 289184}, "1604": {"acRate": 45.85840607961127, "difficulty": "Medium", "likes": 288, "dislikes": 401, "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": 32464, "totalSubmissionRaw": 70792}, "1605": {"acRate": 77.600887010732, "difficulty": "Medium", "likes": 1357, "dislikes": 38, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 37094, "totalSubmissionRaw": 47801}, "1606": {"acRate": 43.25890374879284, "difficulty": "Hard", "likes": 563, "dislikes": 24, "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": 14782, "totalSubmissionRaw": 34171}, "1607": {"acRate": 54.17947258584709, "difficulty": "Easy", "likes": 120, "dislikes": 13, "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": 28558, "totalSubmissionRaw": 52710}, "1608": {"acRate": 59.9923570400605, "difficulty": "Easy", "likes": 1516, "dislikes": 251, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 73784, "totalSubmissionRaw": 122989}, "1609": {"acRate": 55.25542698241838, "difficulty": "Medium", "likes": 1132, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49279, "totalSubmissionRaw": 89184}, "1610": {"acRate": 37.3475550360413, "difficulty": "Hard", "likes": 543, "dislikes": 724, "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": 38341, "totalSubmissionRaw": 102660}, "1611": {"acRate": 63.546599946385484, "difficulty": "Hard", "likes": 434, "dislikes": 357, "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": 14223, "totalSubmissionRaw": 22382}, "1612": {"acRate": 70.35560683939998, "difficulty": "Medium", "likes": 133, "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": "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": 6707, "totalSubmissionRaw": 9533}, "1613": {"acRate": 73.7199421838728, "difficulty": "Medium", "likes": 217, "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": 16831, "totalSubmissionRaw": 22831}, "1614": {"acRate": 81.56342106220727, "difficulty": "Easy", "likes": 1739, "dislikes": 265, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 156906, "totalSubmissionRaw": 192373}, "1615": {"acRate": 65.22587130361724, "difficulty": "Medium", "likes": 2246, "dislikes": 341, "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": 130424, "totalSubmissionRaw": 199958}, "1616": {"acRate": 31.000823895770203, "difficulty": "Medium", "likes": 695, "dislikes": 237, "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": 22200, "totalSubmissionRaw": 71611}, "1617": {"acRate": 65.57436342592592, "difficulty": "Hard", "likes": 503, "dislikes": 37, "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": 9065, "totalSubmissionRaw": 13824}, "1618": {"acRate": 60.458876861874366, "difficulty": "Medium", "likes": 106, "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": 6535, "totalSubmissionRaw": 10809}, "1619": {"acRate": 66.93475852180147, "difficulty": "Easy", "likes": 450, "dislikes": 121, "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": 51348, "totalSubmissionRaw": 76714}, "1620": {"acRate": 37.541029728969335, "difficulty": "Medium", "likes": 76, "dislikes": 256, "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": 8006, "totalSubmissionRaw": 21326}, "1621": {"acRate": 42.80836534357661, "difficulty": "Medium", "likes": 438, "dislikes": 45, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9027, "totalSubmissionRaw": 21087}, "1622": {"acRate": 16.657636878686088, "difficulty": "Hard", "likes": 357, "dislikes": 131, "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": 10761, "totalSubmissionRaw": 64596}, "1623": {"acRate": 84.48646125116713, "difficulty": "Easy", "likes": 69, "dislikes": 130, "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": 18097, "totalSubmissionRaw": 21420}, "1624": {"acRate": 59.053430079155675, "difficulty": "Easy", "likes": 603, "dislikes": 35, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 46553, "totalSubmissionRaw": 78832}, "1625": {"acRate": 65.94124582432698, "difficulty": "Medium", "likes": 329, "dislikes": 265, "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": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13423, "totalSubmissionRaw": 20356}, "1626": {"acRate": 50.59936990993111, "difficulty": "Medium", "likes": 2837, "dislikes": 89, "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": 77414, "totalSubmissionRaw": 152994}, "1627": {"acRate": 46.70065897367087, "difficulty": "Hard", "likes": 548, "dislikes": 30, "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": 15662, "totalSubmissionRaw": 33537}, "1628": {"acRate": 82.86383427892862, "difficulty": "Medium", "likes": 516, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"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": 25121, "totalSubmissionRaw": 30316}, "1629": {"acRate": 59.08381314743302, "difficulty": "Easy", "likes": 734, "dislikes": 101, "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": 93483, "totalSubmissionRaw": 158221}, "1630": {"acRate": 80.94060788914963, "difficulty": "Medium", "likes": 1141, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57947, "totalSubmissionRaw": 71592}, "1631": {"acRate": 59.364856471604874, "difficulty": "Medium", "likes": 5445, "dislikes": 184, "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": 219834, "totalSubmissionRaw": 370310}, "1632": {"acRate": 40.919880150978635, "difficulty": "Hard", "likes": 832, "dislikes": 53, "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": 21032, "totalSubmissionRaw": 51398}, "1633": {"acRate": 57.097588868769655, "difficulty": "Easy", "likes": 416, "dislikes": 41, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 71891, "totalSubmissionRaw": 125863}, "1634": {"acRate": 55.00811500115928, "difficulty": "Medium", "likes": 135, "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": 9490, "totalSubmissionRaw": 17252}, "1635": {"acRate": 48.48124669836239, "difficulty": "Hard", "likes": 99, "dislikes": 34, "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": 7342, "totalSubmissionRaw": 15144}, "1636": {"acRate": 70.50062545606171, "difficulty": "Easy", "likes": 2659, "dislikes": 99, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 108210, "totalSubmissionRaw": 153488}, "1637": {"acRate": 84.4802908978376, "difficulty": "Medium", "likes": 318, "dislikes": 717, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43678, "totalSubmissionRaw": 51702}, "1638": {"acRate": 71.15867353679482, "difficulty": "Medium", "likes": 1085, "dislikes": 330, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26930, "totalSubmissionRaw": 37845}, "1639": {"acRate": 52.54178029508426, "difficulty": "Hard", "likes": 1488, "dislikes": 79, "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": 52596, "totalSubmissionRaw": 100105}, "1640": {"acRate": 56.36630789608923, "difficulty": "Easy", "likes": 863, "dislikes": 133, "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": 77872, "totalSubmissionRaw": 138155}, "1641": {"acRate": 77.92247178620005, "difficulty": "Medium", "likes": 3712, "dislikes": 78, "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": 169577, "totalSubmissionRaw": 217623}, "1642": {"acRate": 48.40898596695509, "difficulty": "Medium", "likes": 4455, "dislikes": 91, "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": 120565, "totalSubmissionRaw": 249055}, "1643": {"acRate": 47.44786411032627, "difficulty": "Hard", "likes": 511, "dislikes": 10, "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": 11285, "totalSubmissionRaw": 23784}, "1644": {"acRate": 61.71780437664508, "difficulty": "Medium", "likes": 584, "dislikes": 31, "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": 64245, "totalSubmissionRaw": 104096}, "1645": {"acRate": 38.54542975938927, "difficulty": "Hard", "likes": 58, "dislikes": 15, "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": 5655, "totalSubmissionRaw": 14671}, "1646": {"acRate": 50.19011024382392, "difficulty": "Easy", "likes": 716, "dislikes": 902, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99794, "totalSubmissionRaw": 198832}, "1647": {"acRate": 61.20084788931429, "difficulty": "Medium", "likes": 4794, "dislikes": 72, "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": 260715, "totalSubmissionRaw": 425999}, "1648": {"acRate": 30.12688500631103, "difficulty": "Medium", "likes": 1044, "dislikes": 373, "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": 36280, "totalSubmissionRaw": 120423}, "1649": {"acRate": 38.069777404052104, "difficulty": "Hard", "likes": 617, "dislikes": 74, "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": 23995, "totalSubmissionRaw": 63029}, "1650": {"acRate": 77.92037716081718, "difficulty": "Medium", "likes": 1211, "dislikes": 42, "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": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 172532, "totalSubmissionRaw": 221419}, "1651": {"acRate": 66.7427788560338, "difficulty": "Hard", "likes": 30, "dislikes": 60, "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": 5846, "totalSubmissionRaw": 8759}, "1652": {"acRate": 63.35641399416909, "difficulty": "Easy", "likes": 684, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34770, "totalSubmissionRaw": 54880}, "1653": {"acRate": 58.85866369572618, "difficulty": "Medium", "likes": 1244, "dislikes": 35, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38038, "totalSubmissionRaw": 64626}, "1654": {"acRate": 29.293689718400145, "difficulty": "Medium", "likes": 1418, "dislikes": 256, "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": 39301, "totalSubmissionRaw": 134162}, "1655": {"acRate": 39.297084318360916, "difficulty": "Hard", "likes": 383, "dislikes": 20, "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": 12467, "totalSubmissionRaw": 31725}, "1656": {"acRate": 84.56269522534583, "difficulty": "Easy", "likes": 476, "dislikes": 3242, "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": 75801, "totalSubmissionRaw": 89639}, "1657": {"acRate": 53.986338279653765, "difficulty": "Medium", "likes": 2655, "dislikes": 145, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150868, "totalSubmissionRaw": 279460}, "1658": {"acRate": 39.75569502295973, "difficulty": "Medium", "likes": 5243, "dislikes": 110, "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": 177049, "totalSubmissionRaw": 445344}, "1659": {"acRate": 39.25440328568043, "difficulty": "Hard", "likes": 320, "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": 4969, "totalSubmissionRaw": 12660}, "1660": {"acRate": 72.4215676868464, "difficulty": "Medium", "likes": 227, "dislikes": 36, "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": 15097, "totalSubmissionRaw": 20846}, "1661": {"acRate": 68.10676234760005, "difficulty": "Easy", "likes": 784, "dislikes": 66, "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": 93008, "totalSubmissionRaw": 136560}, "1662": {"acRate": 83.83174786227853, "difficulty": "Easy", "likes": 2330, "dislikes": 178, "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": 306763, "totalSubmissionRaw": 365927}, "1663": {"acRate": 66.73232412653446, "difficulty": "Medium", "likes": 1825, "dislikes": 58, "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": 90456, "totalSubmissionRaw": 135551}, "1664": {"acRate": 63.317239420619146, "difficulty": "Medium", "likes": 1241, "dislikes": 35, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33441, "totalSubmissionRaw": 52815}, "1665": {"acRate": 57.01410088675679, "difficulty": "Hard", "likes": 546, "dislikes": 34, "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": 15688, "totalSubmissionRaw": 27516}, "1666": {"acRate": 73.05135951661632, "difficulty": "Medium", "likes": 57, "dislikes": 158, "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": 3627, "totalSubmissionRaw": 4965}, "1667": {"acRate": 63.18247770586414, "difficulty": "Easy", "likes": 757, "dislikes": 90, "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": 155019, "totalSubmissionRaw": 245351}, "1668": {"acRate": 38.73107821168919, "difficulty": "Easy", "likes": 624, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39582, "totalSubmissionRaw": 102197}, "1669": {"acRate": 72.97656065317403, "difficulty": "Medium", "likes": 1442, "dislikes": 181, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 80264, "totalSubmissionRaw": 109986}, "1670": {"acRate": 56.514398497134565, "difficulty": "Medium", "likes": 703, "dislikes": 95, "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": 23766, "totalSubmissionRaw": 42053}, "1671": {"acRate": 41.65800955744858, "difficulty": "Hard", "likes": 1491, "dislikes": 20, "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": 26065, "totalSubmissionRaw": 62569}, "1672": {"acRate": 87.52514992699683, "difficulty": "Easy", "likes": 3978, "dislikes": 348, "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": 719952, "totalSubmissionRaw": 822566}, "1673": {"acRate": 49.65732196020569, "difficulty": "Medium", "likes": 1925, "dislikes": 91, "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": 56877, "totalSubmissionRaw": 114539}, "1674": {"acRate": 38.87162555836085, "difficulty": "Medium", "likes": 614, "dislikes": 71, "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": 8006, "totalSubmissionRaw": 20596}, "1675": {"acRate": 54.29143511441229, "difficulty": "Hard", "likes": 2971, "dislikes": 165, "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": 90563, "totalSubmissionRaw": 166809}, "1676": {"acRate": 78.87496466597568, "difficulty": "Medium", "likes": 420, "dislikes": 13, "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": "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": 33479, "totalSubmissionRaw": 42446}, "1677": {"acRate": 38.023048768424175, "difficulty": "Easy", "likes": 35, "dislikes": 131, "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": 15375, "totalSubmissionRaw": 40436}, "1678": {"acRate": 86.79413786149648, "difficulty": "Easy", "likes": 1461, "dislikes": 85, "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": 210891, "totalSubmissionRaw": 242979}, "1679": {"acRate": 55.576848793721425, "difficulty": "Medium", "likes": 2733, "dislikes": 61, "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": 185597, "totalSubmissionRaw": 333947}, "1680": {"acRate": 57.02087408627613, "difficulty": "Medium", "likes": 1398, "dislikes": 434, "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": 88615, "totalSubmissionRaw": 155408}, "1681": {"acRate": 38.72293504410585, "difficulty": "Hard", "likes": 263, "dislikes": 92, "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": 7726, "totalSubmissionRaw": 19952}, "1682": {"acRate": 49.99501445807159, "difficulty": "Medium", "likes": 144, "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": 5014, "totalSubmissionRaw": 10029}, "1683": {"acRate": 84.750635544257, "difficulty": "Easy", "likes": 614, "dislikes": 198, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183351, "totalSubmissionRaw": 216342}, "1684": {"acRate": 82.56047099336277, "difficulty": "Easy", "likes": 1599, "dislikes": 62, "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": 148646, "totalSubmissionRaw": 180045}, "1685": {"acRate": 62.623966942148755, "difficulty": "Medium", "likes": 1131, "dislikes": 32, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30310, "totalSubmissionRaw": 48399}, "1686": {"acRate": 56.09503095198261, "difficulty": "Medium", "likes": 768, "dislikes": 63, "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": 16764, "totalSubmissionRaw": 29885}, "1687": {"acRate": 38.771171912500854, "difficulty": "Hard", "likes": 354, "dislikes": 27, "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": 5654, "totalSubmissionRaw": 14583}, "1688": {"acRate": 83.01766683891647, "difficulty": "Easy", "likes": 1021, "dislikes": 164, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 110851, "totalSubmissionRaw": 133527}, "1689": {"acRate": 88.85083341488078, "difficulty": "Medium", "likes": 2301, "dislikes": 1429, "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": 190673, "totalSubmissionRaw": 214599}, "1690": {"acRate": 57.97379635825731, "difficulty": "Medium", "likes": 944, "dislikes": 159, "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": 32921, "totalSubmissionRaw": 56786}, "1691": {"acRate": 55.93065242122965, "difficulty": "Hard", "likes": 1048, "dislikes": 28, "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": 22615, "totalSubmissionRaw": 40434}, "1692": {"acRate": 62.618853572398805, "difficulty": "Hard", "likes": 71, "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": 2305, "totalSubmissionRaw": 3681}, "1693": {"acRate": 86.8892529546271, "difficulty": "Easy", "likes": 491, "dislikes": 29, "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": 99178, "totalSubmissionRaw": 114143}, "1694": {"acRate": 65.19773574699099, "difficulty": "Easy", "likes": 319, "dislikes": 194, "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": 33746, "totalSubmissionRaw": 51759}, "1695": {"acRate": 57.68442318547788, "difficulty": "Medium", "likes": 2693, "dislikes": 44, "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": 116496, "totalSubmissionRaw": 201954}, "1696": {"acRate": 45.77415693179482, "difficulty": "Medium", "likes": 3309, "dislikes": 108, "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": 102427, "totalSubmissionRaw": 223765}, "1697": {"acRate": 62.62884580256256, "difficulty": "Hard", "likes": 1873, "dislikes": 44, "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": 48000, "totalSubmissionRaw": 76642}, "1698": {"acRate": 63.1935047361299, "difficulty": "Medium", "likes": 180, "dislikes": 42, "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": 8873, "totalSubmissionRaw": 14041}, "1699": {"acRate": 81.5084404522224, "difficulty": "Medium", "likes": 274, "dislikes": 13, "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": 36841, "totalSubmissionRaw": 45199}, "1700": {"acRate": 70.07770574850814, "difficulty": "Easy", "likes": 1537, "dislikes": 104, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81616, "totalSubmissionRaw": 116465}, "1701": {"acRate": 62.98815165876778, "difficulty": "Medium", "likes": 484, "dislikes": 50, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 26581, "totalSubmissionRaw": 42200}, "1702": {"acRate": 46.42701783525132, "difficulty": "Medium", "likes": 469, "dislikes": 49, "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": 11740, "totalSubmissionRaw": 25287}, "1703": {"acRate": 42.545015861668375, "difficulty": "Hard", "likes": 670, "dislikes": 23, "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": 9522, "totalSubmissionRaw": 22381}, "1704": {"acRate": 77.46363196125908, "difficulty": "Easy", "likes": 1768, "dislikes": 82, "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": 199952, "totalSubmissionRaw": 258124}, "1705": {"acRate": 38.468586387434556, "difficulty": "Medium", "likes": 774, "dislikes": 176, "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": 20573, "totalSubmissionRaw": 53480}, "1706": {"acRate": 71.61949561438125, "difficulty": "Medium", "likes": 3013, "dislikes": 175, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136115, "totalSubmissionRaw": 190053}, "1707": {"acRate": 48.01297434139395, "difficulty": "Hard", "likes": 1113, "dislikes": 35, "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": 18207, "totalSubmissionRaw": 37921}, "1708": {"acRate": 64.09744740999417, "difficulty": "Easy", "likes": 91, "dislikes": 110, "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": 7709, "totalSubmissionRaw": 12027}, "1709": {"acRate": 72.5180128934395, "difficulty": "Medium", "likes": 188, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19123, "totalSubmissionRaw": 26370}, "1710": {"acRate": 73.63866549466697, "difficulty": "Easy", "likes": 3668, "dislikes": 206, "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": 280648, "totalSubmissionRaw": 381115}, "1711": {"acRate": 29.704262350648253, "difficulty": "Medium", "likes": 968, "dislikes": 230, "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": 35054, "totalSubmissionRaw": 118010}, "1712": {"acRate": 32.759405339805824, "difficulty": "Medium", "likes": 1325, "dislikes": 98, "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": 30233, "totalSubmissionRaw": 92288}, "1713": {"acRate": 48.22605525171785, "difficulty": "Hard", "likes": 648, "dislikes": 10, "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": 10317, "totalSubmissionRaw": 21393}, "1714": {"acRate": 48.98688915375447, "difficulty": "Hard", "likes": 28, "dislikes": 23, "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": 1233, "totalSubmissionRaw": 2517}, "1715": {"acRate": 75.68207440811724, "difficulty": "Medium", "likes": 76, "dislikes": 19, "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": 13426, "totalSubmissionRaw": 17740}, "1716": {"acRate": 66.93403028118242, "difficulty": "Easy", "likes": 634, "dislikes": 17, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44562, "totalSubmissionRaw": 66576}, "1717": {"acRate": 46.658342871015854, "difficulty": "Medium", "likes": 598, "dislikes": 34, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 13453, "totalSubmissionRaw": 28833}, "1718": {"acRate": 52.90959473501905, "difficulty": "Medium", "likes": 529, "dislikes": 48, "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": 12220, "totalSubmissionRaw": 23096}, "1719": {"acRate": 43.910980569362856, "difficulty": "Hard", "likes": 202, "dislikes": 143, "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": 3887, "totalSubmissionRaw": 8852}, "1720": {"acRate": 85.86639246384503, "difficulty": "Easy", "likes": 1480, "dislikes": 206, "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": 129435, "totalSubmissionRaw": 150740}, "1721": {"acRate": 68.31237445812756, "difficulty": "Medium", "likes": 5067, "dislikes": 164, "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": 298937, "totalSubmissionRaw": 437603}, "1722": {"acRate": 48.71704435234988, "difficulty": "Medium", "likes": 797, "dislikes": 25, "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": 16575, "totalSubmissionRaw": 34023}, "1723": {"acRate": 42.308093631525864, "difficulty": "Hard", "likes": 990, "dislikes": 29, "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": 24328, "totalSubmissionRaw": 57502}, "1724": {"acRate": 52.29339659944642, "difficulty": "Hard", "likes": 96, "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": 2645, "totalSubmissionRaw": 5058}, "1725": {"acRate": 78.56675721903612, "difficulty": "Easy", "likes": 542, "dislikes": 62, "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": 62470, "totalSubmissionRaw": 79512}, "1726": {"acRate": 60.88657105606258, "difficulty": "Medium", "likes": 599, "dislikes": 26, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25218, "totalSubmissionRaw": 41418}, "1727": {"acRate": 61.87995556747232, "difficulty": "Medium", "likes": 973, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 16155, "totalSubmissionRaw": 26107}, "1728": {"acRate": 39.268337747120775, "difficulty": "Hard", "likes": 255, "dislikes": 39, "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": 6376, "totalSubmissionRaw": 16237}, "1729": {"acRate": 69.1266945077529, "difficulty": "Easy", "likes": 443, "dislikes": 27, "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": 104942, "totalSubmissionRaw": 151812}, "1730": {"acRate": 54.34629914383887, "difficulty": "Medium", "likes": 639, "dislikes": 39, "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": 57256, "totalSubmissionRaw": 105354}, "1731": {"acRate": 44.849034711983876, "difficulty": "Easy", "likes": 314, "dislikes": 49, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51409, "totalSubmissionRaw": 114628}, "1732": {"acRate": 82.45991181696536, "difficulty": "Easy", "likes": 2569, "dislikes": 235, "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": 263134, "totalSubmissionRaw": 319106}, "1733": {"acRate": 41.84777165748623, "difficulty": "Medium", "likes": 194, "dislikes": 380, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8357, "totalSubmissionRaw": 19970}, "1734": {"acRate": 63.79545561462107, "difficulty": "Medium", "likes": 724, "dislikes": 24, "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": 13561, "totalSubmissionRaw": 21257}, "1735": {"acRate": 50.58765432098765, "difficulty": "Hard", "likes": 265, "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": 5122, "totalSubmissionRaw": 10125}, "1736": {"acRate": 42.370093259574695, "difficulty": "Easy", "likes": 329, "dislikes": 175, "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": 31939, "totalSubmissionRaw": 75381}, "1737": {"acRate": 35.759668107574925, "difficulty": "Medium", "likes": 306, "dislikes": 321, "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": 12326, "totalSubmissionRaw": 34469}, "1738": {"acRate": 61.320152091254755, "difficulty": "Medium", "likes": 481, "dislikes": 73, "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": "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": 20159, "totalSubmissionRaw": 32875}, "1739": {"acRate": 52.235690776270374, "difficulty": "Hard", "likes": 285, "dislikes": 43, "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": 6507, "totalSubmissionRaw": 12457}, "1740": {"acRate": 69.73178738562548, "difficulty": "Medium", "likes": 386, "dislikes": 14, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 19967, "totalSubmissionRaw": 28634}, "1741": {"acRate": 87.49929294643363, "difficulty": "Easy", "likes": 645, "dislikes": 16, "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": 108282, "totalSubmissionRaw": 123752}, "1742": {"acRate": 73.4023512445114, "difficulty": "Easy", "likes": 573, "dislikes": 145, "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": 57005, "totalSubmissionRaw": 77661}, "1743": {"acRate": 69.05272181740249, "difficulty": "Medium", "likes": 1001, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38664, "totalSubmissionRaw": 55992}, "1744": {"acRate": 33.54075917859365, "difficulty": "Medium", "likes": 120, "dislikes": 313, "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": 9702, "totalSubmissionRaw": 28926}, "1745": {"acRate": 44.40922132380972, "difficulty": "Hard", "likes": 864, "dislikes": 25, "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": 22134, "totalSubmissionRaw": 49841}, "1746": {"acRate": 62.23841824217059, "difficulty": "Medium", "likes": 266, "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": 8625, "totalSubmissionRaw": 13858}, "1747": {"acRate": 65.9894092462538, "difficulty": "Medium", "likes": 168, "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": 17571, "totalSubmissionRaw": 26627}, "1748": {"acRate": 76.71301480476949, "difficulty": "Easy", "likes": 1398, "dislikes": 34, "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": 136328, "totalSubmissionRaw": 177712}, "1749": {"acRate": 59.08468308050543, "difficulty": "Medium", "likes": 1188, "dislikes": 18, "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": 34509, "totalSubmissionRaw": 58406}, "1750": {"acRate": 44.51280974380513, "difficulty": "Medium", "likes": 449, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21197, "totalSubmissionRaw": 47620}, "1751": {"acRate": 62.952840348606756, "difficulty": "Hard", "likes": 1957, "dislikes": 36, "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": 69561, "totalSubmissionRaw": 110497}, "1752": {"acRate": 50.681242307970756, "difficulty": "Easy", "likes": 2560, "dislikes": 104, "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": 140012, "totalSubmissionRaw": 276260}, "1753": {"acRate": 67.49062815170025, "difficulty": "Medium", "likes": 886, "dislikes": 53, "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": 35467, "totalSubmissionRaw": 52551}, "1754": {"acRate": 46.86106506665422, "difficulty": "Medium", "likes": 511, "dislikes": 70, "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": 20072, "totalSubmissionRaw": 42833}, "1755": {"acRate": 37.95471757240227, "difficulty": "Hard", "likes": 819, "dislikes": 62, "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": 14534, "totalSubmissionRaw": 38293}, "1756": {"acRate": 76.95630399399023, "difficulty": "Medium", "likes": 255, "dislikes": 20, "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": 12293, "totalSubmissionRaw": 15974}, "1757": {"acRate": 89.72288023710513, "difficulty": "Easy", "likes": 1632, "dislikes": 91, "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": 571547, "totalSubmissionRaw": 637014}, "1758": {"acRate": 58.04497741974857, "difficulty": "Easy", "likes": 573, "dislikes": 21, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38045, "totalSubmissionRaw": 65544}, "1759": {"acRate": 49.04315528829147, "difficulty": "Medium", "likes": 669, "dislikes": 43, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 27729, "totalSubmissionRaw": 56540}, "1760": {"acRate": 60.43003354261632, "difficulty": "Medium", "likes": 1908, "dislikes": 44, "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": 35131, "totalSubmissionRaw": 58135}, "1761": {"acRate": 41.91684762037572, "difficulty": "Hard", "likes": 307, "dislikes": 277, "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": 21041, "totalSubmissionRaw": 50197}, "1762": {"acRate": 79.07722736491235, "difficulty": "Medium", "likes": 1089, "dislikes": 137, "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": 157524, "totalSubmissionRaw": 199203}, "1763": {"acRate": 60.611527999890654, "difficulty": "Easy", "likes": 1206, "dislikes": 809, "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": 44343, "totalSubmissionRaw": 73160}, "1764": {"acRate": 53.22917472348983, "difficulty": "Medium", "likes": 308, "dislikes": 35, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13764, "totalSubmissionRaw": 25858}, "1765": {"acRate": 61.013128232329926, "difficulty": "Medium", "likes": 755, "dislikes": 45, "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": 23005, "totalSubmissionRaw": 37705}, "1766": {"acRate": 39.78364804172502, "difficulty": "Hard", "likes": 381, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"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": 8238, "totalSubmissionRaw": 20707}, "1767": {"acRate": 78.55353535353535, "difficulty": "Hard", "likes": 155, "dislikes": 12, "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": 9721, "totalSubmissionRaw": 12375}, "1768": {"acRate": 79.19090966388445, "difficulty": "Easy", "likes": 3066, "dislikes": 55, "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": false, "totalAcceptedRaw": 439745, "totalSubmissionRaw": 555301}, "1769": {"acRate": 85.48286271879002, "difficulty": "Medium", "likes": 2132, "dislikes": 82, "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": 112133, "totalSubmissionRaw": 131176}, "1770": {"acRate": 38.78023319184212, "difficulty": "Hard", "likes": 2451, "dislikes": 507, "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": 101045, "totalSubmissionRaw": 260558}, "1771": {"acRate": 35.455027389998236, "difficulty": "Hard", "likes": 523, "dislikes": 12, "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": 10032, "totalSubmissionRaw": 28295}, "1772": {"acRate": 65.21687178874419, "difficulty": "Medium", "likes": 79, "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": 5458, "totalSubmissionRaw": 8369}, "1773": {"acRate": 84.5153577340445, "difficulty": "Easy", "likes": 1741, "dislikes": 180, "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": 183804, "totalSubmissionRaw": 217480}, "1774": {"acRate": 47.4053876818472, "difficulty": "Medium", "likes": 665, "dislikes": 80, "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": 27470, "totalSubmissionRaw": 57947}, "1775": {"acRate": 53.28218758809553, "difficulty": "Medium", "likes": 857, "dislikes": 37, "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": 26461, "totalSubmissionRaw": 49662}, "1776": {"acRate": 54.106280193236714, "difficulty": "Hard", "likes": 829, "dislikes": 27, "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": 23408, "totalSubmissionRaw": 43263}, "1777": {"acRate": 82.59079681639375, "difficulty": "Easy", "likes": 123, "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": 18056, "totalSubmissionRaw": 21862}, "1778": {"acRate": 39.09965799729579, "difficulty": "Medium", "likes": 149, "dislikes": 60, "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": 4916, "totalSubmissionRaw": 12573}, "1779": {"acRate": 67.62969484327866, "difficulty": "Easy", "likes": 793, "dislikes": 169, "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": 104473, "totalSubmissionRaw": 154478}, "1780": {"acRate": 66.70584130598453, "difficulty": "Medium", "likes": 915, "dislikes": 30, "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": 36326, "totalSubmissionRaw": 54457}, "1781": {"acRate": 63.615202550711025, "difficulty": "Medium", "likes": 899, "dislikes": 150, "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": 32522, "totalSubmissionRaw": 51123}, "1782": {"acRate": 39.65617904638339, "difficulty": "Hard", "likes": 299, "dislikes": 158, "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": 6113, "totalSubmissionRaw": 15415}, "1783": {"acRate": 84.94149086933635, "difficulty": "Medium", "likes": 216, "dislikes": 6, "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": 20978, "totalSubmissionRaw": 24697}, "1784": {"acRate": 39.5237334185712, "difficulty": "Easy", "likes": 303, "dislikes": 906, "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": 37095, "totalSubmissionRaw": 93855}, "1785": {"acRate": 42.89940828402367, "difficulty": "Medium", "likes": 246, "dislikes": 189, "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": 19285, "totalSubmissionRaw": 44954}, "1786": {"acRate": 38.961328844329536, "difficulty": "Medium", "likes": 992, "dislikes": 185, "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": 20946, "totalSubmissionRaw": 53761}, "1787": {"acRate": 39.562525794469664, "difficulty": "Hard", "likes": 378, "dislikes": 21, "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": 4793, "totalSubmissionRaw": 12115}, "1788": {"acRate": 67.06161137440758, "difficulty": "Hard", "likes": 72, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1981, "totalSubmissionRaw": 2954}, "1789": {"acRate": 65.7668080730171, "difficulty": "Easy", "likes": 290, "dislikes": 120, "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": 46043, "totalSubmissionRaw": 70010}, "1790": {"acRate": 45.3470379658419, "difficulty": "Easy", "likes": 1009, "dislikes": 54, "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": 93487, "totalSubmissionRaw": 206159}, "1791": {"acRate": 83.48999465746975, "difficulty": "Easy", "likes": 1281, "dislikes": 143, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 157835, "totalSubmissionRaw": 189046}, "1792": {"acRate": 52.945511976836016, "difficulty": "Medium", "likes": 695, "dislikes": 78, "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": 20114, "totalSubmissionRaw": 37990}, "1793": {"acRate": 53.96596827225382, "difficulty": "Hard", "likes": 1030, "dislikes": 33, "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": 22486, "totalSubmissionRaw": 41667}, "1794": {"acRate": 64.75225225225225, "difficulty": "Medium", "likes": 38, "dislikes": 50, "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": 1725, "totalSubmissionRaw": 2664}, "1795": {"acRate": 85.57167343829354, "difficulty": "Easy", "likes": 772, "dislikes": 52, "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": 107834, "totalSubmissionRaw": 126016}, "1796": {"acRate": 49.6869433511461, "difficulty": "Easy", "likes": 485, "dislikes": 122, "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": 46583, "totalSubmissionRaw": 93753}, "1797": {"acRate": 56.896502252446126, "difficulty": "Medium", "likes": 323, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19829, "totalSubmissionRaw": 34851}, "1798": {"acRate": 57.034453684896334, "difficulty": "Medium", "likes": 714, "dislikes": 52, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14882, "totalSubmissionRaw": 26093}, "1799": {"acRate": 58.23874433750038, "difficulty": "Hard", "likes": 1567, "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": 56696, "totalSubmissionRaw": 97345}, "1800": {"acRate": 62.53727829226181, "difficulty": "Easy", "likes": 676, "dislikes": 23, "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": 47811, "totalSubmissionRaw": 76452}, "1801": {"acRate": 48.96076409616324, "difficulty": "Medium", "likes": 273, "dislikes": 226, "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": 18044, "totalSubmissionRaw": 36854}, "1802": {"acRate": 39.73175363374697, "difficulty": "Medium", "likes": 2445, "dislikes": 403, "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": 66534, "totalSubmissionRaw": 167458}, "1803": {"acRate": 47.54595531348642, "difficulty": "Hard", "likes": 486, "dislikes": 19, "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": 7682, "totalSubmissionRaw": 16157}, "1804": {"acRate": 61.532860701283774, "difficulty": "Medium", "likes": 290, "dislikes": 16, "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": 16057, "totalSubmissionRaw": 26095}, "1805": {"acRate": 37.016738394084506, "difficulty": "Easy", "likes": 575, "dislikes": 89, "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": 41200, "totalSubmissionRaw": 111301}, "1806": {"acRate": 72.22361809045226, "difficulty": "Medium", "likes": 303, "dislikes": 157, "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": 17247, "totalSubmissionRaw": 23880}, "1807": {"acRate": 66.6764821358461, "difficulty": "Medium", "likes": 459, "dislikes": 40, "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": 27172, "totalSubmissionRaw": 40752}, "1808": {"acRate": 32.01388529091757, "difficulty": "Hard", "likes": 214, "dislikes": 164, "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": 6179, "totalSubmissionRaw": 19301}, "1809": {"acRate": 58.43297934609917, "difficulty": "Easy", "likes": 81, "dislikes": 56, "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": 13976, "totalSubmissionRaw": 23918}, "1810": {"acRate": 54.82169234015615, "difficulty": "Medium", "likes": 75, "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": 2598, "totalSubmissionRaw": 4739}, "1811": {"acRate": 62.28248796741948, "difficulty": "Medium", "likes": 183, "dislikes": 23, "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": 13458, "totalSubmissionRaw": 21608}, "1812": {"acRate": 78.00137915182162, "difficulty": "Easy", "likes": 740, "dislikes": 15, "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": 67869, "totalSubmissionRaw": 87010}, "1813": {"acRate": 33.286605770100394, "difficulty": "Medium", "likes": 373, "dislikes": 59, "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": 14722, "totalSubmissionRaw": 44228}, "1814": {"acRate": 41.90939957112223, "difficulty": "Medium", "likes": 835, "dislikes": 34, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28143, "totalSubmissionRaw": 67152}, "1815": {"acRate": 40.04432207373581, "difficulty": "Hard", "likes": 327, "dislikes": 22, "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": 5963, "totalSubmissionRaw": 14891}, "1816": {"acRate": 83.96180295277516, "difficulty": "Easy", "likes": 1015, "dislikes": 28, "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": 128806, "totalSubmissionRaw": 153411}, "1817": {"acRate": 80.31952056389635, "difficulty": "Medium", "likes": 769, "dislikes": 287, "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": 51733, "totalSubmissionRaw": 64409}, "1818": {"acRate": 30.548372477406627, "difficulty": "Medium", "likes": 966, "dislikes": 69, "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": 22918, "totalSubmissionRaw": 75022}, "1819": {"acRate": 39.838512356251535, "difficulty": "Hard", "likes": 387, "dislikes": 40, "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": 8141, "totalSubmissionRaw": 20435}, "1820": {"acRate": 49.2861469239422, "difficulty": "Medium", "likes": 176, "dislikes": 53, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5696, "totalSubmissionRaw": 11557}, "1821": {"acRate": 88.56823592284894, "difficulty": "Easy", "likes": 55, "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": 18229, "totalSubmissionRaw": 20582}, "1822": {"acRate": 65.29898685061436, "difficulty": "Easy", "likes": 2050, "dislikes": 203, "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": 302922, "totalSubmissionRaw": 463900}, "1823": {"acRate": 78.11363342294808, "difficulty": "Medium", "likes": 2765, "dislikes": 55, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 108667, "totalSubmissionRaw": 139113}, "1824": {"acRate": 49.77992332812722, "difficulty": "Medium", "likes": 1112, "dislikes": 44, "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": 35060, "totalSubmissionRaw": 70430}, "1825": {"acRate": 35.84494905209687, "difficulty": "Hard", "likes": 369, "dislikes": 113, "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": 11855, "totalSubmissionRaw": 33073}, "1826": {"acRate": 49.69875656967056, "difficulty": "Easy", "likes": 58, "dislikes": 63, "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": 3877, "totalSubmissionRaw": 7801}, "1827": {"acRate": 78.72255528843756, "difficulty": "Easy", "likes": 1136, "dislikes": 53, "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": 78917, "totalSubmissionRaw": 100247}, "1828": {"acRate": 86.15478089162299, "difficulty": "Medium", "likes": 1083, "dislikes": 77, "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": 68064, "totalSubmissionRaw": 79002}, "1829": {"acRate": 77.05744037621767, "difficulty": "Medium", "likes": 719, "dislikes": 55, "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": 25234, "totalSubmissionRaw": 32747}, "1830": {"acRate": 49.56003406187908, "difficulty": "Hard", "likes": 170, "dislikes": 123, "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": 3492, "totalSubmissionRaw": 7046}, "1831": {"acRate": 81.56564283772765, "difficulty": "Medium", "likes": 77, "dislikes": 1, "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": 15004, "totalSubmissionRaw": 18395}, "1832": {"acRate": 83.10150070637701, "difficulty": "Easy", "likes": 2569, "dislikes": 50, "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": 271171, "totalSubmissionRaw": 326313}, "1833": {"acRate": 73.78899537591367, "difficulty": "Medium", "likes": 2100, "dislikes": 664, "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": 147288, "totalSubmissionRaw": 199607}, "1834": {"acRate": 45.584546759391266, "difficulty": "Medium", "likes": 2949, "dislikes": 252, "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": 94324, "totalSubmissionRaw": 206920}, "1835": {"acRate": 60.90046538475414, "difficulty": "Hard", "likes": 560, "dislikes": 46, "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": 16881, "totalSubmissionRaw": 27719}, "1836": {"acRate": 71.07269528304522, "difficulty": "Medium", "likes": 353, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25447, "totalSubmissionRaw": 35805}, "1837": {"acRate": 77.14580479307254, "difficulty": "Easy", "likes": 462, "dislikes": 38, "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": 45614, "totalSubmissionRaw": 59127}, "1838": {"acRate": 39.990761348843066, "difficulty": "Medium", "likes": 3010, "dislikes": 81, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 57138, "totalSubmissionRaw": 142872}, "1839": {"acRate": 49.022699177669885, "difficulty": "Medium", "likes": 690, "dislikes": 20, "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": 27363, "totalSubmissionRaw": 55817}, "1840": {"acRate": 36.02253459497894, "difficulty": "Hard", "likes": 348, "dislikes": 12, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6586, "totalSubmissionRaw": 18283}, "1841": {"acRate": 53.917585606500296, "difficulty": "Medium", "likes": 104, "dislikes": 95, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12077, "totalSubmissionRaw": 22399}, "1842": {"acRate": 53.021723463399574, "difficulty": "Hard", "likes": 113, "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": 5150, "totalSubmissionRaw": 9713}, "1843": {"acRate": 45.90561100881869, "difficulty": "Medium", "likes": 84, "dislikes": 55, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9474, "totalSubmissionRaw": 20638}, "1844": {"acRate": 80.53651300262975, "difficulty": "Easy", "likes": 764, "dislikes": 81, "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": 71663, "totalSubmissionRaw": 88982}, "1845": {"acRate": 67.08359354090463, "difficulty": "Medium", "likes": 657, "dislikes": 41, "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": 37597, "totalSubmissionRaw": 56045}, "1846": {"acRate": 59.231643429331704, "difficulty": "Medium", "likes": 344, "dislikes": 73, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21369, "totalSubmissionRaw": 36077}, "1847": {"acRate": 36.54375343973582, "difficulty": "Hard", "likes": 486, "dislikes": 20, "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": 7968, "totalSubmissionRaw": 21804}, "1848": {"acRate": 56.00312693589782, "difficulty": "Easy", "likes": 327, "dislikes": 58, "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": 37969, "totalSubmissionRaw": 67798}, "1849": {"acRate": 34.23597678916828, "difficulty": "Medium", "likes": 486, "dislikes": 107, "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": 22125, "totalSubmissionRaw": 64625}, "1850": {"acRate": 71.23953649888512, "difficulty": "Medium", "likes": 730, "dislikes": 92, "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": 19489, "totalSubmissionRaw": 27357}, "1851": {"acRate": 49.061047541632796, "difficulty": "Hard", "likes": 825, "dislikes": 21, "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": 23538, "totalSubmissionRaw": 47978}, "1852": {"acRate": 70.97739361702128, "difficulty": "Medium", "likes": 127, "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": 6405, "totalSubmissionRaw": 9024}, "1853": {"acRate": 86.18767886729928, "difficulty": "Easy", "likes": 57, "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": 11444, "totalSubmissionRaw": 13278}, "1854": {"acRate": 60.197238236835624, "difficulty": "Easy", "likes": 1164, "dislikes": 184, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56279, "totalSubmissionRaw": 93491}, "1855": {"acRate": 53.38123415046492, "difficulty": "Medium", "likes": 1140, "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"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45468, "totalSubmissionRaw": 85176}, "1856": {"acRate": 37.97061234785899, "difficulty": "Medium", "likes": 1346, "dislikes": 100, "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": 24084, "totalSubmissionRaw": 63428}, "1857": {"acRate": 50.94526688642391, "difficulty": "Hard", "likes": 2000, "dislikes": 65, "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": 60120, "totalSubmissionRaw": 118009}, "1858": {"acRate": 67.5143808658795, "difficulty": "Medium", "likes": 166, "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": 6690, "totalSubmissionRaw": 9909}, "1859": {"acRate": 83.17551635164997, "difficulty": "Easy", "likes": 1993, "dislikes": 66, "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": 134746, "totalSubmissionRaw": 162002}, "1860": {"acRate": 71.86987079668364, "difficulty": "Medium", "likes": 206, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17077, "totalSubmissionRaw": 23761}, "1861": {"acRate": 66.37720642488223, "difficulty": "Medium", "likes": 913, "dislikes": 49, "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": 46780, "totalSubmissionRaw": 70476}, "1862": {"acRate": 28.606164383561644, "difficulty": "Hard", "likes": 423, "dislikes": 35, "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": 8353, "totalSubmissionRaw": 29200}, "1863": {"acRate": 80.73173500145036, "difficulty": "Easy", "likes": 1502, "dislikes": 133, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64012, "totalSubmissionRaw": 79290}, "1864": {"acRate": 42.83824074237425, "difficulty": "Medium", "likes": 552, "dislikes": 34, "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": 24282, "totalSubmissionRaw": 56683}, "1865": {"acRate": 50.47033936447926, "difficulty": "Medium", "likes": 552, "dislikes": 97, "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": 22427, "totalSubmissionRaw": 44434}, "1866": {"acRate": 56.616656185428084, "difficulty": "Hard", "likes": 662, "dislikes": 20, "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": 12604, "totalSubmissionRaw": 22262}, "1867": {"acRate": 71.57007687758723, "difficulty": "Medium", "likes": 70, "dislikes": 253, "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": 14523, "totalSubmissionRaw": 20292}, "1868": {"acRate": 57.62156178148684, "difficulty": "Medium", "likes": 294, "dislikes": 48, "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": 27066, "totalSubmissionRaw": 46972}, "1869": {"acRate": 60.40070459850774, "difficulty": "Easy", "likes": 481, "dislikes": 12, "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": 42176, "totalSubmissionRaw": 69827}, "1870": {"acRate": 46.92147680681727, "difficulty": "Medium", "likes": 2210, "dislikes": 261, "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": 93385, "totalSubmissionRaw": 199024}, "1871": {"acRate": 24.811175639617016, "difficulty": "Medium", "likes": 1549, "dislikes": 86, "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": 39517, "totalSubmissionRaw": 159272}, "1872": {"acRate": 52.51847711322279, "difficulty": "Hard", "likes": 427, "dislikes": 21, "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": 8456, "totalSubmissionRaw": 16101}, "1873": {"acRate": 58.028378549073004, "difficulty": "Easy", "likes": 1013, "dislikes": 73, "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": 206728, "totalSubmissionRaw": 356253}, "1874": {"acRate": 89.46885980546926, "difficulty": "Medium", "likes": 231, "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": 17569, "totalSubmissionRaw": 19637}, "1875": {"acRate": 69.75278720310227, "difficulty": "Medium", "likes": 65, "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": 10073, "totalSubmissionRaw": 14441}, "1876": {"acRate": 72.22029449037476, "difficulty": "Easy", "likes": 1361, "dislikes": 35, "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": 95741, "totalSubmissionRaw": 132568}, "1877": {"acRate": 79.69795561598602, "difficulty": "Medium", "likes": 1232, "dislikes": 279, "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": 82061, "totalSubmissionRaw": 102965}, "1878": {"acRate": 47.28351373855121, "difficulty": "Medium", "likes": 192, "dislikes": 495, "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": 13629, "totalSubmissionRaw": 28824}, "1879": {"acRate": 46.35993880368671, "difficulty": "Hard", "likes": 642, "dislikes": 11, "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": 12424, "totalSubmissionRaw": 26799}, "1880": {"acRate": 73.71657719754525, "difficulty": "Easy", "likes": 520, "dislikes": 34, "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": 57537, "totalSubmissionRaw": 78051}, "1881": {"acRate": 37.43937495393234, "difficulty": "Medium", "likes": 359, "dislikes": 59, "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": 25397, "totalSubmissionRaw": 67834}, "1882": {"acRate": 39.63669391462307, "difficulty": "Medium", "likes": 844, "dislikes": 250, "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": 28366, "totalSubmissionRaw": 71565}, "1883": {"acRate": 37.448733413751505, "difficulty": "Hard", "likes": 321, "dislikes": 49, "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": 6209, "totalSubmissionRaw": 16580}, "1884": {"acRate": 72.05232486487438, "difficulty": "Medium", "likes": 1350, "dislikes": 125, "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": 40925, "totalSubmissionRaw": 56799}, "1885": {"acRate": 59.33811617681093, "difficulty": "Medium", "likes": 163, "dislikes": 12, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5128, "totalSubmissionRaw": 8642}, "1886": {"acRate": 56.25474483340363, "difficulty": "Easy", "likes": 1344, "dislikes": 106, "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": 60021, "totalSubmissionRaw": 106695}, "1887": {"acRate": 62.65086441230836, "difficulty": "Medium", "likes": 503, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 23048, "totalSubmissionRaw": 36788}, "1888": {"acRate": 39.46707687955301, "difficulty": "Medium", "likes": 1104, "dislikes": 51, "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": 22320, "totalSubmissionRaw": 56555}, "1889": {"acRate": 31.461154287850867, "difficulty": "Hard", "likes": 387, "dislikes": 33, "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": 11780, "totalSubmissionRaw": 37443}, "1890": {"acRate": 77.3731804146449, "difficulty": "Easy", "likes": 369, "dislikes": 7, "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": 70159, "totalSubmissionRaw": 90677}, "1891": {"acRate": 48.7754920295663, "difficulty": "Medium", "likes": 522, "dislikes": 35, "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": 54769, "totalSubmissionRaw": 112289}, "1892": {"acRate": 43.140060240963855, "difficulty": "Hard", "likes": 76, "dislikes": 20, "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": 5729, "totalSubmissionRaw": 13280}, "1893": {"acRate": 49.910308289182765, "difficulty": "Easy", "likes": 537, "dislikes": 97, "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": 35892, "totalSubmissionRaw": 71913}, "1894": {"acRate": 44.88130355386993, "difficulty": "Medium", "likes": 543, "dislikes": 62, "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": 31951, "totalSubmissionRaw": 71190}, "1895": {"acRate": 51.899529042386185, "difficulty": "Medium", "likes": 275, "dislikes": 246, "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": 9918, "totalSubmissionRaw": 19110}, "1896": {"acRate": 53.81758764111705, "difficulty": "Hard", "likes": 225, "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": 3623, "totalSubmissionRaw": 6732}, "1897": {"acRate": 59.05624404194471, "difficulty": "Easy", "likes": 419, "dislikes": 47, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 32214, "totalSubmissionRaw": 54548}, "1898": {"acRate": 42.32823420809706, "difficulty": "Medium", "likes": 919, "dislikes": 118, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25678, "totalSubmissionRaw": 60664}, "1899": {"acRate": 65.28908983927411, "difficulty": "Medium", "likes": 700, "dislikes": 50, "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": 42164, "totalSubmissionRaw": 64581}, "1900": {"acRate": 50.545234248788375, "difficulty": "Hard", "likes": 222, "dislikes": 17, "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": 5006, "totalSubmissionRaw": 9904}, "1901": {"acRate": 50.58046458370883, "difficulty": "Medium", "likes": 1757, "dislikes": 114, "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": 47708, "totalSubmissionRaw": 94321}, "1902": {"acRate": 44.72601256226987, "difficulty": "Medium", "likes": 89, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "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"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2065, "totalSubmissionRaw": 4617}, "1903": {"acRate": 57.82925977201858, "difficulty": "Easy", "likes": 1193, "dislikes": 75, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 89388, "totalSubmissionRaw": 154573}, "1904": {"acRate": 44.310796818892776, "difficulty": "Medium", "likes": 200, "dislikes": 253, "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": 20114, "totalSubmissionRaw": 45393}, "1905": {"acRate": 67.49262901431825, "difficulty": "Medium", "likes": 1923, "dislikes": 57, "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": 76457, "totalSubmissionRaw": 113282}, "1906": {"acRate": 44.00624079050013, "difficulty": "Medium", "likes": 512, "dislikes": 35, "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": 10154, "totalSubmissionRaw": 23074}, "1907": {"acRate": 57.33366009067517, "difficulty": "Medium", "likes": 267, "dislikes": 55, "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": 37432, "totalSubmissionRaw": 65288}, "1908": {"acRate": 63.746041321067715, "difficulty": "Medium", "likes": 97, "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": 4227, "totalSubmissionRaw": 6631}, "1909": {"acRate": 26.669097790305727, "difficulty": "Easy", "likes": 1142, "dislikes": 314, "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": 54118, "totalSubmissionRaw": 202924}, "1910": {"acRate": 76.26773954995247, "difficulty": "Medium", "likes": 1621, "dislikes": 53, "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": 86631, "totalSubmissionRaw": 113588}, "1911": {"acRate": 59.20146127424702, "difficulty": "Medium", "likes": 1115, "dislikes": 19, "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": 29818, "totalSubmissionRaw": 50367}, "1912": {"acRate": 36.13374725132583, "difficulty": "Hard", "likes": 226, "dislikes": 44, "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": 5587, "totalSubmissionRaw": 15462}, "1913": {"acRate": 81.03084554421575, "difficulty": "Easy", "likes": 822, "dislikes": 47, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 99484, "totalSubmissionRaw": 122773}, "1914": {"acRate": 48.694108697489646, "difficulty": "Medium", "likes": 221, "dislikes": 267, "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": 11522, "totalSubmissionRaw": 23662}, "1915": {"acRate": 46.385520620953606, "difficulty": "Medium", "likes": 925, "dislikes": 60, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12968, "totalSubmissionRaw": 27957}, "1916": {"acRate": 49.24650581713126, "difficulty": "Hard", "likes": 451, "dislikes": 48, "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": 6307, "totalSubmissionRaw": 12807}, "1917": {"acRate": 26.80355439530097, "difficulty": "Hard", "likes": 58, "dislikes": 51, "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": 5339, "totalSubmissionRaw": 19919}, "1918": {"acRate": 52.609128394710645, "difficulty": "Medium", "likes": 187, "dislikes": 10, "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": 3700, "totalSubmissionRaw": 7033}, "1919": {"acRate": 41.34432466708941, "difficulty": "Hard", "likes": 52, "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": 4564, "totalSubmissionRaw": 11039}, "1920": {"acRate": 89.51177272398027, "difficulty": "Easy", "likes": 3016, "dislikes": 336, "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": 407804, "totalSubmissionRaw": 455587}, "1921": {"acRate": 38.29907283152373, "difficulty": "Medium", "likes": 528, "dislikes": 84, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25115, "totalSubmissionRaw": 65576}, "1922": {"acRate": 42.497236347556935, "difficulty": "Medium", "likes": 1144, "dislikes": 376, "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": 38443, "totalSubmissionRaw": 90460}, "1923": {"acRate": 27.64659171647093, "difficulty": "Hard", "likes": 456, "dislikes": 34, "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": 6615, "totalSubmissionRaw": 23927}, "1924": {"acRate": 51.94174757281553, "difficulty": "Hard", "likes": 13, "dislikes": 40, "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": 642, "totalSubmissionRaw": 1236}, "1925": {"acRate": 67.51478229707938, "difficulty": "Easy", "likes": 385, "dislikes": 38, "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": 37680, "totalSubmissionRaw": 55810}, "1926": {"acRate": 47.49552111999705, "difficulty": "Medium", "likes": 2076, "dislikes": 79, "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": 102862, "totalSubmissionRaw": 216569}, "1927": {"acRate": 46.97841372867188, "difficulty": "Medium", "likes": 462, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9554, "totalSubmissionRaw": 20337}, "1928": {"acRate": 37.79759878350469, "difficulty": "Hard", "likes": 736, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16654, "totalSubmissionRaw": 44061}, "1929": {"acRate": 89.55137193051918, "difficulty": "Easy", "likes": 2872, "dislikes": 337, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 547349, "totalSubmissionRaw": 611212}, "1930": {"acRate": 53.77009778036745, "difficulty": "Medium", "likes": 781, "dislikes": 22, "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29525, "totalSubmissionRaw": 54913}, "1931": {"acRate": 57.411526794742166, "difficulty": "Hard", "likes": 450, "dislikes": 20, "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": 8517, "totalSubmissionRaw": 14835}, "1932": {"acRate": 35.734299516908216, "difficulty": "Hard", "likes": 531, "dislikes": 39, "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": 7397, "totalSubmissionRaw": 20700}, "1933": {"acRate": 50.56818181818182, "difficulty": "Easy", "likes": 52, "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": 3293, "totalSubmissionRaw": 6512}, "1934": {"acRate": 56.892176448355926, "difficulty": "Medium", "likes": 496, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63221, "totalSubmissionRaw": 111125}, "1935": {"acRate": 72.21146062218111, "difficulty": "Easy", "likes": 542, "dislikes": 25, "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": 49953, "totalSubmissionRaw": 69176}, "1936": {"acRate": 43.1640761134732, "difficulty": "Medium", "likes": 345, "dislikes": 25, "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": 24771, "totalSubmissionRaw": 57388}, "1937": {"acRate": 35.8015893037336, "difficulty": "Medium", "likes": 2238, "dislikes": 134, "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": 56767, "totalSubmissionRaw": 158560}, "1938": {"acRate": 40.83778658851922, "difficulty": "Hard", "likes": 361, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "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": 4738, "totalSubmissionRaw": 11602}, "1939": {"acRate": 57.017492196242415, "difficulty": "Easy", "likes": 55, "dislikes": 46, "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": 9681, "totalSubmissionRaw": 16979}, "1940": {"acRate": 78.83863763260747, "difficulty": "Medium", "likes": 141, "dislikes": 6, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 5648, "totalSubmissionRaw": 7164}, "1941": {"acRate": 77.00334651658048, "difficulty": "Easy", "likes": 787, "dislikes": 20, "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": 75933, "totalSubmissionRaw": 98610}, "1942": {"acRate": 41.21110630942091, "difficulty": "Medium", "likes": 536, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15258, "totalSubmissionRaw": 37024}, "1943": {"acRate": 48.79348304711581, "difficulty": "Medium", "likes": 442, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11081, "totalSubmissionRaw": 22710}, "1944": {"acRate": 68.34306163574456, "difficulty": "Hard", "likes": 1530, "dislikes": 42, "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": 39341, "totalSubmissionRaw": 57564}, "1945": {"acRate": 61.80254613691899, "difficulty": "Easy", "likes": 563, "dislikes": 59, "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": 45779, "totalSubmissionRaw": 74073}, "1946": {"acRate": 35.16031893335354, "difficulty": "Medium", "likes": 205, "dislikes": 218, "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": 18565, "totalSubmissionRaw": 52801}, "1947": {"acRate": 61.69210370412165, "difficulty": "Medium", "likes": 732, "dislikes": 20, "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": 21868, "totalSubmissionRaw": 35447}, "1948": {"acRate": 56.452991452991455, "difficulty": "Hard", "likes": 298, "dislikes": 65, "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": 7926, "totalSubmissionRaw": 14040}, "1949": {"acRate": 55.12876236009997, "difficulty": "Medium", "likes": 135, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10147, "totalSubmissionRaw": 18406}, "1950": {"acRate": 49.621840988747465, "difficulty": "Medium", "likes": 128, "dislikes": 51, "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": 2690, "totalSubmissionRaw": 5421}, "1951": {"acRate": 69.24132254081493, "difficulty": "Medium", "likes": 87, "dislikes": 6, "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": 10094, "totalSubmissionRaw": 14578}, "1952": {"acRate": 59.13543322844976, "difficulty": "Easy", "likes": 476, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53187, "totalSubmissionRaw": 89941}, "1953": {"acRate": 39.89494795148506, "difficulty": "Medium", "likes": 601, "dislikes": 134, "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": 20887, "totalSubmissionRaw": 52355}, "1954": {"acRate": 53.48532123103106, "difficulty": "Medium", "likes": 348, "dislikes": 85, "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": 15085, "totalSubmissionRaw": 28204}, "1955": {"acRate": 51.12748710390568, "difficulty": "Hard", "likes": 485, "dislikes": 8, "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": 10407, "totalSubmissionRaw": 20355}, "1956": {"acRate": 49.55647545830869, "difficulty": "Hard", "likes": 29, "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": 838, "totalSubmissionRaw": 1691}, "1957": {"acRate": 57.17295326726144, "difficulty": "Easy", "likes": 400, "dislikes": 21, "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": 31209, "totalSubmissionRaw": 54587}, "1958": {"acRate": 46.48179344304781, "difficulty": "Medium", "likes": 132, "dislikes": 249, "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": 10761, "totalSubmissionRaw": 23151}, "1959": {"acRate": 42.40334614515035, "difficulty": "Medium", "likes": 537, "dislikes": 46, "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": 7502, "totalSubmissionRaw": 17692}, "1960": {"acRate": 30.22959183673469, "difficulty": "Hard", "likes": 226, "dislikes": 39, "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": 3081, "totalSubmissionRaw": 10192}, "1961": {"acRate": 52.90943133007819, "difficulty": "Easy", "likes": 445, "dislikes": 80, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43236, "totalSubmissionRaw": 81717}, "1962": {"acRate": 61.0533132487717, "difficulty": "Medium", "likes": 1727, "dislikes": 143, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86736, "totalSubmissionRaw": 142066}, "1963": {"acRate": 70.25102101802968, "difficulty": "Medium", "likes": 1625, "dislikes": 56, "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": 56416, "totalSubmissionRaw": 80307}, "1964": {"acRate": 63.344275458152275, "difficulty": "Hard", "likes": 1702, "dislikes": 68, "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": 53645, "totalSubmissionRaw": 84688}, "1965": {"acRate": 72.33381255562401, "difficulty": "Easy", "likes": 640, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105658, "totalSubmissionRaw": 146070}, "1966": {"acRate": 65.16061634891616, "difficulty": "Medium", "likes": 66, "dislikes": 9, "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": 2495, "totalSubmissionRaw": 3829}, "1967": {"acRate": 80.1433941250174, "difficulty": "Easy", "likes": 632, "dislikes": 34, "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": 57566, "totalSubmissionRaw": 71828}, "1968": {"acRate": 49.413225192419105, "difficulty": "Medium", "likes": 546, "dislikes": 38, "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": 29853, "totalSubmissionRaw": 60415}, "1969": {"acRate": 34.64299471232973, "difficulty": "Medium", "likes": 207, "dislikes": 355, "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": 9893, "totalSubmissionRaw": 28557}, "1970": {"acRate": 62.52830053067239, "difficulty": "Hard", "likes": 1803, "dislikes": 31, "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": 52198, "totalSubmissionRaw": 83479}, "1971": {"acRate": 51.519960214341445, "difficulty": "Easy", "likes": 3259, "dislikes": 160, "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": 271416, "totalSubmissionRaw": 526817}, "1972": {"acRate": 50.1277994157741, "difficulty": "Hard", "likes": 127, "dislikes": 39, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 8237, "totalSubmissionRaw": 16432}, "1973": {"acRate": 75.15056297460067, "difficulty": "Medium", "likes": 151, "dislikes": 7, "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 Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8610, "totalSubmissionRaw": 11457}, "1974": {"acRate": 73.67042288660652, "difficulty": "Easy", "likes": 634, "dislikes": 24, "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": 35434, "totalSubmissionRaw": 48098}, "1975": {"acRate": 48.88981860562412, "difficulty": "Medium", "likes": 520, "dislikes": 19, "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": 16360, "totalSubmissionRaw": 33463}, "1976": {"acRate": 28.534321158263115, "difficulty": "Medium", "likes": 2461, "dislikes": 98, "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": 44600, "totalSubmissionRaw": 156303}, "1977": {"acRate": 20.365248361307923, "difficulty": "Hard", "likes": 482, "dislikes": 55, "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": 5375, "totalSubmissionRaw": 26393}, "1978": {"acRate": 47.268026091555505, "difficulty": "Easy", "likes": 231, "dislikes": 20, "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": 40215, "totalSubmissionRaw": 85077}, "1979": {"acRate": 77.3484871338502, "difficulty": "Easy", "likes": 1008, "dislikes": 40, "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": 102561, "totalSubmissionRaw": 132596}, "1980": {"acRate": 66.38978806571795, "difficulty": "Medium", "likes": 1055, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43479, "totalSubmissionRaw": 65491}, "1981": {"acRate": 33.15005695161222, "difficulty": "Medium", "likes": 874, "dislikes": 133, "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": 23574, "totalSubmissionRaw": 71113}, "1982": {"acRate": 48.21953941361469, "difficulty": "Hard", "likes": 540, "dislikes": 34, "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": 4753, "totalSubmissionRaw": 9857}, "1983": {"acRate": 53.9447731755424, "difficulty": "Medium", "likes": 82, "dislikes": 0, "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": 2188, "totalSubmissionRaw": 4056}, "1984": {"acRate": 55.46354912150934, "difficulty": "Easy", "likes": 894, "dislikes": 216, "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": 57736, "totalSubmissionRaw": 104098}, "1985": {"acRate": 44.75154847525303, "difficulty": "Medium", "likes": 1129, "dislikes": 130, "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": 54694, "totalSubmissionRaw": 122217}, "1986": {"acRate": 33.07675675675676, "difficulty": "Medium", "likes": 1031, "dislikes": 65, "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": 22947, "totalSubmissionRaw": 69375}, "1987": {"acRate": 52.09376975828024, "difficulty": "Hard", "likes": 643, "dislikes": 13, "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": 10711, "totalSubmissionRaw": 20561}, "1988": {"acRate": 67.33337947262787, "difficulty": "Medium", "likes": 75, "dislikes": 149, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 9729, "totalSubmissionRaw": 14449}, "1989": {"acRate": 51.18392070484582, "difficulty": "Medium", "likes": 66, "dislikes": 10, "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": 1859, "totalSubmissionRaw": 3632}, "1990": {"acRate": 49.760397056306694, "difficulty": "Medium", "likes": 19, "dislikes": 183, "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": 5815, "totalSubmissionRaw": 11686}, "1991": {"acRate": 67.41802373357602, "difficulty": "Easy", "likes": 1242, "dislikes": 55, "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": 76299, "totalSubmissionRaw": 113173}, "1992": {"acRate": 68.26639184446549, "difficulty": "Medium", "likes": 754, "dislikes": 23, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24509, "totalSubmissionRaw": 35902}, "1993": {"acRate": 44.97945205479452, "difficulty": "Medium", "likes": 415, "dislikes": 67, "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": 13134, "totalSubmissionRaw": 29200}, "1994": {"acRate": 34.48527115644842, "difficulty": "Hard", "likes": 430, "dislikes": 12, "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": 6626, "totalSubmissionRaw": 19214}, "1995": {"acRate": 60.21655065738592, "difficulty": "Easy", "likes": 578, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35037, "totalSubmissionRaw": 58185}, "1996": {"acRate": 43.9473766249961, "difficulty": "Medium", "likes": 2934, "dislikes": 89, "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": 98679, "totalSubmissionRaw": 224539}, "1997": {"acRate": 36.76805750350631, "difficulty": "Medium", "likes": 462, "dislikes": 89, "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": 8389, "totalSubmissionRaw": 22816}, "1998": {"acRate": 45.36100252931708, "difficulty": "Hard", "likes": 454, "dislikes": 13, "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": 7891, "totalSubmissionRaw": 17396}, "1999": {"acRate": 50.15311330384484, "difficulty": "Medium", "likes": 25, "dislikes": 9, "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": 1474, "totalSubmissionRaw": 2939}, "2000": {"acRate": 79.815578790581, "difficulty": "Easy", "likes": 779, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81448, "totalSubmissionRaw": 102046}, "2001": {"acRate": 47.84641068447412, "difficulty": "Medium", "likes": 468, "dislikes": 37, "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": 31523, "totalSubmissionRaw": 65887}, "2002": {"acRate": 56.72601132479722, "difficulty": "Medium", "likes": 837, "dislikes": 61, "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": 22240, "totalSubmissionRaw": 39206}, "2003": {"acRate": 46.10228401191658, "difficulty": "Hard", "likes": 425, "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": 7428, "totalSubmissionRaw": 16112}, "2004": {"acRate": 40.67737020977382, "difficulty": "Hard", "likes": 106, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 6942, "totalSubmissionRaw": 17066}, "2005": {"acRate": 60.83150984682714, "difficulty": "Hard", "likes": 15, "dislikes": 43, "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": 556, "totalSubmissionRaw": 914}, "2006": {"acRate": 83.06211338743545, "difficulty": "Easy", "likes": 1472, "dislikes": 31, "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": 117091, "totalSubmissionRaw": 140968}, "2007": {"acRate": 40.476020205829, "difficulty": "Medium", "likes": 2341, "dislikes": 112, "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": 124518, "totalSubmissionRaw": 307634}, "2008": {"acRate": 43.483849145949605, "difficulty": "Medium", "likes": 1149, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25712, "totalSubmissionRaw": 59130}, "2009": {"acRate": 53.72784067484857, "difficulty": "Hard", "likes": 1730, "dislikes": 45, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67765, "totalSubmissionRaw": 126129}, "2010": {"acRate": 60.14774494556765, "difficulty": "Hard", "likes": 33, "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": 4641, "totalSubmissionRaw": 7716}, "2011": {"acRate": 88.5231410220747, "difficulty": "Easy", "likes": 1418, "dislikes": 160, "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": 286405, "totalSubmissionRaw": 323537}, "2012": {"acRate": 47.46570035097315, "difficulty": "Medium", "likes": 566, "dislikes": 57, "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": 20827, "totalSubmissionRaw": 43878}, "2013": {"acRate": 50.452707160135, "difficulty": "Medium", "likes": 757, "dislikes": 198, "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": 52770, "totalSubmissionRaw": 104592}, "2014": {"acRate": 54.801930758988014, "difficulty": "Hard", "likes": 419, "dislikes": 74, "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": 6585, "totalSubmissionRaw": 12016}, "2015": {"acRate": 58.922670191672175, "difficulty": "Medium", "likes": 47, "dislikes": 26, "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": 1783, "totalSubmissionRaw": 3026}, "2016": {"acRate": 54.97146338335257, "difficulty": "Easy", "likes": 918, "dislikes": 28, "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": 68578, "totalSubmissionRaw": 124752}, "2017": {"acRate": 44.79546375050628, "difficulty": "Medium", "likes": 843, "dislikes": 26, "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": 19908, "totalSubmissionRaw": 44442}, "2018": {"acRate": 49.16606236403191, "difficulty": "Medium", "likes": 269, "dislikes": 285, "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": 18306, "totalSubmissionRaw": 37233}, "2019": {"acRate": 33.39757279024949, "difficulty": "Hard", "likes": 251, "dislikes": 77, "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": 6412, "totalSubmissionRaw": 19199}, "2020": {"acRate": 71.99066355451818, "difficulty": "Medium", "likes": 26, "dislikes": 200, "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": 8636, "totalSubmissionRaw": 11996}, "2021": {"acRate": 62.5281884239539, "difficulty": "Medium", "likes": 144, "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": 4991, "totalSubmissionRaw": 7982}, "2022": {"acRate": 60.1863304997763, "difficulty": "Easy", "likes": 710, "dislikes": 52, "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": 68607, "totalSubmissionRaw": 113990}, "2023": {"acRate": 73.94544376358965, "difficulty": "Medium", "likes": 648, "dislikes": 48, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37409, "totalSubmissionRaw": 50590}, "2024": {"acRate": 67.22244257743483, "difficulty": "Medium", "likes": 2691, "dislikes": 37, "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": 93214, "totalSubmissionRaw": 138665}, "2025": {"acRate": 33.515352627378505, "difficulty": "Hard", "likes": 432, "dislikes": 46, "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": 7976, "totalSubmissionRaw": 23804}, "2026": {"acRate": 84.14563508481588, "difficulty": "Easy", "likes": 48, "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": 10169, "totalSubmissionRaw": 12085}, "2027": {"acRate": 54.30675017883001, "difficulty": "Easy", "likes": 435, "dislikes": 68, "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": 31127, "totalSubmissionRaw": 57317}, "2028": {"acRate": 45.294139660205076, "difficulty": "Medium", "likes": 442, "dislikes": 29, "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": 24207, "totalSubmissionRaw": 53444}, "2029": {"acRate": 27.50360094003487, "difficulty": "Medium", "likes": 216, "dislikes": 264, "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": 7256, "totalSubmissionRaw": 26382}, "2030": {"acRate": 38.61365198540686, "difficulty": "Hard", "likes": 446, "dislikes": 11, "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": 7303, "totalSubmissionRaw": 18913}, "2031": {"acRate": 52.35249042145595, "difficulty": "Medium", "likes": 152, "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": 3416, "totalSubmissionRaw": 6525}, "2032": {"acRate": 74.31524203227097, "difficulty": "Easy", "likes": 685, "dislikes": 44, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55729, "totalSubmissionRaw": 74990}, "2033": {"acRate": 52.67752309969881, "difficulty": "Medium", "likes": 512, "dislikes": 39, "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": 20638, "totalSubmissionRaw": 39178}, "2034": {"acRate": 48.74800554838399, "difficulty": "Medium", "likes": 1086, "dislikes": 57, "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": 60799, "totalSubmissionRaw": 124721}, "2035": {"acRate": 19.35803386263039, "difficulty": "Hard", "likes": 2627, "dislikes": 143, "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": 18762, "totalSubmissionRaw": 96921}, "2036": {"acRate": 40.97671410090557, "difficulty": "Medium", "likes": 87, "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": 2534, "totalSubmissionRaw": 6184}, "2037": {"acRate": 81.60849471207008, "difficulty": "Easy", "likes": 715, "dislikes": 136, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57565, "totalSubmissionRaw": 70538}, "2038": {"acRate": 62.988772357804855, "difficulty": "Medium", "likes": 1462, "dislikes": 108, "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": 126003, "totalSubmissionRaw": 200041}, "2039": {"acRate": 51.271483328524916, "difficulty": "Medium", "likes": 606, "dislikes": 49, "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": 12440, "totalSubmissionRaw": 24263}, "2040": {"acRate": 28.545228824558432, "difficulty": "Hard", "likes": 651, "dislikes": 36, "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": 10117, "totalSubmissionRaw": 35442}, "2041": {"acRate": 78.2060707908833, "difficulty": "Medium", "likes": 43, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7446, "totalSubmissionRaw": 9521}, "2042": {"acRate": 68.13832869316977, "difficulty": "Easy", "likes": 564, "dislikes": 19, "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": 48213, "totalSubmissionRaw": 70758}, "2043": {"acRate": 64.63019614900126, "difficulty": "Medium", "likes": 214, "dislikes": 196, "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": 21549, "totalSubmissionRaw": 33342}, "2044": {"acRate": 76.51936334466436, "difficulty": "Medium", "likes": 571, "dislikes": 20, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24086, "totalSubmissionRaw": 31477}, "2045": {"acRate": 39.859385610993485, "difficulty": "Hard", "likes": 653, "dislikes": 10, "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": 9978, "totalSubmissionRaw": 25033}, "2046": {"acRate": 67.96883454171626, "difficulty": "Medium", "likes": 150, "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": 6281, "totalSubmissionRaw": 9241}, "2047": {"acRate": 28.88719247718519, "difficulty": "Easy", "likes": 268, "dislikes": 756, "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": 24975, "totalSubmissionRaw": 86457}, "2048": {"acRate": 47.33364981406757, "difficulty": "Medium", "likes": 178, "dislikes": 269, "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": 11964, "totalSubmissionRaw": 25277}, "2049": {"acRate": 47.58143629732109, "difficulty": "Medium", "likes": 920, "dislikes": 54, "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": 18915, "totalSubmissionRaw": 39754}, "2050": {"acRate": 59.45847668596682, "difficulty": "Hard", "likes": 749, "dislikes": 21, "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": 21257, "totalSubmissionRaw": 35751}, "2051": {"acRate": 69.62586505190312, "difficulty": "Medium", "likes": 50, "dislikes": 6, "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": 6438, "totalSubmissionRaw": 9247}, "2052": {"acRate": 49.73194575843583, "difficulty": "Medium", "likes": 37, "dislikes": 12, "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": 1577, "totalSubmissionRaw": 3171}, "2053": {"acRate": 72.18525676421866, "difficulty": "Easy", "likes": 699, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 52290, "totalSubmissionRaw": 72439}, "2054": {"acRate": 45.95750789549239, "difficulty": "Medium", "likes": 769, "dislikes": 17, "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": 16007, "totalSubmissionRaw": 34830}, "2055": {"acRate": 44.44997829029704, "difficulty": "Medium", "likes": 1057, "dislikes": 43, "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": 34806, "totalSubmissionRaw": 78303}, "2056": {"acRate": 53.567318757192176, "difficulty": "Hard", "likes": 56, "dislikes": 279, "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": 3724, "totalSubmissionRaw": 6952}, "2057": {"acRate": 72.23748915244431, "difficulty": "Easy", "likes": 358, "dislikes": 126, "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": 49945, "totalSubmissionRaw": 69140}, "2058": {"acRate": 57.524823421025694, "difficulty": "Medium", "likes": 589, "dislikes": 22, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28098, "totalSubmissionRaw": 48845}, "2059": {"acRate": 48.38635693456964, "difficulty": "Medium", "likes": 612, "dislikes": 31, "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": 14768, "totalSubmissionRaw": 30521}, "2060": {"acRate": 40.77475237598749, "difficulty": "Hard", "likes": 275, "dislikes": 131, "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": 10168, "totalSubmissionRaw": 24937}, "2061": {"acRate": 54.09836065573771, "difficulty": "Medium", "likes": 79, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 3795, "totalSubmissionRaw": 7015}, "2062": {"acRate": 66.79311051876154, "difficulty": "Easy", "likes": 849, "dislikes": 197, "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": 32575, "totalSubmissionRaw": 48770}, "2063": {"acRate": 54.381726334285084, "difficulty": "Medium", "likes": 767, "dislikes": 24, "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": 24760, "totalSubmissionRaw": 45530}, "2064": {"acRate": 51.476384312205205, "difficulty": "Medium", "likes": 938, "dislikes": 33, "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": 23901, "totalSubmissionRaw": 46431}, "2065": {"acRate": 57.614570707897926, "difficulty": "Hard", "likes": 580, "dislikes": 41, "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": 17588, "totalSubmissionRaw": 30527}, "2066": {"acRate": 83.21065165620264, "difficulty": "Medium", "likes": 64, "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": 7687, "totalSubmissionRaw": 9238}, "2067": {"acRate": 47.707612456747405, "difficulty": "Medium", "likes": 94, "dislikes": 6, "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": 2206, "totalSubmissionRaw": 4624}, "2068": {"acRate": 63.47177384172411, "difficulty": "Easy", "likes": 482, "dislikes": 19, "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": 43647, "totalSubmissionRaw": 68766}, "2069": {"acRate": 24.129470112242235, "difficulty": "Medium", "likes": 152, "dislikes": 297, "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": 9244, "totalSubmissionRaw": 38310}, "2070": {"acRate": 49.36370184886633, "difficulty": "Medium", "likes": 551, "dislikes": 13, "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": 14391, "totalSubmissionRaw": 29153}, "2071": {"acRate": 33.766745468873125, "difficulty": "Hard", "likes": 478, "dislikes": 19, "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": 7713, "totalSubmissionRaw": 22842}, "2072": {"acRate": 72.62360446570972, "difficulty": "Easy", "likes": 58, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9107, "totalSubmissionRaw": 12540}, "2073": {"acRate": 62.68349533822655, "difficulty": "Easy", "likes": 829, "dislikes": 65, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 50556, "totalSubmissionRaw": 80654}, "2074": {"acRate": 55.47826572801431, "difficulty": "Medium", "likes": 592, "dislikes": 308, "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": 19859, "totalSubmissionRaw": 35796}, "2075": {"acRate": 49.420182580804344, "difficulty": "Medium", "likes": 230, "dislikes": 47, "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": 12018, "totalSubmissionRaw": 24318}, "2076": {"acRate": 54.032627462034455, "difficulty": "Hard", "likes": 572, "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": 15335, "totalSubmissionRaw": 28381}, "2077": {"acRate": 54.833068362480134, "difficulty": "Medium", "likes": 114, "dislikes": 7, "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": 3449, "totalSubmissionRaw": 6290}, "2078": {"acRate": 66.57582329775697, "difficulty": "Easy", "likes": 842, "dislikes": 22, "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": 46659, "totalSubmissionRaw": 70084}, "2079": {"acRate": 79.56255468066492, "difficulty": "Medium", "likes": 811, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40922, "totalSubmissionRaw": 51434}, "2080": {"acRate": 39.22046022580367, "difficulty": "Medium", "likes": 595, "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": 18203, "totalSubmissionRaw": 46412}, "2081": {"acRate": 42.08972103543604, "difficulty": "Hard", "likes": 116, "dislikes": 145, "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": 6699, "totalSubmissionRaw": 15916}, "2082": {"acRate": 77.61200097568907, "difficulty": "Easy", "likes": 91, "dislikes": 24, "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": 19091, "totalSubmissionRaw": 24598}, "2083": {"acRate": 68.0246328754145, "difficulty": "Medium", "likes": 107, "dislikes": 6, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 5744, "totalSubmissionRaw": 8444}, "2084": {"acRate": 87.2713972201902, "difficulty": "Medium", "likes": 72, "dislikes": 17, "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": 8351, "totalSubmissionRaw": 9569}, "2085": {"acRate": 69.81563807531381, "difficulty": "Easy", "likes": 724, "dislikes": 15, "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": 53395, "totalSubmissionRaw": 76480}, "2086": {"acRate": 45.25958735142409, "difficulty": "Medium", "likes": 498, "dislikes": 21, "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": 16145, "totalSubmissionRaw": 35672}, "2087": {"acRate": 51.06244296701864, "difficulty": "Medium", "likes": 620, "dislikes": 83, "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"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15668, "totalSubmissionRaw": 30684}, "2088": {"acRate": 63.459174714661984, "difficulty": "Hard", "likes": 328, "dislikes": 12, "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": 7228, "totalSubmissionRaw": 11390}, "2089": {"acRate": 75.76331870675963, "difficulty": "Easy", "likes": 1649, "dislikes": 77, "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": 140718, "totalSubmissionRaw": 185734}, "2090": {"acRate": 47.498954134022966, "difficulty": "Medium", "likes": 1790, "dislikes": 86, "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": 99915, "totalSubmissionRaw": 210352}, "2091": {"acRate": 54.552543461309114, "difficulty": "Medium", "likes": 878, "dislikes": 42, "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": 35679, "totalSubmissionRaw": 65403}, "2092": {"acRate": 34.18817453090714, "difficulty": "Hard", "likes": 769, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 22903, "totalSubmissionRaw": 66991}, "2093": {"acRate": 55.47613278410468, "difficulty": "Medium", "likes": 178, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 4579, "totalSubmissionRaw": 8254}, "2094": {"acRate": 58.7354821283875, "difficulty": "Easy", "likes": 518, "dislikes": 248, "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": 26095, "totalSubmissionRaw": 44428}, "2095": {"acRate": 58.792239746517275, "difficulty": "Medium", "likes": 3662, "dislikes": 65, "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": 265700, "totalSubmissionRaw": 451932}, "2096": {"acRate": 48.63723566719746, "difficulty": "Medium", "likes": 2217, "dislikes": 110, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 89491, "totalSubmissionRaw": 183998}, "2097": {"acRate": 42.080008081624406, "difficulty": "Hard", "likes": 460, "dislikes": 24, "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": 8331, "totalSubmissionRaw": 19798}, "2098": {"acRate": 37.36826697892271, "difficulty": "Medium", "likes": 73, "dislikes": 5, "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": 2553, "totalSubmissionRaw": 6832}, "2099": {"acRate": 42.76330052464987, "difficulty": "Easy", "likes": 1121, "dislikes": 103, "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": 39449, "totalSubmissionRaw": 92251}, "2100": {"acRate": 49.38595369067417, "difficulty": "Medium", "likes": 824, "dislikes": 43, "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": 23163, "totalSubmissionRaw": 46902}, "2101": {"acRate": 49.13848659396216, "difficulty": "Medium", "likes": 2772, "dislikes": 135, "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": 98361, "totalSubmissionRaw": 200168}, "2102": {"acRate": 64.71963731806252, "difficulty": "Hard", "likes": 355, "dislikes": 40, "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": 13562, "totalSubmissionRaw": 20955}, "2103": {"acRate": 80.80971975233324, "difficulty": "Easy", "likes": 873, "dislikes": 13, "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": 62255, "totalSubmissionRaw": 77039}, "2104": {"acRate": 60.93396088789245, "difficulty": "Medium", "likes": 2095, "dislikes": 102, "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": 79361, "totalSubmissionRaw": 130241}, "2105": {"acRate": 48.654772019258004, "difficulty": "Medium", "likes": 250, "dislikes": 151, "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": 17180, "totalSubmissionRaw": 35310}, "2106": {"acRate": 35.43774747030356, "difficulty": "Hard", "likes": 512, "dislikes": 16, "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": 9666, "totalSubmissionRaw": 27276}, "2107": {"acRate": 55.912884184815795, "difficulty": "Medium", "likes": 70, "dislikes": 3, "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": 2747, "totalSubmissionRaw": 4913}, "2108": {"acRate": 78.93054947418554, "difficulty": "Easy", "likes": 936, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 102751, "totalSubmissionRaw": 130179}, "2109": {"acRate": 56.688895706512085, "difficulty": "Medium", "likes": 515, "dislikes": 51, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35108, "totalSubmissionRaw": 61931}, "2110": {"acRate": 58.34239524430912, "difficulty": "Medium", "likes": 656, "dislikes": 26, "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": 32191, "totalSubmissionRaw": 55176}, "2111": {"acRate": 38.06143520908621, "difficulty": "Hard", "likes": 669, "dislikes": 11, "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": 11796, "totalSubmissionRaw": 30992}, "2112": {"acRate": 68.77990430622009, "difficulty": "Medium", "likes": 59, "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": 6900, "totalSubmissionRaw": 10032}, "2113": {"acRate": 73.49240780911063, "difficulty": "Medium", "likes": 54, "dislikes": 7, "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": 1694, "totalSubmissionRaw": 2305}, "2114": {"acRate": 86.44152647951267, "difficulty": "Easy", "likes": 1591, "dislikes": 51, "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": 226194, "totalSubmissionRaw": 261673}, "2115": {"acRate": 48.940802903152644, "difficulty": "Medium", "likes": 1685, "dislikes": 83, "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": 75523, "totalSubmissionRaw": 154314}, "2116": {"acRate": 30.828644501278774, "difficulty": "Medium", "likes": 996, "dislikes": 32, "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": 18081, "totalSubmissionRaw": 58650}, "2117": {"acRate": 26.49937711336537, "difficulty": "Hard", "likes": 84, "dislikes": 145, "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": 2978, "totalSubmissionRaw": 11238}, "2118": {"acRate": 55.42986425339367, "difficulty": "Hard", "likes": 19, "dislikes": 32, "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": 1960, "totalSubmissionRaw": 3536}, "2119": {"acRate": 78.2820688083846, "difficulty": "Easy", "likes": 602, "dislikes": 34, "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": 68716, "totalSubmissionRaw": 87780}, "2120": {"acRate": 82.55074590364391, "difficulty": "Medium", "likes": 496, "dislikes": 45, "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": 27004, "totalSubmissionRaw": 32712}, "2121": {"acRate": 44.04084282005193, "difficulty": "Medium", "likes": 847, "dislikes": 34, "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": 17641, "totalSubmissionRaw": 40056}, "2122": {"acRate": 38.79645591949645, "difficulty": "Hard", "likes": 353, "dislikes": 30, "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": 9677, "totalSubmissionRaw": 24943}, "2123": {"acRate": 41.7184265010352, "difficulty": "Hard", "likes": 45, "dislikes": 9, "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": 806, "totalSubmissionRaw": 1932}, "2124": {"acRate": 71.24845376034136, "difficulty": "Easy", "likes": 671, "dislikes": 16, "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": 62782, "totalSubmissionRaw": 88117}, "2125": {"acRate": 81.36742975269887, "difficulty": "Medium", "likes": 803, "dislikes": 69, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 53137, "totalSubmissionRaw": 65305}, "2126": {"acRate": 50.76460631529797, "difficulty": "Medium", "likes": 489, "dislikes": 180, "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": 34790, "totalSubmissionRaw": 68532}, "2127": {"acRate": 35.887920468473375, "difficulty": "Hard", "likes": 941, "dislikes": 24, "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": 10541, "totalSubmissionRaw": 29372}, "2128": {"acRate": 76.2614623841759, "difficulty": "Medium", "likes": 457, "dislikes": 176, "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": 31769, "totalSubmissionRaw": 41658}, "2129": {"acRate": 62.90060606060606, "difficulty": "Easy", "likes": 665, "dislikes": 47, "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": 51893, "totalSubmissionRaw": 82500}, "2130": {"acRate": 81.68228167511761, "difficulty": "Medium", "likes": 3152, "dislikes": 80, "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": 205228, "totalSubmissionRaw": 251251}, "2131": {"acRate": 48.04536764966191, "difficulty": "Medium", "likes": 2334, "dislikes": 52, "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": 108571, "totalSubmissionRaw": 225976}, "2132": {"acRate": 31.847395752995013, "difficulty": "Hard", "likes": 363, "dislikes": 37, "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": 6194, "totalSubmissionRaw": 19449}, "2133": {"acRate": 51.611332633788045, "difficulty": "Easy", "likes": 903, "dislikes": 48, "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": 61482, "totalSubmissionRaw": 119125}, "2134": {"acRate": 51.663046718623576, "difficulty": "Medium", "likes": 1023, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24262, "totalSubmissionRaw": 46962}, "2135": {"acRate": 42.72714888979703, "difficulty": "Medium", "likes": 634, "dislikes": 151, "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": 31366, "totalSubmissionRaw": 73410}, "2136": {"acRate": 72.29826882153333, "difficulty": "Hard", "likes": 1512, "dislikes": 79, "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": 50282, "totalSubmissionRaw": 69548}, "2137": {"acRate": 67.2875816993464, "difficulty": "Medium", "likes": 89, "dislikes": 8, "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": 2059, "totalSubmissionRaw": 3060}, "2138": {"acRate": 65.85441437914893, "difficulty": "Easy", "likes": 429, "dislikes": 18, "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": 40376, "totalSubmissionRaw": 61311}, "2139": {"acRate": 49.47171143765108, "difficulty": "Medium", "likes": 894, "dislikes": 17, "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": 36428, "totalSubmissionRaw": 73634}, "2140": {"acRate": 54.94697939563758, "difficulty": "Medium", "likes": 2224, "dislikes": 54, "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": 90990, "totalSubmissionRaw": 165596}, "2141": {"acRate": 50.3700952431486, "difficulty": "Hard", "likes": 1938, "dislikes": 53, "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": 56958, "totalSubmissionRaw": 113078}, "2142": {"acRate": 48.06724913952873, "difficulty": "Medium", "likes": 93, "dislikes": 10, "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": 7262, "totalSubmissionRaw": 15108}, "2143": {"acRate": 51.62818235642392, "difficulty": "Hard", "likes": 37, "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": 872, "totalSubmissionRaw": 1689}, "2144": {"acRate": 60.75790883547584, "difficulty": "Easy", "likes": 532, "dislikes": 17, "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": 41733, "totalSubmissionRaw": 68688}, "2145": {"acRate": 37.54722196627661, "difficulty": "Medium", "likes": 488, "dislikes": 45, "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": 16300, "totalSubmissionRaw": 43412}, "2146": {"acRate": 42.07878529178608, "difficulty": "Medium", "likes": 469, "dislikes": 149, "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": 13801, "totalSubmissionRaw": 32798}, "2147": {"acRate": 39.61007423853465, "difficulty": "Hard", "likes": 375, "dislikes": 33, "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": 11417, "totalSubmissionRaw": 28825}, "2148": {"acRate": 59.342799773959676, "difficulty": "Easy", "likes": 607, "dislikes": 32, "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": 49355, "totalSubmissionRaw": 83170}, "2149": {"acRate": 81.85602567180018, "difficulty": "Medium", "likes": 2228, "dislikes": 90, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 129583, "totalSubmissionRaw": 158306}, "2150": {"acRate": 60.23835811188917, "difficulty": "Medium", "likes": 561, "dislikes": 54, "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": 39824, "totalSubmissionRaw": 66113}, "2151": {"acRate": 49.523967215829124, "difficulty": "Hard", "likes": 465, "dislikes": 76, "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": 11964, "totalSubmissionRaw": 24158}, "2152": {"acRate": 45.91419816138917, "difficulty": "Medium", "likes": 64, "dislikes": 10, "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": 1798, "totalSubmissionRaw": 3916}, "2153": {"acRate": 41.39957264957265, "difficulty": "Hard", "likes": 70, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 2325, "totalSubmissionRaw": 5616}, "2154": {"acRate": 71.64155461754208, "difficulty": "Easy", "likes": 641, "dislikes": 31, "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": 76885, "totalSubmissionRaw": 107319}, "2155": {"acRate": 63.86440516461004, "difficulty": "Medium", "likes": 468, "dislikes": 14, "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": 26809, "totalSubmissionRaw": 41978}, "2156": {"acRate": 22.763662331804856, "difficulty": "Hard", "likes": 408, "dislikes": 381, "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": 12113, "totalSubmissionRaw": 53212}, "2157": {"acRate": 25.60332954069106, "difficulty": "Hard", "likes": 437, "dislikes": 53, "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": 8551, "totalSubmissionRaw": 33398}, "2158": {"acRate": 54.737313815031364, "difficulty": "Hard", "likes": 389, "dislikes": 38, "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": 25651, "totalSubmissionRaw": 46862}, "2159": {"acRate": 59.542141463915414, "difficulty": "Medium", "likes": 64, "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": 5800, "totalSubmissionRaw": 9741}, "2160": {"acRate": 86.21012201380726, "difficulty": "Easy", "likes": 1298, "dislikes": 126, "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": 104147, "totalSubmissionRaw": 120806}, "2161": {"acRate": 84.8314765195318, "difficulty": "Medium", "likes": 982, "dislikes": 72, "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": 60153, "totalSubmissionRaw": 70909}, "2162": {"acRate": 40.58620497689696, "difficulty": "Medium", "likes": 193, "dislikes": 607, "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": 14581, "totalSubmissionRaw": 35926}, "2163": {"acRate": 47.35713107089819, "difficulty": "Hard", "likes": 626, "dislikes": 14, "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": 8610, "totalSubmissionRaw": 18181}, "2164": {"acRate": 63.557111988674464, "difficulty": "Easy", "likes": 672, "dislikes": 50, "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": 51180, "totalSubmissionRaw": 80526}, "2165": {"acRate": 51.636393796135025, "difficulty": "Medium", "likes": 590, "dislikes": 21, "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": 31129, "totalSubmissionRaw": 60285}, "2166": {"acRate": 31.930754834684965, "difficulty": "Medium", "likes": 558, "dislikes": 45, "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": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20474, "totalSubmissionRaw": 64120}, "2167": {"acRate": 41.01056299684199, "difficulty": "Hard", "likes": 640, "dislikes": 11, "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": 11298, "totalSubmissionRaw": 27549}, "2168": {"acRate": 59.07651715039578, "difficulty": "Medium", "likes": 65, "dislikes": 6, "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": 2239, "totalSubmissionRaw": 3790}, "2169": {"acRate": 74.42395758013978, "difficulty": "Easy", "likes": 549, "dislikes": 19, "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": 61757, "totalSubmissionRaw": 82980}, "2170": {"acRate": 33.04899246764952, "difficulty": "Medium", "likes": 552, "dislikes": 322, "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": 20534, "totalSubmissionRaw": 62132}, "2171": {"acRate": 42.34779982590467, "difficulty": "Medium", "likes": 810, "dislikes": 45, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23838, "totalSubmissionRaw": 56291}, "2172": {"acRate": 48.55960591133005, "difficulty": "Hard", "likes": 471, "dislikes": 27, "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": 12322, "totalSubmissionRaw": 25375}, "2173": {"acRate": 52.13247172859451, "difficulty": "Hard", "likes": 86, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3227, "totalSubmissionRaw": 6190}, "2174": {"acRate": 68.03469103298745, "difficulty": "Medium", "likes": 81, "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": 4393, "totalSubmissionRaw": 6457}, "2175": {"acRate": 62.656769900179164, "difficulty": "Medium", "likes": 37, "dislikes": 13, "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": 4896, "totalSubmissionRaw": 7814}, "2176": {"acRate": 79.37751758260262, "difficulty": "Easy", "likes": 582, "dislikes": 24, "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": 61283, "totalSubmissionRaw": 77205}, "2177": {"acRate": 64.16641911740436, "difficulty": "Medium", "likes": 614, "dislikes": 200, "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": 38881, "totalSubmissionRaw": 60594}, "2178": {"acRate": 59.319530828434296, "difficulty": "Medium", "likes": 737, "dislikes": 70, "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": 41774, "totalSubmissionRaw": 70422}, "2179": {"acRate": 39.800569800569804, "difficulty": "Hard", "likes": 576, "dislikes": 24, "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": 6985, "totalSubmissionRaw": 17550}, "2180": {"acRate": 66.15660252156601, "difficulty": "Easy", "likes": 560, "dislikes": 25, "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": 49849, "totalSubmissionRaw": 75350}, "2181": {"acRate": 85.93463264979626, "difficulty": "Medium", "likes": 1564, "dislikes": 29, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 91315, "totalSubmissionRaw": 106261}, "2182": {"acRate": 52.94907666480134, "difficulty": "Medium", "likes": 591, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"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": 18924, "totalSubmissionRaw": 35740}, "2183": {"acRate": 28.584093211752787, "difficulty": "Hard", "likes": 777, "dislikes": 33, "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": 13542, "totalSubmissionRaw": 47376}, "2184": {"acRate": 50.25177982288592, "difficulty": "Medium", "likes": 144, "dislikes": 94, "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": 5788, "totalSubmissionRaw": 11518}, "2185": {"acRate": 77.36038322961022, "difficulty": "Easy", "likes": 624, "dislikes": 18, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75578, "totalSubmissionRaw": 97696}, "2186": {"acRate": 71.95272249722194, "difficulty": "Medium", "likes": 504, "dislikes": 15, "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": 35613, "totalSubmissionRaw": 49495}, "2187": {"acRate": 38.943108695491205, "difficulty": "Medium", "likes": 2659, "dislikes": 166, "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": 105183, "totalSubmissionRaw": 270094}, "2188": {"acRate": 41.38639978276892, "difficulty": "Hard", "likes": 531, "dislikes": 23, "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": 10669, "totalSubmissionRaw": 25779}, "2189": {"acRate": 63.554107853782114, "difficulty": "Medium", "likes": 62, "dislikes": 13, "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": 1756, "totalSubmissionRaw": 2763}, "2190": {"acRate": 59.16168818654847, "difficulty": "Easy", "likes": 332, "dislikes": 192, "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": 30699, "totalSubmissionRaw": 51890}, "2191": {"acRate": 46.03469161576329, "difficulty": "Medium", "likes": 347, "dislikes": 41, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 17861, "totalSubmissionRaw": 38799}, "2192": {"acRate": 51.48452946246008, "difficulty": "Medium", "likes": 989, "dislikes": 16, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30467, "totalSubmissionRaw": 59177}, "2193": {"acRate": 50.91694170781944, "difficulty": "Hard", "likes": 895, "dislikes": 68, "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": 20518, "totalSubmissionRaw": 40297}, "2194": {"acRate": 83.91639704183036, "difficulty": "Easy", "likes": 565, "dislikes": 85, "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": 58093, "totalSubmissionRaw": 69228}, "2195": {"acRate": 25.087968068903944, "difficulty": "Medium", "likes": 673, "dislikes": 298, "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": 28662, "totalSubmissionRaw": 114246}, "2196": {"acRate": 72.25724478326737, "difficulty": "Medium", "likes": 869, "dislikes": 17, "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": "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": 29572, "totalSubmissionRaw": 40926}, "2197": {"acRate": 38.64440314167516, "difficulty": "Hard", "likes": 408, "dislikes": 11, "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": 12891, "totalSubmissionRaw": 33358}, "2198": {"acRate": 56.17715617715617, "difficulty": "Medium", "likes": 25, "dislikes": 10, "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": 964, "totalSubmissionRaw": 1716}, "2199": {"acRate": 48.858131487889274, "difficulty": "Hard", "likes": 37, "dislikes": 12, "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": 2118, "totalSubmissionRaw": 4335}, "2200": {"acRate": 65.0940746981185, "difficulty": "Easy", "likes": 381, "dislikes": 58, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34770, "totalSubmissionRaw": 53415}, "2201": {"acRate": 55.812378812594254, "difficulty": "Medium", "likes": 191, "dislikes": 188, "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": 18134, "totalSubmissionRaw": 32491}, "2202": {"acRate": 22.840651412079986, "difficulty": "Medium", "likes": 580, "dislikes": 311, "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": 25484, "totalSubmissionRaw": 111573}, "2203": {"acRate": 36.22154146069762, "difficulty": "Hard", "likes": 634, "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": 10405, "totalSubmissionRaw": 28726}, "2204": {"acRate": 70.17388741526672, "difficulty": "Hard", "likes": 98, "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": 2381, "totalSubmissionRaw": 3393}, "2205": {"acRate": 50.230830991569654, "difficulty": "Easy", "likes": 24, "dislikes": 69, "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": 5005, "totalSubmissionRaw": 9964}, "2206": {"acRate": 73.30564406008193, "difficulty": "Easy", "likes": 643, "dislikes": 26, "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": 64421, "totalSubmissionRaw": 87880}, "2207": {"acRate": 33.87999841162689, "difficulty": "Medium", "likes": 453, "dislikes": 28, "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": 17064, "totalSubmissionRaw": 50366}, "2208": {"acRate": 45.870731018910526, "difficulty": "Medium", "likes": 538, "dislikes": 26, "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": 24378, "totalSubmissionRaw": 53145}, "2209": {"acRate": 35.0094690785607, "difficulty": "Hard", "likes": 481, "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": 10722, "totalSubmissionRaw": 30626}, "2210": {"acRate": 58.70009343870263, "difficulty": "Easy", "likes": 612, "dislikes": 84, "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": 37065, "totalSubmissionRaw": 63143}, "2211": {"acRate": 43.039567679609135, "difficulty": "Medium", "likes": 581, "dislikes": 213, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23256, "totalSubmissionRaw": 54034}, "2212": {"acRate": 49.605455778912415, "difficulty": "Medium", "likes": 470, "dislikes": 42, "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": 13893, "totalSubmissionRaw": 28007}, "2213": {"acRate": 31.719492868462755, "difficulty": "Hard", "likes": 271, "dislikes": 81, "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": 4003, "totalSubmissionRaw": 12620}, "2214": {"acRate": 57.84555041924316, "difficulty": "Medium", "likes": 305, "dislikes": 227, "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"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28906, "totalSubmissionRaw": 49971}, "2215": {"acRate": 78.32119705177159, "difficulty": "Easy", "likes": 2030, "dislikes": 81, "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": 211668, "totalSubmissionRaw": 270255}, "2216": {"acRate": 47.523004147226544, "difficulty": "Medium", "likes": 743, "dislikes": 92, "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": 29335, "totalSubmissionRaw": 61728}, "2217": {"acRate": 33.85453081633085, "difficulty": "Medium", "likes": 558, "dislikes": 243, "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": 15979, "totalSubmissionRaw": 47199}, "2218": {"acRate": 60.90687254980398, "difficulty": "Hard", "likes": 2184, "dislikes": 36, "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": 60901, "totalSubmissionRaw": 99988}, "2219": {"acRate": 62.06204379562044, "difficulty": "Medium", "likes": 60, "dislikes": 15, "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": 3401, "totalSubmissionRaw": 5480}, "2220": {"acRate": 82.790951776275, "difficulty": "Easy", "likes": 746, "dislikes": 14, "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": 56071, "totalSubmissionRaw": 67726}, "2221": {"acRate": 78.25328146020433, "difficulty": "Medium", "likes": 975, "dislikes": 49, "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": 64566, "totalSubmissionRaw": 82509}, "2222": {"acRate": 50.51230537418383, "difficulty": "Medium", "likes": 913, "dislikes": 41, "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": 30171, "totalSubmissionRaw": 59730}, "2223": {"acRate": 37.72496538994001, "difficulty": "Hard", "likes": 230, "dislikes": 180, "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": 6540, "totalSubmissionRaw": 17336}, "2224": {"acRate": 64.97207606802306, "difficulty": "Easy", "likes": 419, "dislikes": 33, "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": 36181, "totalSubmissionRaw": 55687}, "2225": {"acRate": 71.25971436709119, "difficulty": "Medium", "likes": 1480, "dislikes": 93, "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": 105072, "totalSubmissionRaw": 147452}, "2226": {"acRate": 37.342926406156174, "difficulty": "Medium", "likes": 992, "dislikes": 37, "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": 33581, "totalSubmissionRaw": 89926}, "2227": {"acRate": 39.623655913978496, "difficulty": "Hard", "likes": 312, "dislikes": 63, "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": 11055, "totalSubmissionRaw": 27900}, "2228": {"acRate": 43.713973002553814, "difficulty": "Medium", "likes": 54, "dislikes": 8, "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": 5989, "totalSubmissionRaw": 13699}, "2229": {"acRate": 60.83354905513849, "difficulty": "Easy", "likes": 70, "dislikes": 9, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4700, "totalSubmissionRaw": 7726}, "2230": {"acRate": 49.60064822317398, "difficulty": "Easy", "likes": 17, "dislikes": 38, "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": 4285, "totalSubmissionRaw": 8639}, "2231": {"acRate": 60.78968653538238, "difficulty": "Easy", "likes": 556, "dislikes": 288, "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": 36823, "totalSubmissionRaw": 60577}, "2232": {"acRate": 66.14074826212605, "difficulty": "Medium", "likes": 184, "dislikes": 316, "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": 16936, "totalSubmissionRaw": 25606}, "2233": {"acRate": 41.26489028213166, "difficulty": "Medium", "likes": 648, "dislikes": 38, "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": 26327, "totalSubmissionRaw": 63800}, "2234": {"acRate": 28.678349762687112, "difficulty": "Hard", "likes": 411, "dislikes": 37, "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": 6284, "totalSubmissionRaw": 21912}, "2235": {"acRate": 87.18947982660887, "difficulty": "Easy", "likes": 1318, "dislikes": 2921, "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": 376528, "totalSubmissionRaw": 431851}, "2236": {"acRate": 83.48763067493759, "difficulty": "Easy", "likes": 1060, "dislikes": 1383, "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": 168908, "totalSubmissionRaw": 202315}, "2237": {"acRate": 63.773388773388774, "difficulty": "Medium", "likes": 66, "dislikes": 5, "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": 2454, "totalSubmissionRaw": 3848}, "2238": {"acRate": 70.70941004388104, "difficulty": "Medium", "likes": 62, "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": 5801, "totalSubmissionRaw": 8204}, "2239": {"acRate": 44.56621528574708, "difficulty": "Easy", "likes": 510, "dislikes": 31, "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": 46602, "totalSubmissionRaw": 104568}, "2240": {"acRate": 56.95740463182324, "difficulty": "Medium", "likes": 417, "dislikes": 28, "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": 23561, "totalSubmissionRaw": 41366}, "2241": {"acRate": 39.48323518807836, "difficulty": "Medium", "likes": 217, "dislikes": 309, "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": 16427, "totalSubmissionRaw": 41605}, "2242": {"acRate": 38.03235273065636, "difficulty": "Hard", "likes": 487, "dislikes": 14, "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": 10627, "totalSubmissionRaw": 27942}, "2243": {"acRate": 65.75972146154449, "difficulty": "Easy", "likes": 511, "dislikes": 38, "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": 33619, "totalSubmissionRaw": 51124}, "2244": {"acRate": 62.757894081717026, "difficulty": "Medium", "likes": 2658, "dislikes": 78, "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": 141172, "totalSubmissionRaw": 224947}, "2245": {"acRate": 35.56481348465259, "difficulty": "Medium", "likes": 167, "dislikes": 391, "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": 7427, "totalSubmissionRaw": 20883}, "2246": {"acRate": 55.0601534371682, "difficulty": "Hard", "likes": 2284, "dislikes": 59, "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": 68970, "totalSubmissionRaw": 125263}, "2247": {"acRate": 50.50847457627119, "difficulty": "Hard", "likes": 55, "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": 1341, "totalSubmissionRaw": 2655}, "2248": {"acRate": 68.18732966238389, "difficulty": "Easy", "likes": 638, "dislikes": 35, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61296, "totalSubmissionRaw": 89894}, "2249": {"acRate": 51.28921568627452, "difficulty": "Medium", "likes": 209, "dislikes": 212, "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": 20926, "totalSubmissionRaw": 40800}, "2250": {"acRate": 34.22748126049788, "difficulty": "Medium", "likes": 462, "dislikes": 131, "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": 13653, "totalSubmissionRaw": 39889}, "2251": {"acRate": 57.16131490239277, "difficulty": "Hard", "likes": 1490, "dislikes": 38, "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": 69016, "totalSubmissionRaw": 120737}, "2252": {"acRate": 53.04964539007092, "difficulty": "Hard", "likes": 26, "dislikes": 7, "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": 1122, "totalSubmissionRaw": 2115}, "2253": {"acRate": 66.25129802699897, "difficulty": "Hard", "likes": 13, "dislikes": 11, "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": 638, "totalSubmissionRaw": 963}, "2254": {"acRate": 63.28015673103834, "difficulty": "Hard", "likes": 67, "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": 2261, "totalSubmissionRaw": 3573}, "2255": {"acRate": 72.4403028538148, "difficulty": "Easy", "likes": 496, "dislikes": 17, "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": 49752, "totalSubmissionRaw": 68680}, "2256": {"acRate": 43.01979846915116, "difficulty": "Medium", "likes": 1445, "dislikes": 164, "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": 78854, "totalSubmissionRaw": 183297}, "2257": {"acRate": 51.962982737141836, "difficulty": "Medium", "likes": 390, "dislikes": 33, "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": 14599, "totalSubmissionRaw": 28095}, "2258": {"acRate": 34.48400144167234, "difficulty": "Hard", "likes": 646, "dislikes": 24, "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": 8611, "totalSubmissionRaw": 24971}, "2259": {"acRate": 45.14246725278787, "difficulty": "Easy", "likes": 728, "dislikes": 41, "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": 63515, "totalSubmissionRaw": 140699}, "2260": {"acRate": 50.642311185106706, "difficulty": "Medium", "likes": 838, "dislikes": 26, "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": 53535, "totalSubmissionRaw": 105712}, "2261": {"acRate": 49.05010663066659, "difficulty": "Medium", "likes": 575, "dislikes": 136, "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": 25070, "totalSubmissionRaw": 51111}, "2262": {"acRate": 55.65891472868218, "difficulty": "Hard", "likes": 1002, "dislikes": 24, "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": 26925, "totalSubmissionRaw": 48375}, "2263": {"acRate": 64.96815286624204, "difficulty": "Hard", "likes": 67, "dislikes": 4, "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": 1122, "totalSubmissionRaw": 1727}, "2264": {"acRate": 60.02250782881002, "difficulty": "Easy", "likes": 343, "dislikes": 19, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 36801, "totalSubmissionRaw": 61312}, "2265": {"acRate": 84.81948124515583, "difficulty": "Medium", "likes": 1263, "dislikes": 24, "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": 47057, "totalSubmissionRaw": 55479}, "2266": {"acRate": 47.21981357034468, "difficulty": "Medium", "likes": 802, "dislikes": 25, "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": 17426, "totalSubmissionRaw": 36904}, "2267": {"acRate": 38.03821165069926, "difficulty": "Hard", "likes": 484, "dislikes": 6, "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": 13817, "totalSubmissionRaw": 36324}, "2268": {"acRate": 71.45401801618402, "difficulty": "Medium", "likes": 198, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14040, "totalSubmissionRaw": 19649}, "2269": {"acRate": 58.408427627873635, "difficulty": "Easy", "likes": 583, "dislikes": 37, "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": 45631, "totalSubmissionRaw": 78124}, "2270": {"acRate": 46.45993774751209, "difficulty": "Medium", "likes": 497, "dislikes": 39, "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": 31793, "totalSubmissionRaw": 68431}, "2271": {"acRate": 33.33407946278679, "difficulty": "Medium", "likes": 734, "dislikes": 42, "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": 14892, "totalSubmissionRaw": 44675}, "2272": {"acRate": 46.82022815682503, "difficulty": "Hard", "likes": 1796, "dislikes": 202, "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": 64271, "totalSubmissionRaw": 137273}, "2273": {"acRate": 57.817959887032686, "difficulty": "Easy", "likes": 585, "dislikes": 143, "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": 48315, "totalSubmissionRaw": 83564}, "2274": {"acRate": 51.906456532791054, "difficulty": "Medium", "likes": 361, "dislikes": 34, "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": 28588, "totalSubmissionRaw": 55076}, "2275": {"acRate": 72.49025793282613, "difficulty": "Medium", "likes": 522, "dislikes": 13, "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": 23439, "totalSubmissionRaw": 32334}, "2276": {"acRate": 34.534178802870876, "difficulty": "Hard", "likes": 520, "dislikes": 55, "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": 14868, "totalSubmissionRaw": 43051}, "2277": {"acRate": 62.947925860547215, "difficulty": "Hard", "likes": 110, "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": 3566, "totalSubmissionRaw": 5665}, "2278": {"acRate": 73.91518800035412, "difficulty": "Easy", "likes": 454, "dislikes": 50, "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": 58443, "totalSubmissionRaw": 79068}, "2279": {"acRate": 67.59711225318647, "difficulty": "Medium", "likes": 1612, "dislikes": 66, "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": 89045, "totalSubmissionRaw": 131729}, "2280": {"acRate": 24.873269040553907, "difficulty": "Medium", "likes": 318, "dislikes": 503, "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": 24141, "totalSubmissionRaw": 97056}, "2281": {"acRate": 27.45277891017801, "difficulty": "Hard", "likes": 1090, "dislikes": 87, "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": 16162, "totalSubmissionRaw": 58872}, "2282": {"acRate": 49.028646690813304, "difficulty": "Medium", "likes": 51, "dislikes": 23, "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": 1489, "totalSubmissionRaw": 3037}, "2283": {"acRate": 72.57824604896189, "difficulty": "Easy", "likes": 533, "dislikes": 63, "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": 46842, "totalSubmissionRaw": 64540}, "2284": {"acRate": 56.161360893180444, "difficulty": "Medium", "likes": 390, "dislikes": 33, "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": 29779, "totalSubmissionRaw": 53024}, "2285": {"acRate": 60.75715028601144, "difficulty": "Medium", "likes": 682, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29208, "totalSubmissionRaw": 48073}, "2286": {"acRate": 15.74650534476683, "difficulty": "Hard", "likes": 294, "dislikes": 53, "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": 5362, "totalSubmissionRaw": 34052}, "2287": {"acRate": 58.00738007380074, "difficulty": "Easy", "likes": 422, "dislikes": 31, "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": 34584, "totalSubmissionRaw": 59620}, "2288": {"acRate": 28.567566349749924, "difficulty": "Medium", "likes": 172, "dislikes": 1061, "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": 19020, "totalSubmissionRaw": 66579}, "2289": {"acRate": 21.22583348297121, "difficulty": "Medium", "likes": 1238, "dislikes": 120, "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": 17731, "totalSubmissionRaw": 83535}, "2290": {"acRate": 51.5980533999737, "difficulty": "Hard", "likes": 860, "dislikes": 15, "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": 19615, "totalSubmissionRaw": 38015}, "2291": {"acRate": 45.07306477093207, "difficulty": "Medium", "likes": 126, "dislikes": 4, "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": 4565, "totalSubmissionRaw": 10128}, "2292": {"acRate": 38.296736810003054, "difficulty": "Medium", "likes": 55, "dislikes": 24, "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": 5023, "totalSubmissionRaw": 13116}, "2293": {"acRate": 63.13584407304522, "difficulty": "Easy", "likes": 494, "dislikes": 22, "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": 41589, "totalSubmissionRaw": 65874}, "2294": {"acRate": 73.0336619084625, "difficulty": "Medium", "likes": 685, "dislikes": 23, "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": 35712, "totalSubmissionRaw": 48898}, "2295": {"acRate": 57.6751721344674, "difficulty": "Medium", "likes": 580, "dislikes": 32, "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": 31328, "totalSubmissionRaw": 54318}, "2296": {"acRate": 42.378418949645685, "difficulty": "Hard", "likes": 506, "dislikes": 220, "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": 19197, "totalSubmissionRaw": 45299}, "2297": {"acRate": 50.585175552665795, "difficulty": "Medium", "likes": 117, "dislikes": 25, "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": 2723, "totalSubmissionRaw": 5383}, "2298": {"acRate": 82.06697875405114, "difficulty": "Medium", "likes": 40, "dislikes": 8, "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": 4558, "totalSubmissionRaw": 5554}, "2299": {"acRate": 55.08214112985007, "difficulty": "Easy", "likes": 313, "dislikes": 37, "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": 35304, "totalSubmissionRaw": 64093}, "2300": {"acRate": 41.817123988923015, "difficulty": "Medium", "likes": 2353, "dislikes": 54, "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": 110686, "totalSubmissionRaw": 264690}, "2301": {"acRate": 39.70826066275567, "difficulty": "Hard", "likes": 358, "dislikes": 73, "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": 12522, "totalSubmissionRaw": 31535}, "2302": {"acRate": 53.5274944800757, "difficulty": "Hard", "likes": 900, "dislikes": 20, "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": 20364, "totalSubmissionRaw": 38044}, "2303": {"acRate": 64.34419745273317, "difficulty": "Easy", "likes": 226, "dislikes": 263, "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": 32535, "totalSubmissionRaw": 50564}, "2304": {"acRate": 65.99005482595945, "difficulty": "Medium", "likes": 805, "dislikes": 129, "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": 25878, "totalSubmissionRaw": 39215}, "2305": {"acRate": 69.74233722064304, "difficulty": "Medium", "likes": 2377, "dislikes": 102, "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": 83665, "totalSubmissionRaw": 119963}, "2306": {"acRate": 46.7710466876614, "difficulty": "Hard", "likes": 1912, "dislikes": 66, "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": 57773, "totalSubmissionRaw": 123523}, "2307": {"acRate": 42.482100238663485, "difficulty": "Hard", "likes": 38, "dislikes": 22, "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": 1780, "totalSubmissionRaw": 4190}, "2308": {"acRate": 68.38925107330259, "difficulty": "Medium", "likes": 68, "dislikes": 14, "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": 4301, "totalSubmissionRaw": 6289}, "2309": {"acRate": 69.09965301028794, "difficulty": "Easy", "likes": 438, "dislikes": 28, "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": 45403, "totalSubmissionRaw": 65706}, "2310": {"acRate": 26.253654769128925, "difficulty": "Medium", "likes": 375, "dislikes": 318, "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": 23795, "totalSubmissionRaw": 90635}, "2311": {"acRate": 37.36913298867827, "difficulty": "Medium", "likes": 647, "dislikes": 45, "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": 20167, "totalSubmissionRaw": 53967}, "2312": {"acRate": 49.06024096385542, "difficulty": "Hard", "likes": 516, "dislikes": 9, "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": 9162, "totalSubmissionRaw": 18675}, "2313": {"acRate": 60.063897763578275, "difficulty": "Hard", "likes": 72, "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": 2068, "totalSubmissionRaw": 3443}, "2314": {"acRate": 71.31517228937399, "difficulty": "Medium", "likes": 48, "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": 3953, "totalSubmissionRaw": 5543}, "2315": {"acRate": 81.5827041664827, "difficulty": "Easy", "likes": 558, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55432, "totalSubmissionRaw": 67946}, "2316": {"acRate": 49.99164438502674, "difficulty": "Medium", "likes": 1871, "dislikes": 44, "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": 77779, "totalSubmissionRaw": 155584}, "2317": {"acRate": 79.30652190534444, "difficulty": "Medium", "likes": 552, "dislikes": 156, "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": 20745, "totalSubmissionRaw": 26158}, "2318": {"acRate": 56.62218564458291, "difficulty": "Hard", "likes": 408, "dislikes": 17, "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": 9632, "totalSubmissionRaw": 17011}, "2319": {"acRate": 65.43278353525032, "difficulty": "Easy", "likes": 448, "dislikes": 19, "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": 44828, "totalSubmissionRaw": 68502}, "2320": {"acRate": 41.0541503989136, "difficulty": "Medium", "likes": 523, "dislikes": 187, "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": 24185, "totalSubmissionRaw": 58910}, "2321": {"acRate": 56.1496451813336, "difficulty": "Hard", "likes": 738, "dislikes": 11, "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": 17170, "totalSubmissionRaw": 30579}, "2322": {"acRate": 51.430881164106715, "difficulty": "Hard", "likes": 429, "dislikes": 13, "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": 6362, "totalSubmissionRaw": 12370}, "2323": {"acRate": 69.06448005963473, "difficulty": "Medium", "likes": 46, "dislikes": 14, "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": 3706, "totalSubmissionRaw": 5366}, "2324": {"acRate": 73.58490566037736, "difficulty": "Medium", "likes": 41, "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": 5109, "totalSubmissionRaw": 6943}, "2325": {"acRate": 83.83099296752316, "difficulty": "Easy", "likes": 844, "dislikes": 79, "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": 73669, "totalSubmissionRaw": 87878}, "2326": {"acRate": 75.11772545535318, "difficulty": "Medium", "likes": 675, "dislikes": 25, "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": 33818, "totalSubmissionRaw": 45020}, "2327": {"acRate": 44.90821121837165, "difficulty": "Medium", "likes": 747, "dislikes": 109, "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": 19399, "totalSubmissionRaw": 43197}, "2328": {"acRate": 59.10100885943099, "difficulty": "Hard", "likes": 1876, "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": 62505, "totalSubmissionRaw": 105761}, "2329": {"acRate": 68.67042919018243, "difficulty": "Easy", "likes": 29, "dislikes": 6, "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": 5232, "totalSubmissionRaw": 7619}, "2330": {"acRate": 75.56380638063807, "difficulty": "Medium", "likes": 77, "dislikes": 19, "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": 5495, "totalSubmissionRaw": 7272}, "2331": {"acRate": 77.93058462207485, "difficulty": "Easy", "likes": 856, "dislikes": 21, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 57346, "totalSubmissionRaw": 73586}, "2332": {"acRate": 25.7616276021184, "difficulty": "Medium", "likes": 400, "dislikes": 682, "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": 19652, "totalSubmissionRaw": 76284}, "2333": {"acRate": 25.35741613305948, "difficulty": "Medium", "likes": 589, "dislikes": 34, "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": 12593, "totalSubmissionRaw": 49661}, "2334": {"acRate": 42.53962784286699, "difficulty": "Hard", "likes": 499, "dislikes": 6, "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": 7407, "totalSubmissionRaw": 17412}, "2335": {"acRate": 57.05446927374302, "difficulty": "Easy", "likes": 630, "dislikes": 74, "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": 40851, "totalSubmissionRaw": 71600}, "2336": {"acRate": 73.27407947400518, "difficulty": "Medium", "likes": 1470, "dislikes": 153, "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": 104534, "totalSubmissionRaw": 142662}, "2337": {"acRate": 47.6185619581846, "difficulty": "Medium", "likes": 623, "dislikes": 41, "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": 23345, "totalSubmissionRaw": 49025}, "2338": {"acRate": 26.36782491841044, "difficulty": "Hard", "likes": 456, "dislikes": 26, "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": 5494, "totalSubmissionRaw": 20836}, "2339": {"acRate": 87.05545509342979, "difficulty": "Easy", "likes": 39, "dislikes": 3, "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": 5777, "totalSubmissionRaw": 6636}, "2340": {"acRate": 73.28100892198296, "difficulty": "Medium", "likes": 126, "dislikes": 20, "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": 10924, "totalSubmissionRaw": 14907}, "2341": {"acRate": 75.43827053999178, "difficulty": "Easy", "likes": 613, "dislikes": 15, "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": 56845, "totalSubmissionRaw": 75353}, "2342": {"acRate": 53.81068770136651, "difficulty": "Medium", "likes": 632, "dislikes": 12, "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": 38747, "totalSubmissionRaw": 72007}, "2343": {"acRate": 41.8395387682526, "difficulty": "Medium", "likes": 247, "dislikes": 397, "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": 23295, "totalSubmissionRaw": 55677}, "2344": {"acRate": 56.22352810732897, "difficulty": "Hard", "likes": 524, "dislikes": 122, "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": 25354, "totalSubmissionRaw": 45095}, "2345": {"acRate": 38.2676957582954, "difficulty": "Medium", "likes": 126, "dislikes": 59, "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": 5801, "totalSubmissionRaw": 15159}, "2346": {"acRate": 32.91649858814038, "difficulty": "Medium", "likes": 23, "dislikes": 69, "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": 3264, "totalSubmissionRaw": 9916}, "2347": {"acRate": 60.23855858274057, "difficulty": "Easy", "likes": 337, "dislikes": 31, "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": 35907, "totalSubmissionRaw": 59608}, "2348": {"acRate": 66.6680299135312, "difficulty": "Medium", "likes": 2149, "dislikes": 71, "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": 114108, "totalSubmissionRaw": 171159}, "2349": {"acRate": 45.118721766027996, "difficulty": "Medium", "likes": 340, "dislikes": 28, "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": 20275, "totalSubmissionRaw": 44937}, "2350": {"acRate": 68.09450436569081, "difficulty": "Hard", "likes": 600, "dislikes": 43, "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": 13258, "totalSubmissionRaw": 19470}, "2351": {"acRate": 73.66000368614178, "difficulty": "Easy", "likes": 908, "dislikes": 51, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87925, "totalSubmissionRaw": 119363}, "2352": {"acRate": 72.8096904225253, "difficulty": "Medium", "likes": 1919, "dislikes": 112, "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": 145038, "totalSubmissionRaw": 199203}, "2353": {"acRate": 34.478971387452894, "difficulty": "Medium", "likes": 496, "dislikes": 96, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 18208, "totalSubmissionRaw": 52809}, "2354": {"acRate": 46.50199985965897, "difficulty": "Hard", "likes": 557, "dislikes": 17, "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": 13254, "totalSubmissionRaw": 28502}, "2355": {"acRate": 41.96668078497812, "difficulty": "Hard", "likes": 190, "dislikes": 20, "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": 5940, "totalSubmissionRaw": 14158}, "2356": {"acRate": 86.32801945420157, "difficulty": "Easy", "likes": 284, "dislikes": 14, "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": 60705, "totalSubmissionRaw": 70319}, "2357": {"acRate": 71.83043873667853, "difficulty": "Easy", "likes": 1032, "dislikes": 41, "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": 81351, "totalSubmissionRaw": 113255}, "2358": {"acRate": 67.72324888834495, "difficulty": "Medium", "likes": 610, "dislikes": 102, "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": 33202, "totalSubmissionRaw": 49026}, "2359": {"acRate": 45.699636965798355, "difficulty": "Medium", "likes": 1608, "dislikes": 382, "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": 71753, "totalSubmissionRaw": 157010}, "2360": {"acRate": 50.18577806497092, "difficulty": "Hard", "likes": 2214, "dislikes": 44, "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": 68345, "totalSubmissionRaw": 136184}, "2361": {"acRate": 79.36051733429136, "difficulty": "Hard", "likes": 172, "dislikes": 29, "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": 8836, "totalSubmissionRaw": 11134}, "2362": {"acRate": 73.54735152487962, "difficulty": "Hard", "likes": 28, "dislikes": 24, "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": 2291, "totalSubmissionRaw": 3115}, "2363": {"acRate": 75.4149377593361, "difficulty": "Easy", "likes": 491, "dislikes": 19, "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": 45074, "totalSubmissionRaw": 59768}, "2364": {"acRate": 41.11548860563924, "difficulty": "Medium", "likes": 892, "dislikes": 22, "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": 26612, "totalSubmissionRaw": 64725}, "2365": {"acRate": 47.27185376678639, "difficulty": "Medium", "likes": 457, "dislikes": 31, "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": 20663, "totalSubmissionRaw": 43711}, "2366": {"acRate": 54.107404924537526, "difficulty": "Hard", "likes": 1888, "dislikes": 62, "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": 59727, "totalSubmissionRaw": 110386}, "2367": {"acRate": 83.44432194046306, "difficulty": "Easy", "likes": 1102, "dislikes": 61, "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": 94604, "totalSubmissionRaw": 113374}, "2368": {"acRate": 58.442713488545564, "difficulty": "Medium", "likes": 603, "dislikes": 25, "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40741, "totalSubmissionRaw": 69711}, "2369": {"acRate": 51.93235767253894, "difficulty": "Medium", "likes": 1893, "dislikes": 188, "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": 79416, "totalSubmissionRaw": 152922}, "2370": {"acRate": 37.50388775615993, "difficulty": "Medium", "likes": 739, "dislikes": 22, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21705, "totalSubmissionRaw": 57873}, "2371": {"acRate": 65.37250786988457, "difficulty": "Hard", "likes": 78, "dislikes": 2, "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": 1869, "totalSubmissionRaw": 2859}, "2372": {"acRate": 82.83983849259758, "difficulty": "Medium", "likes": 31, "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": 3693, "totalSubmissionRaw": 4458}, "2373": {"acRate": 82.88405078735654, "difficulty": "Easy", "likes": 649, "dislikes": 72, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43476, "totalSubmissionRaw": 52454}, "2374": {"acRate": 46.72315572789507, "difficulty": "Medium", "likes": 394, "dislikes": 32, "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": 29280, "totalSubmissionRaw": 62667}, "2375": {"acRate": 75.15064075362811, "difficulty": "Medium", "likes": 835, "dislikes": 34, "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": 26565, "totalSubmissionRaw": 35349}, "2376": {"acRate": 37.71519698452394, "difficulty": "Hard", "likes": 535, "dislikes": 30, "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": 10406, "totalSubmissionRaw": 27591}, "2377": {"acRate": 77.95373665480427, "difficulty": "Easy", "likes": 34, "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": 4381, "totalSubmissionRaw": 5620}, "2378": {"acRate": 59.305339554173145, "difficulty": "Medium", "likes": 44, "dislikes": 11, "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": 1144, "totalSubmissionRaw": 1929}, "2379": {"acRate": 58.17226108190886, "difficulty": "Easy", "likes": 662, "dislikes": 17, "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": 42165, "totalSubmissionRaw": 72483}, "2380": {"acRate": 49.438477944923655, "difficulty": "Medium", "likes": 421, "dislikes": 103, "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": 26193, "totalSubmissionRaw": 52981}, "2381": {"acRate": 35.99490424919865, "difficulty": "Medium", "likes": 698, "dislikes": 18, "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": 17518, "totalSubmissionRaw": 48668}, "2382": {"acRate": 48.492958643981396, "difficulty": "Hard", "likes": 426, "dislikes": 5, "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": 7610, "totalSubmissionRaw": 15693}, "2383": {"acRate": 40.83426861204639, "difficulty": "Easy", "likes": 293, "dislikes": 261, "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": 28378, "totalSubmissionRaw": 69497}, "2384": {"acRate": 31.950420827582477, "difficulty": "Medium", "likes": 525, "dislikes": 205, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23612, "totalSubmissionRaw": 73902}, "2385": {"acRate": 58.64393952424363, "difficulty": "Medium", "likes": 1422, "dislikes": 13, "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": "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": 34095, "totalSubmissionRaw": 58136}, "2386": {"acRate": 38.23243610922165, "difficulty": "Hard", "likes": 530, "dislikes": 18, "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": 7869, "totalSubmissionRaw": 20582}, "2387": {"acRate": 69.18054195233432, "difficulty": "Medium", "likes": 60, "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": 2119, "totalSubmissionRaw": 3063}, "2388": {"acRate": 52.25035161744023, "difficulty": "Medium", "likes": 71, "dislikes": 26, "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": 2972, "totalSubmissionRaw": 5688}, "2389": {"acRate": 71.75750040293799, "difficulty": "Easy", "likes": 1739, "dislikes": 154, "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": 93495, "totalSubmissionRaw": 130293}, "2390": {"acRate": 73.50577579621806, "difficulty": "Medium", "likes": 2543, "dislikes": 174, "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": 188605, "totalSubmissionRaw": 256586}, "2391": {"acRate": 82.7799453765119, "difficulty": "Medium", "likes": 751, "dislikes": 75, "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": 42433, "totalSubmissionRaw": 51260}, "2392": {"acRate": 60.5350544876292, "difficulty": "Hard", "likes": 726, "dislikes": 8, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12943, "totalSubmissionRaw": 21381}, "2393": {"acRate": 76.35971223021582, "difficulty": "Medium", "likes": 116, "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": 5307, "totalSubmissionRaw": 6950}, "2394": {"acRate": 40.78947368421053, "difficulty": "Medium", "likes": 24, "dislikes": 33, "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": 2852, "totalSubmissionRaw": 6992}, "2395": {"acRate": 64.704878880928, "difficulty": "Easy", "likes": 469, "dislikes": 25, "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": 41723, "totalSubmissionRaw": 64482}, "2396": {"acRate": 87.32727152054159, "difficulty": "Medium", "likes": 505, "dislikes": 1355, "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": 65788, "totalSubmissionRaw": 75335}, "2397": {"acRate": 53.983232756874976, "difficulty": "Medium", "likes": 247, "dislikes": 384, "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": 13329, "totalSubmissionRaw": 24691}, "2398": {"acRate": 33.608212722988895, "difficulty": "Hard", "likes": 741, "dislikes": 14, "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": 17973, "totalSubmissionRaw": 53478}, "2399": {"acRate": 70.00051106454745, "difficulty": "Easy", "likes": 429, "dislikes": 45, "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": 41091, "totalSubmissionRaw": 58701}, "2400": {"acRate": 33.65856324901953, "difficulty": "Medium", "likes": 652, "dislikes": 53, "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": 24628, "totalSubmissionRaw": 73172}, "2401": {"acRate": 49.986139711706, "difficulty": "Medium", "likes": 1108, "dislikes": 24, "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": 25245, "totalSubmissionRaw": 50504}, "2402": {"acRate": 33.30590084999754, "difficulty": "Hard", "likes": 792, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "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": 27115, "totalSubmissionRaw": 81411}, "2403": {"acRate": 55.206185567010316, "difficulty": "Hard", "likes": 38, "dislikes": 3, "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": 1071, "totalSubmissionRaw": 1940}, "2404": {"acRate": 50.34253734943634, "difficulty": "Easy", "likes": 830, "dislikes": 30, "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": 62609, "totalSubmissionRaw": 124366}, "2405": {"acRate": 78.86089155691992, "difficulty": "Medium", "likes": 2398, "dislikes": 95, "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": 144370, "totalSubmissionRaw": 183069}, "2406": {"acRate": 46.551385340931425, "difficulty": "Medium", "likes": 720, "dislikes": 10, "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": 23690, "totalSubmissionRaw": 50890}, "2407": {"acRate": 22.075732336570105, "difficulty": "Hard", "likes": 762, "dislikes": 32, "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": 10867, "totalSubmissionRaw": 49226}, "2408": {"acRate": 77.96739684156903, "difficulty": "Medium", "likes": 35, "dislikes": 55, "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": 3061, "totalSubmissionRaw": 3926}, "2409": {"acRate": 44.452245600525444, "difficulty": "Easy", "likes": 226, "dislikes": 576, "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": 19627, "totalSubmissionRaw": 44153}, "2410": {"acRate": 61.604194989318316, "difficulty": "Medium", "likes": 432, "dislikes": 13, "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": 28548, "totalSubmissionRaw": 46341}, "2411": {"acRate": 42.786530738337966, "difficulty": "Medium", "likes": 524, "dislikes": 22, "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": 11080, "totalSubmissionRaw": 25896}, "2412": {"acRate": 39.72990996999, "difficulty": "Hard", "likes": 378, "dislikes": 33, "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": 9532, "totalSubmissionRaw": 23992}, "2413": {"acRate": 87.3803752381376, "difficulty": "Easy", "likes": 773, "dislikes": 85, "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": 117877, "totalSubmissionRaw": 134901}, "2414": {"acRate": 57.31693097014925, "difficulty": "Medium", "likes": 451, "dislikes": 29, "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": 39324, "totalSubmissionRaw": 68608}, "2415": {"acRate": 77.41177796985981, "difficulty": "Medium", "likes": 977, "dislikes": 35, "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": 41197, "totalSubmissionRaw": 53217}, "2416": {"acRate": 44.612379392671805, "difficulty": "Hard", "likes": 621, "dislikes": 49, "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": 22610, "totalSubmissionRaw": 50681}, "2417": {"acRate": 44.50076026355803, "difficulty": "Medium", "likes": 22, "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": 878, "totalSubmissionRaw": 1973}, "2418": {"acRate": 80.05128983550503, "difficulty": "Easy", "likes": 1126, "dislikes": 18, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 100201, "totalSubmissionRaw": 125171}, "2419": {"acRate": 49.02678293366552, "difficulty": "Medium", "likes": 429, "dislikes": 37, "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": 25188, "totalSubmissionRaw": 51376}, "2420": {"acRate": 38.030560271646856, "difficulty": "Medium", "likes": 585, "dislikes": 28, "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": 20608, "totalSubmissionRaw": 54188}, "2421": {"acRate": 56.842465073711836, "difficulty": "Hard", "likes": 2099, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51551, "totalSubmissionRaw": 90691}, "2422": {"acRate": 66.32566069906224, "difficulty": "Medium", "likes": 94, "dislikes": 9, "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": 3889, "totalSubmissionRaw": 5864}, "2423": {"acRate": 17.30571730672913, "difficulty": "Easy", "likes": 562, "dislikes": 1077, "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": 34207, "totalSubmissionRaw": 197663}, "2424": {"acRate": 54.44844235323062, "difficulty": "Medium", "likes": 315, "dislikes": 19, "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": 17705, "totalSubmissionRaw": 32517}, "2425": {"acRate": 58.321955215729105, "difficulty": "Medium", "likes": 363, "dislikes": 11, "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": 17086, "totalSubmissionRaw": 29296}, "2426": {"acRate": 43.45465276411568, "difficulty": "Hard", "likes": 494, "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": 11044, "totalSubmissionRaw": 25415}, "2427": {"acRate": 78.83906976744186, "difficulty": "Easy", "likes": 488, "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": 63564, "totalSubmissionRaw": 80625}, "2428": {"acRate": 74.67044390121313, "difficulty": "Medium", "likes": 404, "dislikes": 52, "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": 32684, "totalSubmissionRaw": 43771}, "2429": {"acRate": 43.37040019150001, "difficulty": "Medium", "likes": 428, "dislikes": 19, "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": 19930, "totalSubmissionRaw": 45953}, "2430": {"acRate": 32.23771214458894, "difficulty": "Hard", "likes": 446, "dislikes": 51, "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": 11701, "totalSubmissionRaw": 36296}, "2431": {"acRate": 64.23584173778123, "difficulty": "Medium", "likes": 42, "dislikes": 0, "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": 1656, "totalSubmissionRaw": 2578}, "2432": {"acRate": 49.17218277691408, "difficulty": "Easy", "likes": 246, "dislikes": 62, "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": 30680, "totalSubmissionRaw": 62393}, "2433": {"acRate": 85.6645857090396, "difficulty": "Medium", "likes": 635, "dislikes": 31, "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": 44322, "totalSubmissionRaw": 51739}, "2434": {"acRate": 38.924919235346984, "difficulty": "Medium", "likes": 603, "dislikes": 170, "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": 16025, "totalSubmissionRaw": 41169}, "2435": {"acRate": 42.34801733894215, "difficulty": "Hard", "likes": 827, "dislikes": 28, "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": 19831, "totalSubmissionRaw": 46830}, "2436": {"acRate": 72.27968556061232, "difficulty": "Medium", "likes": 33, "dislikes": 9, "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": 1747, "totalSubmissionRaw": 2417}, "2437": {"acRate": 43.29107183089937, "difficulty": "Easy", "likes": 224, "dislikes": 195, "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": 21136, "totalSubmissionRaw": 48823}, "2438": {"acRate": 39.469078965080904, "difficulty": "Medium", "likes": 274, "dislikes": 44, "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": 14660, "totalSubmissionRaw": 37143}, "2439": {"acRate": 46.81706444285403, "difficulty": "Medium", "likes": 2298, "dislikes": 589, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 75228, "totalSubmissionRaw": 160685}, "2440": {"acRate": 53.75632541845076, "difficulty": "Hard", "likes": 362, "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": 5524, "totalSubmissionRaw": 10276}, "2441": {"acRate": 67.6687634452523, "difficulty": "Easy", "likes": 446, "dislikes": 10, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49699, "totalSubmissionRaw": 73445}, "2442": {"acRate": 78.73098144123057, "difficulty": "Medium", "likes": 519, "dislikes": 48, "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": 47089, "totalSubmissionRaw": 59810}, "2443": {"acRate": 46.53749393123538, "difficulty": "Medium", "likes": 231, "dislikes": 287, "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": 31632, "totalSubmissionRaw": 67971}, "2444": {"acRate": 61.54065011736254, "difficulty": "Hard", "likes": 2321, "dislikes": 50, "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": 60562, "totalSubmissionRaw": 98411}, "2445": {"acRate": 69.78354978354979, "difficulty": "Medium", "likes": 67, "dislikes": 5, "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": 1612, "totalSubmissionRaw": 2310}, "2446": {"acRate": 50.12518357927128, "difficulty": "Easy", "likes": 401, "dislikes": 56, "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": 35837, "totalSubmissionRaw": 71495}, "2447": {"acRate": 49.16661118139246, "difficulty": "Medium", "likes": 409, "dislikes": 59, "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": 22153, "totalSubmissionRaw": 45057}, "2448": {"acRate": 45.93887634420622, "difficulty": "Hard", "likes": 2293, "dislikes": 32, "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": 61643, "totalSubmissionRaw": 134186}, "2449": {"acRate": 62.176076883473485, "difficulty": "Hard", "likes": 389, "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": 10869, "totalSubmissionRaw": 17481}, "2450": {"acRate": 64.82635796972396, "difficulty": "Medium", "likes": 30, "dislikes": 6, "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": 728, "totalSubmissionRaw": 1123}, "2451": {"acRate": 58.8126604756077, "difficulty": "Easy", "likes": 360, "dislikes": 104, "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": 24509, "totalSubmissionRaw": 41673}, "2452": {"acRate": 60.29186618456627, "difficulty": "Medium", "likes": 262, "dislikes": 17, "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": 18509, "totalSubmissionRaw": 30699}, "2453": {"acRate": 38.52955457310061, "difficulty": "Medium", "likes": 528, "dislikes": 16, "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": 15077, "totalSubmissionRaw": 39131}, "2454": {"acRate": 38.107691589221496, "difficulty": "Hard", "likes": 587, "dislikes": 7, "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": 8160, "totalSubmissionRaw": 21413}, "2455": {"acRate": 59.627477513332806, "difficulty": "Easy", "likes": 284, "dislikes": 33, "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": 44946, "totalSubmissionRaw": 75378}, "2456": {"acRate": 43.46542072552563, "difficulty": "Medium", "likes": 231, "dislikes": 350, "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": 19722, "totalSubmissionRaw": 45374}, "2457": {"acRate": 37.09070819964728, "difficulty": "Medium", "likes": 496, "dislikes": 23, "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": 17455, "totalSubmissionRaw": 47062}, "2458": {"acRate": 38.676308371123916, "difficulty": "Hard", "likes": 678, "dislikes": 16, "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": 15778, "totalSubmissionRaw": 40795}, "2459": {"acRate": 46.692776327241084, "difficulty": "Hard", "likes": 41, "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": 1073, "totalSubmissionRaw": 2298}, "2460": {"acRate": 67.15770614415516, "difficulty": "Easy", "likes": 460, "dislikes": 19, "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": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47230, "totalSubmissionRaw": 70327}, "2461": {"acRate": 33.89671175673135, "difficulty": "Medium", "likes": 1052, "dislikes": 14, "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": 34255, "totalSubmissionRaw": 101057}, "2462": {"acRate": 44.335413190161795, "difficulty": "Medium", "likes": 1675, "dislikes": 428, "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": 73329, "totalSubmissionRaw": 165393}, "2463": {"acRate": 40.05270092226614, "difficulty": "Hard", "likes": 448, "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": 7296, "totalSubmissionRaw": 18216}, "2464": {"acRate": 55.98784194528875, "difficulty": "Medium", "likes": 24, "dislikes": 5, "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": 921, "totalSubmissionRaw": 1645}, "2465": {"acRate": 57.92216993067153, "difficulty": "Easy", "likes": 328, "dislikes": 21, "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": 34338, "totalSubmissionRaw": 59283}, "2466": {"acRate": 55.35455861070911, "difficulty": "Medium", "likes": 1613, "dislikes": 138, "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": 67320, "totalSubmissionRaw": 121614}, "2467": {"acRate": 48.47041492757182, "difficulty": "Medium", "likes": 602, "dislikes": 51, "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": 9871, "totalSubmissionRaw": 20365}, "2468": {"acRate": 42.803229770054415, "difficulty": "Hard", "likes": 117, "dislikes": 128, "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": 4877, "totalSubmissionRaw": 11394}, "2469": {"acRate": 88.60973378194912, "difficulty": "Easy", "likes": 512, "dislikes": 298, "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": 120091, "totalSubmissionRaw": 135528}, "2470": {"acRate": 38.45347313237221, "difficulty": "Medium", "likes": 337, "dislikes": 34, "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": 20538, "totalSubmissionRaw": 53410}, "2471": {"acRate": 62.0680480260751, "difficulty": "Medium", "likes": 580, "dislikes": 12, "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": 18662, "totalSubmissionRaw": 30067}, "2472": {"acRate": 38.72465415956036, "difficulty": "Hard", "likes": 419, "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": 12261, "totalSubmissionRaw": 31662}, "2473": {"acRate": 60.09756097560975, "difficulty": "Medium", "likes": 60, "dislikes": 1, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 1232, "totalSubmissionRaw": 2050}, "2474": {"acRate": 40.02802428771602, "difficulty": "Hard", "likes": 32, "dislikes": 5, "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": 1714, "totalSubmissionRaw": 4281}, "2475": {"acRate": 70.5844927044452, "difficulty": "Easy", "likes": 349, "dislikes": 33, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33282, "totalSubmissionRaw": 47152}, "2476": {"acRate": 41.246760395403776, "difficulty": "Medium", "likes": 384, "dislikes": 102, "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 Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17984, "totalSubmissionRaw": 43601}, "2477": {"acRate": 65.71884914598635, "difficulty": "Medium", "likes": 2039, "dislikes": 76, "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": 60485, "totalSubmissionRaw": 92036}, "2478": {"acRate": 30.39302802460697, "difficulty": "Hard", "likes": 327, "dislikes": 15, "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": 8893, "totalSubmissionRaw": 29260}, "2479": {"acRate": 46.808510638297875, "difficulty": "Hard", "likes": 26, "dislikes": 2, "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": 506, "totalSubmissionRaw": 1081}, "2480": {"acRate": 69.07610078900484, "difficulty": "Easy", "likes": 24, "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": 2714, "totalSubmissionRaw": 3929}, "2481": {"acRate": 52.34856237083408, "difficulty": "Easy", "likes": 191, "dislikes": 45, "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": 26090, "totalSubmissionRaw": 49839}, "2482": {"acRate": 79.82375979112271, "difficulty": "Medium", "likes": 400, "dislikes": 19, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24458, "totalSubmissionRaw": 30640}, "2483": {"acRate": 67.65284657664382, "difficulty": "Medium", "likes": 1774, "dislikes": 87, "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": 89727, "totalSubmissionRaw": 132630}, "2484": {"acRate": 34.76346558387554, "difficulty": "Hard", "likes": 415, "dislikes": 17, "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": 7106, "totalSubmissionRaw": 20441}, "2485": {"acRate": 79.81380965419493, "difficulty": "Easy", "likes": 567, "dislikes": 10, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49554, "totalSubmissionRaw": 62087}, "2486": {"acRate": 65.19195780843371, "difficulty": "Medium", "likes": 400, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28307, "totalSubmissionRaw": 43421}, "2487": {"acRate": 65.97882041476689, "difficulty": "Medium", "likes": 1183, "dislikes": 31, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44859, "totalSubmissionRaw": 67990}, "2488": {"acRate": 43.477157360406096, "difficulty": "Hard", "likes": 526, "dislikes": 10, "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": 10278, "totalSubmissionRaw": 23640}, "2489": {"acRate": 58.0590717299578, "difficulty": "Medium", "likes": 34, "dislikes": 1, "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": 688, "totalSubmissionRaw": 1185}, "2490": {"acRate": 62.99359658484525, "difficulty": "Easy", "likes": 323, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33054, "totalSubmissionRaw": 52472}, "2491": {"acRate": 58.87052285311485, "difficulty": "Medium", "likes": 426, "dislikes": 9, "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": 28813, "totalSubmissionRaw": 48943}, "2492": {"acRate": 57.65202427047637, "difficulty": "Medium", "likes": 1687, "dislikes": 280, "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": 77723, "totalSubmissionRaw": 134814}, "2493": {"acRate": 37.219783435762366, "difficulty": "Hard", "likes": 369, "dislikes": 17, "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": 6359, "totalSubmissionRaw": 17085}, "2494": {"acRate": 24.934861907243356, "difficulty": "Hard", "likes": 33, "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": 957, "totalSubmissionRaw": 3838}, "2495": {"acRate": 64.57033125300048, "difficulty": "Medium", "likes": 39, "dislikes": 2, "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": 1345, "totalSubmissionRaw": 2083}, "2496": {"acRate": 71.50693149921793, "difficulty": "Easy", "likes": 343, "dislikes": 17, "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": 33373, "totalSubmissionRaw": 46671}, "2497": {"acRate": 38.46832984385642, "difficulty": "Medium", "likes": 338, "dislikes": 39, "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": 15250, "totalSubmissionRaw": 39643}, "2498": {"acRate": 61.38026650234922, "difficulty": "Medium", "likes": 584, "dislikes": 88, "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": 15938, "totalSubmissionRaw": 25966}, "2499": {"acRate": 42.75600505689001, "difficulty": "Hard", "likes": 199, "dislikes": 8, "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": 3382, "totalSubmissionRaw": 7910}, "2500": {"acRate": 78.07619248628113, "difficulty": "Easy", "likes": 542, "dislikes": 33, "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": 44391, "totalSubmissionRaw": 56856}, "2501": {"acRate": 38.96816118828222, "difficulty": "Medium", "likes": 426, "dislikes": 7, "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": 22667, "totalSubmissionRaw": 58168}, "2502": {"acRate": 52.334812047630166, "difficulty": "Medium", "likes": 255, "dislikes": 76, "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": 13449, "totalSubmissionRaw": 25698}, "2503": {"acRate": 35.635282089413515, "difficulty": "Hard", "likes": 433, "dislikes": 14, "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": 7668, "totalSubmissionRaw": 21518}, "2504": {"acRate": 67.95727636849132, "difficulty": "Easy", "likes": 26, "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": 2545, "totalSubmissionRaw": 3745}, "2505": {"acRate": 58.809891808346215, "difficulty": "Medium", "likes": 27, "dislikes": 3, "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": 761, "totalSubmissionRaw": 1294}, "2506": {"acRate": 68.91444713478612, "difficulty": "Easy", "likes": 439, "dislikes": 31, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34153, "totalSubmissionRaw": 49559}, "2507": {"acRate": 47.80083825682978, "difficulty": "Medium", "likes": 348, "dislikes": 22, "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": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18932, "totalSubmissionRaw": 39606}, "2508": {"acRate": 31.19630457808638, "difficulty": "Hard", "likes": 306, "dislikes": 51, "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": 10603, "totalSubmissionRaw": 33988}, "2509": {"acRate": 54.579207920792086, "difficulty": "Hard", "likes": 315, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10584, "totalSubmissionRaw": 19392}, "2510": {"acRate": 50.66972828166858, "difficulty": "Medium", "likes": 74, "dislikes": 2, "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": 2648, "totalSubmissionRaw": 5226}, "2511": {"acRate": 37.56822850435293, "difficulty": "Easy", "likes": 235, "dislikes": 238, "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": 19203, "totalSubmissionRaw": 51115}, "2512": {"acRate": 45.06224066390042, "difficulty": "Medium", "likes": 285, "dislikes": 68, "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": 16290, "totalSubmissionRaw": 36150}, "2513": {"acRate": 26.74089623072009, "difficulty": "Medium", "likes": 326, "dislikes": 63, "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": 5860, "totalSubmissionRaw": 21914}, "2514": {"acRate": 32.44755792110207, "difficulty": "Hard", "likes": 350, "dislikes": 25, "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": 8291, "totalSubmissionRaw": 25552}, "2515": {"acRate": 48.212304638081704, "difficulty": "Easy", "likes": 315, "dislikes": 18, "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": 24771, "totalSubmissionRaw": 51379}, "2516": {"acRate": 34.01743830307974, "difficulty": "Medium", "likes": 637, "dislikes": 59, "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": 13343, "totalSubmissionRaw": 39224}, "2517": {"acRate": 62.865947611710325, "difficulty": "Medium", "likes": 782, "dislikes": 94, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15504, "totalSubmissionRaw": 24662}, "2518": {"acRate": 30.968251184002803, "difficulty": "Hard", "likes": 396, "dislikes": 8, "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": 7062, "totalSubmissionRaw": 22804}, "2519": {"acRate": 55.89980224126566, "difficulty": "Hard", "likes": 61, "dislikes": 7, "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": 2544, "totalSubmissionRaw": 4551}, "2520": {"acRate": 83.45137353740442, "difficulty": "Easy", "likes": 424, "dislikes": 25, "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": 59268, "totalSubmissionRaw": 71021}, "2521": {"acRate": 50.114434852439274, "difficulty": "Medium", "likes": 403, "dislikes": 9, "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": 24962, "totalSubmissionRaw": 49810}, "2522": {"acRate": 45.82686096111645, "difficulty": "Medium", "likes": 341, "dislikes": 45, "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": 18586, "totalSubmissionRaw": 40557}, "2523": {"acRate": 36.65830156510412, "difficulty": "Medium", "likes": 338, "dislikes": 27, "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": 19136, "totalSubmissionRaw": 52201}, "2524": {"acRate": 40.32967032967033, "difficulty": "Hard", "likes": 21, "dislikes": 3, "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": 734, "totalSubmissionRaw": 1820}, "2525": {"acRate": 34.30367602504544, "difficulty": "Easy", "likes": 169, "dislikes": 47, "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": 27174, "totalSubmissionRaw": 79216}, "2526": {"acRate": 46.81547548449842, "difficulty": "Medium", "likes": 255, "dislikes": 26, "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": 19736, "totalSubmissionRaw": 42157}, "2527": {"acRate": 67.92460527926238, "difficulty": "Medium", "likes": 319, "dislikes": 49, "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": 16649, "totalSubmissionRaw": 24511}, "2528": {"acRate": 31.693063899508466, "difficulty": "Hard", "likes": 425, "dislikes": 7, "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": 5803, "totalSubmissionRaw": 18310}, "2529": {"acRate": 71.631419654727, "difficulty": "Easy", "likes": 751, "dislikes": 40, "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": 75973, "totalSubmissionRaw": 106061}, "2530": {"acRate": 44.39332123151027, "difficulty": "Medium", "likes": 353, "dislikes": 8, "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": 24700, "totalSubmissionRaw": 55639}, "2531": {"acRate": 25.89036755386565, "difficulty": "Medium", "likes": 514, "dislikes": 134, "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": 16342, "totalSubmissionRaw": 63120}, "2532": {"acRate": 46.4017602899301, "difficulty": "Hard", "likes": 105, "dislikes": 208, "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": 3585, "totalSubmissionRaw": 7726}, "2533": {"acRate": 53.82946771233106, "difficulty": "Medium", "likes": 41, "dislikes": 14, "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": 3226, "totalSubmissionRaw": 5993}, "2534": {"acRate": 54.05626431141643, "difficulty": "Hard", "likes": 53, "dislikes": 9, "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": 3305, "totalSubmissionRaw": 6114}, "2535": {"acRate": 83.54974221882757, "difficulty": "Easy", "likes": 583, "dislikes": 16, "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": 87509, "totalSubmissionRaw": 104739}, "2536": {"acRate": 48.211910365292134, "difficulty": "Medium", "likes": 432, "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": 18847, "totalSubmissionRaw": 39092}, "2537": {"acRate": 48.56416533283118, "difficulty": "Medium", "likes": 735, "dislikes": 20, "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": 15474, "totalSubmissionRaw": 31863}, "2538": {"acRate": 32.39250050947626, "difficulty": "Hard", "likes": 385, "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": 6358, "totalSubmissionRaw": 19628}, "2539": {"acRate": 60.58135412974123, "difficulty": "Medium", "likes": 22, "dislikes": 44, "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": 1709, "totalSubmissionRaw": 2821}, "2540": {"acRate": 50.51560669010333, "difficulty": "Easy", "likes": 471, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 47419, "totalSubmissionRaw": 93870}, "2541": {"acRate": 31.001141262997717, "difficulty": "Medium", "likes": 380, "dislikes": 23, "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": 19558, "totalSubmissionRaw": 63088}, "2542": {"acRate": 54.82348933270876, "difficulty": "Medium", "likes": 2347, "dislikes": 115, "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": 64369, "totalSubmissionRaw": 117412}, "2543": {"acRate": 41.265393888056295, "difficulty": "Hard", "likes": 228, "dislikes": 46, "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": 6333, "totalSubmissionRaw": 15347}, "2544": {"acRate": 68.14339058999253, "difficulty": "Easy", "likes": 340, "dislikes": 18, "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": 45622, "totalSubmissionRaw": 66950}, "2545": {"acRate": 84.63217972535575, "difficulty": "Medium", "likes": 546, "dislikes": 33, "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": 44189, "totalSubmissionRaw": 52213}, "2546": {"acRate": 40.439700569107615, "difficulty": "Medium", "likes": 226, "dislikes": 96, "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": 17125, "totalSubmissionRaw": 42347}, "2547": {"acRate": 38.731748337283086, "difficulty": "Hard", "likes": 394, "dislikes": 22, "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": 10133, "totalSubmissionRaw": 26162}, "2548": {"acRate": 65.7633840052875, "difficulty": "Medium", "likes": 30, "dislikes": 4, "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": 995, "totalSubmissionRaw": 1513}, "2549": {"acRate": 59.182416148730674, "difficulty": "Easy", "likes": 213, "dislikes": 228, "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": 32661, "totalSubmissionRaw": 55187}, "2550": {"acRate": 26.85303564189716, "difficulty": "Medium", "likes": 167, "dislikes": 465, "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": 17223, "totalSubmissionRaw": 64138}, "2551": {"acRate": 67.1416192126764, "difficulty": "Hard", "likes": 1948, "dislikes": 74, "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": 54237, "totalSubmissionRaw": 80780}, "2552": {"acRate": 31.954139696238947, "difficulty": "Hard", "likes": 341, "dislikes": 59, "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": 7552, "totalSubmissionRaw": 23635}, "2553": {"acRate": 78.17320002438578, "difficulty": "Easy", "likes": 401, "dislikes": 11, "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": 51291, "totalSubmissionRaw": 65612}, "2554": {"acRate": 52.45273066623387, "difficulty": "Medium", "likes": 284, "dislikes": 19, "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": 25855, "totalSubmissionRaw": 49292}, "2555": {"acRate": 31.83316664814609, "difficulty": "Medium", "likes": 508, "dislikes": 37, "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": 8594, "totalSubmissionRaw": 26997}, "2556": {"acRate": 27.409916079388402, "difficulty": "Medium", "likes": 503, "dislikes": 21, "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": 11007, "totalSubmissionRaw": 40157}, "2557": {"acRate": 41.89088191330344, "difficulty": "Medium", "likes": 26, "dislikes": 20, "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": 1121, "totalSubmissionRaw": 2676}, "2558": {"acRate": 65.71941799892222, "difficulty": "Easy", "likes": 316, "dislikes": 29, "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": 36585, "totalSubmissionRaw": 55669}, "2559": {"acRate": 50.99492865738353, "difficulty": "Medium", "likes": 397, "dislikes": 14, "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": 23731, "totalSubmissionRaw": 46536}, "2560": {"acRate": 41.649109642413926, "difficulty": "Medium", "likes": 809, "dislikes": 20, "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": 14431, "totalSubmissionRaw": 34649}, "2561": {"acRate": 33.24691358024691, "difficulty": "Hard", "likes": 348, "dislikes": 17, "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": 8079, "totalSubmissionRaw": 24300}, "2562": {"acRate": 69.00682143051007, "difficulty": "Easy", "likes": 301, "dislikes": 10, "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": 38138, "totalSubmissionRaw": 55267}, "2563": {"acRate": 32.551658300742154, "difficulty": "Medium", "likes": 717, "dislikes": 32, "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": 21141, "totalSubmissionRaw": 64946}, "2564": {"acRate": 32.98859718907451, "difficulty": "Medium", "likes": 340, "dislikes": 79, "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": 11196, "totalSubmissionRaw": 33939}, "2565": {"acRate": 30.479819665092318, "difficulty": "Hard", "likes": 339, "dislikes": 6, "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": 5679, "totalSubmissionRaw": 18632}, "2566": {"acRate": 58.71287943184622, "difficulty": "Easy", "likes": 205, "dislikes": 34, "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": 21412, "totalSubmissionRaw": 36469}, "2567": {"acRate": 47.23813100491346, "difficulty": "Medium", "likes": 202, "dislikes": 195, "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": 15094, "totalSubmissionRaw": 31953}, "2568": {"acRate": 56.6446232256434, "difficulty": "Medium", "likes": 320, "dislikes": 17, "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": 13448, "totalSubmissionRaw": 23741}, "2569": {"acRate": 26.238621785081556, "difficulty": "Hard", "likes": 160, "dislikes": 23, "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": 4295, "totalSubmissionRaw": 16369}, "2570": {"acRate": 72.65496124556527, "difficulty": "Easy", "likes": 278, "dislikes": 9, "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": 32152, "totalSubmissionRaw": 44253}, "2571": {"acRate": 50.834605729665384, "difficulty": "Medium", "likes": 452, "dislikes": 186, "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": 19643, "totalSubmissionRaw": 38641}, "2572": {"acRate": 21.82127000208588, "difficulty": "Medium", "likes": 398, "dislikes": 104, "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": 7323, "totalSubmissionRaw": 33559}, "2573": {"acRate": 31.304140507033303, "difficulty": "Hard", "likes": 173, "dislikes": 15, "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": 3939, "totalSubmissionRaw": 12583}, "2574": {"acRate": 85.93126652247057, "difficulty": "Easy", "likes": 825, "dislikes": 65, "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": 89390, "totalSubmissionRaw": 104025}, "2575": {"acRate": 31.737663993201252, "difficulty": "Medium", "likes": 489, "dislikes": 16, "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": 23901, "totalSubmissionRaw": 75308}, "2576": {"acRate": 37.62454116413215, "difficulty": "Medium", "likes": 520, "dislikes": 23, "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": 17220, "totalSubmissionRaw": 45768}, "2577": {"acRate": 34.36305129661177, "difficulty": "Hard", "likes": 485, "dislikes": 8, "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": 9077, "totalSubmissionRaw": 26415}, "2578": {"acRate": 69.06102805652263, "difficulty": "Easy", "likes": 309, "dislikes": 26, "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": 26978, "totalSubmissionRaw": 39064}, "2579": {"acRate": 57.077194147238316, "difficulty": "Medium", "likes": 264, "dislikes": 18, "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": 22352, "totalSubmissionRaw": 39161}, "2580": {"acRate": 34.98594428826987, "difficulty": "Medium", "likes": 287, "dislikes": 17, "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": 13690, "totalSubmissionRaw": 39130}, "2581": {"acRate": 45.13333333333333, "difficulty": "Hard", "likes": 270, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"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": 4739, "totalSubmissionRaw": 10500}, "2582": {"acRate": 45.428678397603896, "difficulty": "Easy", "likes": 335, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30335, "totalSubmissionRaw": 66775}, "2583": {"acRate": 46.71490593342981, "difficulty": "Medium", "likes": 469, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29052, "totalSubmissionRaw": 62190}, "2584": {"acRate": 22.11261192897253, "difficulty": "Hard", "likes": 292, "dislikes": 110, "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": 10199, "totalSubmissionRaw": 46123}, "2585": {"acRate": 56.916005014625995, "difficulty": "Hard", "likes": 431, "dislikes": 8, "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": 13620, "totalSubmissionRaw": 23930}, "2586": {"acRate": 74.0183289852164, "difficulty": "Easy", "likes": 279, "dislikes": 19, "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": 44260, "totalSubmissionRaw": 59796}, "2587": {"acRate": 40.0459405940594, "difficulty": "Medium", "likes": 256, "dislikes": 37, "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": 25279, "totalSubmissionRaw": 63125}, "2588": {"acRate": 48.9314689004683, "difficulty": "Medium", "likes": 439, "dislikes": 15, "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": 14837, "totalSubmissionRaw": 30322}, "2589": {"acRate": 36.98888351860802, "difficulty": "Hard", "likes": 392, "dislikes": 13, "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": 7653, "totalSubmissionRaw": 20690}, "2590": {"acRate": 59.73878478137422, "difficulty": "Medium", "likes": 23, "dislikes": 10, "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": 1052, "totalSubmissionRaw": 1761}, "2591": {"acRate": 18.806748910847197, "difficulty": "Easy", "likes": 228, "dislikes": 723, "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": 22059, "totalSubmissionRaw": 117289}, "2592": {"acRate": 56.261250450018, "difficulty": "Medium", "likes": 379, "dislikes": 11, "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": 18753, "totalSubmissionRaw": 33332}, "2593": {"acRate": 51.97459545285632, "difficulty": "Medium", "likes": 322, "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": "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": 15385, "totalSubmissionRaw": 29601}, "2594": {"acRate": 42.53971479863157, "difficulty": "Medium", "likes": 485, "dislikes": 23, "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": 12559, "totalSubmissionRaw": 29523}, "2595": {"acRate": 71.03937867847824, "difficulty": "Easy", "likes": 228, "dislikes": 96, "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": 35124, "totalSubmissionRaw": 49443}, "2596": {"acRate": 56.70061408607313, "difficulty": "Medium", "likes": 325, "dislikes": 45, "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": 22437, "totalSubmissionRaw": 39571}, "2597": {"acRate": 30.105577275388594, "difficulty": "Medium", "likes": 467, "dislikes": 94, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15940, "totalSubmissionRaw": 52947}, "2598": {"acRate": 38.59925788497217, "difficulty": "Medium", "likes": 312, "dislikes": 31, "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": 12483, "totalSubmissionRaw": 32340}, "2599": {"acRate": 51.22684026039058, "difficulty": "Medium", "likes": 34, "dislikes": 1, "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": 1023, "totalSubmissionRaw": 1997}, "2600": {"acRate": 61.050952905969446, "difficulty": "Easy", "likes": 233, "dislikes": 23, "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": 31008, "totalSubmissionRaw": 50791}, "2601": {"acRate": 36.886306548600714, "difficulty": "Medium", "likes": 348, "dislikes": 31, "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": 14538, "totalSubmissionRaw": 39413}, "2602": {"acRate": 34.55006031363088, "difficulty": "Medium", "likes": 618, "dislikes": 16, "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": 14321, "totalSubmissionRaw": 41450}, "2603": {"acRate": 35.74095347501436, "difficulty": "Hard", "likes": 348, "dislikes": 7, "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": 4978, "totalSubmissionRaw": 13928}, "2604": {"acRate": 45.307644499689246, "difficulty": "Hard", "likes": 34, "dislikes": 2, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 729, "totalSubmissionRaw": 1609}, "2605": {"acRate": 53.052046940786525, "difficulty": "Easy", "likes": 259, "dislikes": 17, "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": 29611, "totalSubmissionRaw": 55815}, "2606": {"acRate": 55.74212159146575, "difficulty": "Medium", "likes": 311, "dislikes": 9, "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": 20482, "totalSubmissionRaw": 36745}, "2607": {"acRate": 34.08217558380136, "difficulty": "Medium", "likes": 405, "dislikes": 75, "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": 8071, "totalSubmissionRaw": 23681}, "2608": {"acRate": 36.24302810418584, "difficulty": "Hard", "likes": 425, "dislikes": 14, "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": 13386, "totalSubmissionRaw": 36934}, "2609": {"acRate": 45.485782405946495, "difficulty": "Easy", "likes": 328, "dislikes": 18, "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": 25946, "totalSubmissionRaw": 57042}, "2610": {"acRate": 83.35504233254846, "difficulty": "Medium", "likes": 441, "dislikes": 12, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 33276, "totalSubmissionRaw": 39921}, "2611": {"acRate": 43.41989486271236, "difficulty": "Medium", "likes": 539, "dislikes": 31, "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": 19245, "totalSubmissionRaw": 44323}, "2612": {"acRate": 14.670531071519905, "difficulty": "Hard", "likes": 207, "dislikes": 64, "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": 3442, "totalSubmissionRaw": 23462}, "2613": {"acRate": 46.31463146314631, "difficulty": "Hard", "likes": 15, "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": 421, "totalSubmissionRaw": 909}, "2614": {"acRate": 32.667221196567326, "difficulty": "Easy", "likes": 287, "dislikes": 29, "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": 32204, "totalSubmissionRaw": 98582}, "2615": {"acRate": 29.84879523948883, "difficulty": "Medium", "likes": 615, "dislikes": 77, "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": 15299, "totalSubmissionRaw": 51255}, "2616": {"acRate": 44.27942679543605, "difficulty": "Medium", "likes": 2144, "dislikes": 210, "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": 63684, "totalSubmissionRaw": 143823}, "2617": {"acRate": 24.87424898700573, "difficulty": "Hard", "likes": 335, "dislikes": 26, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7121, "totalSubmissionRaw": 28628}, "2618": {"acRate": 28.5282693137678, "difficulty": "Medium", "likes": 241, "dislikes": 87, "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": 15864, "totalSubmissionRaw": 55608}, "2619": {"acRate": 71.3769623605069, "difficulty": "Easy", "likes": 390, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75474, "totalSubmissionRaw": 105740}, "2620": {"acRate": 79.61166935530893, "difficulty": "Easy", "likes": 869, "dislikes": 58, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163839, "totalSubmissionRaw": 205799}, "2621": {"acRate": 84.9192695390654, "difficulty": "Easy", "likes": 481, "dislikes": 33, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66634, "totalSubmissionRaw": 78468}, "2622": {"acRate": 75.8133409268883, "difficulty": "Medium", "likes": 323, "dislikes": 26, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21299, "totalSubmissionRaw": 28094}, "2623": {"acRate": 61.73394941634241, "difficulty": "Medium", "likes": 441, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40616, "totalSubmissionRaw": 65792}, "2624": {"acRate": 65.18659477746061, "difficulty": "Medium", "likes": 82, "dislikes": 39, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6166, "totalSubmissionRaw": 9459}, "2625": {"acRate": 66.18815331010452, "difficulty": "Medium", "likes": 243, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18996, "totalSubmissionRaw": 28700}, "2626": {"acRate": 83.68136710218782, "difficulty": "Easy", "likes": 442, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65519, "totalSubmissionRaw": 78296}, "2627": {"acRate": 92.0114122681883, "difficulty": "Medium", "likes": 298, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21929, "totalSubmissionRaw": 23833}, "2628": {"acRate": 38.13636682817218, "difficulty": "Medium", "likes": 205, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10862, "totalSubmissionRaw": 28482}, "2629": {"acRate": 85.58211604711687, "difficulty": "Easy", "likes": 491, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56888, "totalSubmissionRaw": 66472}, "2630": {"acRate": 31.75697168911038, "difficulty": "Hard", "likes": 98, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2995, "totalSubmissionRaw": 9431}, "2631": {"acRate": 83.15661784526912, "difficulty": "Medium", "likes": 227, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18508, "totalSubmissionRaw": 22257}, "2632": {"acRate": 89.26441351888667, "difficulty": "Hard", "likes": 331, "dislikes": 34, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14817, "totalSubmissionRaw": 16599}, "2633": {"acRate": 77.57898743814236, "difficulty": "Medium", "likes": 196, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10190, "totalSubmissionRaw": 13135}, "2634": {"acRate": 83.4558645707376, "difficulty": "Easy", "likes": 468, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69018, "totalSubmissionRaw": 82700}, "2635": {"acRate": 85.64384950349054, "difficulty": "Easy", "likes": 532, "dislikes": 35, "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": 74344, "totalSubmissionRaw": 86806}, "2636": {"acRate": 80.7842238018803, "difficulty": "Medium", "likes": 270, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10569, "totalSubmissionRaw": 13083}, "2637": {"acRate": 81.72435693871071, "difficulty": "Medium", "likes": 379, "dislikes": 46, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25735, "totalSubmissionRaw": 31490}, "2638": {"acRate": 50.16534391534392, "difficulty": "Medium", "likes": 57, "dislikes": 7, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1517, "totalSubmissionRaw": 3024}, "2639": {"acRate": 65.95199809421713, "difficulty": "Easy", "likes": 143, "dislikes": 28, "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": 22148, "totalSubmissionRaw": 33582}, "2640": {"acRate": 69.80020965653327, "difficulty": "Medium", "likes": 224, "dislikes": 17, "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": 22639, "totalSubmissionRaw": 32434}, "2641": {"acRate": 67.72899585647536, "difficulty": "Medium", "likes": 479, "dislikes": 7, "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": 15365, "totalSubmissionRaw": 22686}, "2642": {"acRate": 58.249025038150684, "difficulty": "Hard", "likes": 196, "dislikes": 21, "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": 10306, "totalSubmissionRaw": 17693}, "2643": {"acRate": 75.54420342343029, "difficulty": "Easy", "likes": 328, "dislikes": 9, "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": 39632, "totalSubmissionRaw": 52462}, "2644": {"acRate": 48.16090007713872, "difficulty": "Easy", "likes": 147, "dislikes": 39, "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": 25598, "totalSubmissionRaw": 53151}, "2645": {"acRate": 49.48387918949917, "difficulty": "Medium", "likes": 472, "dislikes": 19, "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": 23298, "totalSubmissionRaw": 47076}, "2646": {"acRate": 42.98667249289928, "difficulty": "Hard", "likes": 424, "dislikes": 16, "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": 7870, "totalSubmissionRaw": 18308}, "2647": {"acRate": 69.02887139107612, "difficulty": "Hard", "likes": 10, "dislikes": 13, "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": 263, "totalSubmissionRaw": 381}, "2648": {"acRate": 83.87354941976791, "difficulty": "Easy", "likes": 212, "dislikes": 20, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16768, "totalSubmissionRaw": 19992}, "2649": {"acRate": 81.10093407091684, "difficulty": "Medium", "likes": 147, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8943, "totalSubmissionRaw": 11027}, "2650": {"acRate": 49.934239368697945, "difficulty": "Hard", "likes": 54, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1139, "totalSubmissionRaw": 2281}, "2651": {"acRate": 79.01675678774099, "difficulty": "Easy", "likes": 186, "dislikes": 39, "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": 41355, "totalSubmissionRaw": 52337}, "2652": {"acRate": 84.77963445864565, "difficulty": "Easy", "likes": 421, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72499, "totalSubmissionRaw": 85515}, "2653": {"acRate": 31.89668495479484, "difficulty": "Medium", "likes": 545, "dislikes": 102, "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": 16511, "totalSubmissionRaw": 51764}, "2654": {"acRate": 34.75972683415826, "difficulty": "Medium", "likes": 358, "dislikes": 14, "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": 11096, "totalSubmissionRaw": 31922}, "2655": {"acRate": 54.266666666666666, "difficulty": "Medium", "likes": 20, "dislikes": 2, "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": 814, "totalSubmissionRaw": 1500}, "2656": {"acRate": 81.50571388261851, "difficulty": "Easy", "likes": 293, "dislikes": 33, "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": 46217, "totalSubmissionRaw": 56704}, "2657": {"acRate": 79.8350446052853, "difficulty": "Medium", "likes": 365, "dislikes": 9, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28458, "totalSubmissionRaw": 35646}, "2658": {"acRate": 58.674103489041805, "difficulty": "Medium", "likes": 361, "dislikes": 19, "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": 19356, "totalSubmissionRaw": 32989}, "2659": {"acRate": 24.20990391722099, "difficulty": "Hard", "likes": 478, "dislikes": 24, "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": 8189, "totalSubmissionRaw": 33825}, "2660": {"acRate": 33.91990810328604, "difficulty": "Easy", "likes": 204, "dislikes": 101, "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": 27757, "totalSubmissionRaw": 81831}, "2661": {"acRate": 49.521309450277954, "difficulty": "Medium", "likes": 360, "dislikes": 6, "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": 19242, "totalSubmissionRaw": 38856}, "2662": {"acRate": 35.77362212191329, "difficulty": "Medium", "likes": 472, "dislikes": 71, "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": 9431, "totalSubmissionRaw": 26363}, "2663": {"acRate": 36.42072213500785, "difficulty": "Hard", "likes": 170, "dislikes": 15, "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": 4176, "totalSubmissionRaw": 11466}, "2664": {"acRate": 69.13895993179881, "difficulty": "Medium", "likes": 24, "dislikes": 0, "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": 811, "totalSubmissionRaw": 1173}, "2665": {"acRate": 80.32946854834478, "difficulty": "Easy", "likes": 545, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76557, "totalSubmissionRaw": 95304}, "2666": {"acRate": 86.4310125174415, "difficulty": "Easy", "likes": 352, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42741, "totalSubmissionRaw": 49451}, "2667": {"acRate": 79.86035203138249, "difficulty": "Easy", "likes": 818, "dislikes": 113, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156343, "totalSubmissionRaw": 195770}, "2668": {"acRate": 64.40677966101694, "difficulty": "Easy", "likes": 14, "dislikes": 15, "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": 1444, "totalSubmissionRaw": 2242}, "2669": {"acRate": 67.39766081871345, "difficulty": "Easy", "likes": 13, "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": 1383, "totalSubmissionRaw": 2052}, "2670": {"acRate": 76.46019594196692, "difficulty": "Easy", "likes": 267, "dislikes": 24, "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": 28564, "totalSubmissionRaw": 37358}, "2671": {"acRate": 28.787004073254437, "difficulty": "Medium", "likes": 295, "dislikes": 22, "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": 17951, "totalSubmissionRaw": 62358}, "2672": {"acRate": 54.16184740557571, "difficulty": "Medium", "likes": 321, "dislikes": 81, "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": 13580, "totalSubmissionRaw": 25073}, "2673": {"acRate": 58.231093206372464, "difficulty": "Medium", "likes": 505, "dislikes": 9, "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": 12720, "totalSubmissionRaw": 21844}, "2674": {"acRate": 74.58333333333333, "difficulty": "Medium", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 716, "totalSubmissionRaw": 960}, "2675": {"acRate": 69.62503043584125, "difficulty": "Hard", "likes": 129, "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": 5719, "totalSubmissionRaw": 8214}, "2676": {"acRate": 85.64234556848702, "difficulty": "Medium", "likes": 155, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7653, "totalSubmissionRaw": 8936}, "2677": {"acRate": 82.73671867365884, "difficulty": "Easy", "likes": 262, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25401, "totalSubmissionRaw": 30701}, "2678": {"acRate": 75.79120106274908, "difficulty": "Easy", "likes": 222, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38795, "totalSubmissionRaw": 51187}, "2679": {"acRate": 58.678342142873355, "difficulty": "Medium", "likes": 290, "dislikes": 47, "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": 25866, "totalSubmissionRaw": 44081}, "2680": {"acRate": 39.68125811773792, "difficulty": "Medium", "likes": 344, "dislikes": 41, "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": 11304, "totalSubmissionRaw": 28487}, "2681": {"acRate": 29.56328762780376, "difficulty": "Hard", "likes": 291, "dislikes": 15, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7460, "totalSubmissionRaw": 25234}, "2682": {"acRate": 48.18614424324825, "difficulty": "Easy", "likes": 218, "dislikes": 35, "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": 23391, "totalSubmissionRaw": 48543}, "2683": {"acRate": 60.816787732041966, "difficulty": "Medium", "likes": 247, "dislikes": 7, "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": 18838, "totalSubmissionRaw": 30975}, "2684": {"acRate": 44.70609262941531, "difficulty": "Medium", "likes": 375, "dislikes": 5, "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": 20010, "totalSubmissionRaw": 44759}, "2685": {"acRate": 64.7975939433747, "difficulty": "Medium", "likes": 511, "dislikes": 12, "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": 18744, "totalSubmissionRaw": 28927}, "2686": {"acRate": 57.11009174311926, "difficulty": "Medium", "likes": 9, "dislikes": 0, "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": 996, "totalSubmissionRaw": 1744}, "2687": {"acRate": 77.39837398373983, "difficulty": "Easy", "likes": 18, "dislikes": 2, "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": 1428, "totalSubmissionRaw": 1845}, "2688": {"acRate": 38.63932291666667, "difficulty": "Medium", "likes": 16, "dislikes": 3, "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": 1187, "totalSubmissionRaw": 3072}, "2689": {"acRate": 74.80643240023824, "difficulty": "Easy", "likes": 25, "dislikes": 15, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1256, "totalSubmissionRaw": 1679}, "2690": {"acRate": 91.90839694656489, "difficulty": "Easy", "likes": 21, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 602, "totalSubmissionRaw": 655}, "2691": {"acRate": 42.333333333333336, "difficulty": "Hard", "likes": 7, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127, "totalSubmissionRaw": 300}, "2692": {"acRate": 61.42131979695431, "difficulty": "Medium", "likes": 13, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242, "totalSubmissionRaw": 394}, "2693": {"acRate": 82.07352781693959, "difficulty": "Medium", "likes": 125, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7568, "totalSubmissionRaw": 9221}, "2694": {"acRate": 82.02255472838506, "difficulty": "Medium", "likes": 172, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11126, "totalSubmissionRaw": 13565}, "2695": {"acRate": 88.0048465266559, "difficulty": "Easy", "likes": 186, "dislikes": 20, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17432, "totalSubmissionRaw": 19808}, "2696": {"acRate": 68.16619992452681, "difficulty": "Easy", "likes": 333, "dislikes": 8, "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": 34321, "totalSubmissionRaw": 50349}, "2697": {"acRate": 80.44731995735195, "difficulty": "Easy", "likes": 275, "dislikes": 13, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33199, "totalSubmissionRaw": 41268}, "2698": {"acRate": 60.88150236116704, "difficulty": "Medium", "likes": 425, "dislikes": 24, "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": 16631, "totalSubmissionRaw": 27317}, "2699": {"acRate": 21.91321026132822, "difficulty": "Hard", "likes": 250, "dislikes": 41, "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": 3656, "totalSubmissionRaw": 16684}, "2700": {"acRate": 82.26855959775214, "difficulty": "Medium", "likes": 126, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5563, "totalSubmissionRaw": 6762}, "2701": {"acRate": 22.483069977426638, "difficulty": "Hard", "likes": 20, "dislikes": 0, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 498, "totalSubmissionRaw": 2215}, "2702": {"acRate": 52.662721893491124, "difficulty": "Hard", "likes": 29, "dislikes": 0, "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": 623, "totalSubmissionRaw": 1183}, "2703": {"acRate": 92.46928499496475, "difficulty": "Easy", "likes": 189, "dislikes": 96, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45908, "totalSubmissionRaw": 49647}, "2704": {"acRate": 61.31433812581149, "difficulty": "Easy", "likes": 358, "dislikes": 61, "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": 51473, "totalSubmissionRaw": 83950}, "2705": {"acRate": 64.66776195691858, "difficulty": "Medium", "likes": 107, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7085, "totalSubmissionRaw": 10956}, "2706": {"acRate": 63.18079251960196, "difficulty": "Easy", "likes": 262, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38920, "totalSubmissionRaw": 61601}, "2707": {"acRate": 52.87891824585703, "difficulty": "Medium", "likes": 1919, "dislikes": 83, "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": 75592, "totalSubmissionRaw": 142953}, "2708": {"acRate": 23.32628460407252, "difficulty": "Medium", "likes": 308, "dislikes": 42, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21730, "totalSubmissionRaw": 93160}, "2709": {"acRate": 22.663633181659083, "difficulty": "Hard", "likes": 299, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7770, "totalSubmissionRaw": 34284}, "2710": {"acRate": 78.19065565398094, "difficulty": "Easy", "likes": 248, "dislikes": 8, "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": 44399, "totalSubmissionRaw": 56783}, "2711": {"acRate": 70.51762641569628, "difficulty": "Medium", "likes": 111, "dislikes": 189, "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": 17683, "totalSubmissionRaw": 25076}, "2712": {"acRate": 53.59140219661748, "difficulty": "Medium", "likes": 478, "dislikes": 20, "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": 15907, "totalSubmissionRaw": 29682}, "2713": {"acRate": 27.81657355679702, "difficulty": "Hard", "likes": 475, "dislikes": 12, "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": "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8365, "totalSubmissionRaw": 30072}, "2714": {"acRate": 60.270880361173816, "difficulty": "Hard", "likes": 20, "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": 534, "totalSubmissionRaw": 886}, "2715": {"acRate": 87.34425827042288, "difficulty": "Easy", "likes": 124, "dislikes": 127, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14231, "totalSubmissionRaw": 16293}, "2716": {"acRate": 74.50109105336242, "difficulty": "Easy", "likes": 226, "dislikes": 66, "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": 37556, "totalSubmissionRaw": 50410}, "2717": {"acRate": 62.93279022403259, "difficulty": "Easy", "likes": 186, "dislikes": 10, "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": 26883, "totalSubmissionRaw": 42717}, "2718": {"acRate": 29.88301282051282, "difficulty": "Medium", "likes": 652, "dislikes": 23, "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": 18647, "totalSubmissionRaw": 62400}, "2719": {"acRate": 33.6246423952659, "difficulty": "Hard", "likes": 458, "dislikes": 10, "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": 8580, "totalSubmissionRaw": 25517}, "2720": {"acRate": 41.10787172011662, "difficulty": "Hard", "likes": 9, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 564, "totalSubmissionRaw": 1372}, "2721": {"acRate": 80.49499736703528, "difficulty": "Medium", "likes": 112, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7643, "totalSubmissionRaw": 9494}, "2722": {"acRate": 52.584517393434595, "difficulty": "Medium", "likes": 88, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8586, "totalSubmissionRaw": 16328}, "2723": {"acRate": 89.70642509646034, "difficulty": "Easy", "likes": 167, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26737, "totalSubmissionRaw": 29805}, "2724": {"acRate": 81.2014985282312, "difficulty": "Easy", "likes": 97, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12138, "totalSubmissionRaw": 14948}, "2725": {"acRate": 85.28610354223434, "difficulty": "Easy", "likes": 95, "dislikes": 39, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11894, "totalSubmissionRaw": 13946}, "2726": {"acRate": 72.68184796854523, "difficulty": "Easy", "likes": 75, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8873, "totalSubmissionRaw": 12208}, "2727": {"acRate": 77.47771666982743, "difficulty": "Easy", "likes": 118, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20427, "totalSubmissionRaw": 26365}, "2728": {"acRate": 83.83280757097792, "difficulty": "Easy", "likes": 37, "dislikes": 6, "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": 1063, "totalSubmissionRaw": 1268}, "2729": {"acRate": 51.35817017162195, "difficulty": "Easy", "likes": 193, "dislikes": 10, "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": 33995, "totalSubmissionRaw": 66192}, "2730": {"acRate": 34.95962494875132, "difficulty": "Medium", "likes": 252, "dislikes": 70, "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": 19612, "totalSubmissionRaw": 56099}, "2731": {"acRate": 28.33531901949352, "difficulty": "Medium", "likes": 430, "dislikes": 82, "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": 11178, "totalSubmissionRaw": 39449}, "2732": {"acRate": 44.260916112258165, "difficulty": "Hard", "likes": 196, "dislikes": 19, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5788, "totalSubmissionRaw": 13077}, "2733": {"acRate": 76.84040838259001, "difficulty": "Easy", "likes": 268, "dislikes": 11, "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": 64350, "totalSubmissionRaw": 83745}, "2734": {"acRate": 29.801299486249622, "difficulty": "Medium", "likes": 191, "dislikes": 169, "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": 23667, "totalSubmissionRaw": 79416}, "2735": {"acRate": 31.914554439662048, "difficulty": "Medium", "likes": 267, "dislikes": 509, "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": 10010, "totalSubmissionRaw": 31365}, "2736": {"acRate": 24.766723616769614, "difficulty": "Hard", "likes": 286, "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": 3769, "totalSubmissionRaw": 15218}, "2737": {"acRate": 53.70860927152318, "difficulty": "Medium", "likes": 29, "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": 811, "totalSubmissionRaw": 1510}, "2738": {"acRate": 53.54107648725213, "difficulty": "Medium", "likes": 10, "dislikes": 31, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1133, "totalSubmissionRaw": 2116}, "2739": {"acRate": 38.50299864149943, "difficulty": "Easy", "likes": 246, "dislikes": 88, "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": 34861, "totalSubmissionRaw": 90541}, "2740": {"acRate": 64.4967939782548, "difficulty": "Medium", "likes": 234, "dislikes": 14, "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": 27762, "totalSubmissionRaw": 43044}, "2741": {"acRate": 26.451821712594786, "difficulty": "Medium", "likes": 492, "dislikes": 56, "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": 11442, "totalSubmissionRaw": 43256}, "2742": {"acRate": 51.759387065154336, "difficulty": "Hard", "likes": 1147, "dislikes": 68, "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": 51690, "totalSubmissionRaw": 99882}, "2743": {"acRate": 72.87878787878788, "difficulty": "Medium", "likes": 41, "dislikes": 0, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 962, "totalSubmissionRaw": 1320}, "2744": {"acRate": 80.26756566454009, "difficulty": "Easy", "likes": 251, "dislikes": 7, "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": 37619, "totalSubmissionRaw": 46867}, "2745": {"acRate": 51.89371747596236, "difficulty": "Medium", "likes": 253, "dislikes": 19, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15058, "totalSubmissionRaw": 29017}, "2746": {"acRate": 24.97991967871486, "difficulty": "Medium", "likes": 329, "dislikes": 25, "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": 6220, "totalSubmissionRaw": 24900}, "2747": {"acRate": 31.21899894784308, "difficulty": "Medium", "likes": 280, "dislikes": 25, "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": 4154, "totalSubmissionRaw": 13305}, "2748": {"acRate": 49.011517662757214, "difficulty": "Easy", "likes": 171, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "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": 27915, "totalSubmissionRaw": 56956}, "2749": {"acRate": 29.002956577494388, "difficulty": "Medium", "likes": 255, "dislikes": 276, "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": 8142, "totalSubmissionRaw": 28073}, "2750": {"acRate": 32.97261189044756, "difficulty": "Medium", "likes": 368, "dislikes": 8, "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": 17276, "totalSubmissionRaw": 52395}, "2751": {"acRate": 39.75292522472756, "difficulty": "Hard", "likes": 381, "dislikes": 12, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7916, "totalSubmissionRaw": 19913}, "2752": {"acRate": 34.66872110939907, "difficulty": "Hard", "likes": 8, "dislikes": 16, "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": 450, "totalSubmissionRaw": 1298}, "2753": {"acRate": 76.31133671742809, "difficulty": "Hard", "likes": 17, "dislikes": 0, "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": 451, "totalSubmissionRaw": 591}, "2754": {"acRate": 90.96989966555184, "difficulty": "Medium", "likes": 10, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 272, "totalSubmissionRaw": 299}, "2755": {"acRate": 57.14285714285714, "difficulty": "Medium", "likes": 10, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224, "totalSubmissionRaw": 392}, "2756": {"acRate": 72.62569832402235, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130, "totalSubmissionRaw": 179}, "2757": {"acRate": 80.37383177570094, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 172, "totalSubmissionRaw": 214}, "2758": {"acRate": 85.46168958742632, "difficulty": "Easy", "likes": 10, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435, "totalSubmissionRaw": 509}, "2759": {"acRate": 69.23076923076923, "difficulty": "Hard", "likes": 9, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 171, "totalSubmissionRaw": 247}, "2760": {"acRate": 28.62426587365033, "difficulty": "Easy", "likes": 228, "dislikes": 235, "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": 26855, "totalSubmissionRaw": 93819}, "2761": {"acRate": 32.851754517354536, "difficulty": "Medium", "likes": 304, "dislikes": 30, "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": 24126, "totalSubmissionRaw": 73439}, "2762": {"acRate": 40.505570537441095, "difficulty": "Medium", "likes": 589, "dislikes": 13, "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": 14870, "totalSubmissionRaw": 36711}, "2763": {"acRate": 46.070855809884826, "difficulty": "Hard", "likes": 275, "dislikes": 7, "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": 6320, "totalSubmissionRaw": 13718}, "2764": {"acRate": 67.35582154515778, "difficulty": "Medium", "likes": 22, "dislikes": 1, "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": 619, "totalSubmissionRaw": 919}, "2765": {"acRate": 33.00378016865368, "difficulty": "Easy", "likes": 171, "dislikes": 146, "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": 19295, "totalSubmissionRaw": 58463}, "2766": {"acRate": 50.83770418102802, "difficulty": "Medium", "likes": 165, "dislikes": 11, "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": 16962, "totalSubmissionRaw": 33365}, "2767": {"acRate": 51.93815236692797, "difficulty": "Medium", "likes": 279, "dislikes": 8, "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": 11992, "totalSubmissionRaw": 23089}, "2768": {"acRate": 35.31982518871673, "difficulty": "Medium", "likes": 204, "dislikes": 17, "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": 6223, "totalSubmissionRaw": 17619}, "2769": {"acRate": 88.42013920942341, "difficulty": "Easy", "likes": 214, "dislikes": 228, "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": 47891, "totalSubmissionRaw": 54163}, "2770": {"acRate": 28.818669641908407, "difficulty": "Medium", "likes": 342, "dislikes": 10, "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": 21695, "totalSubmissionRaw": 75284}, "2771": {"acRate": 27.300785158303515, "difficulty": "Medium", "likes": 481, "dislikes": 9, "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": 16099, "totalSubmissionRaw": 58969}, "2772": {"acRate": 32.008575197889186, "difficulty": "Medium", "likes": 331, "dislikes": 18, "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": 9705, "totalSubmissionRaw": 30320}, "2773": {"acRate": 72.94117647058823, "difficulty": "Medium", "likes": 7, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 372, "totalSubmissionRaw": 510}, "2774": {"acRate": 79.9709724238026, "difficulty": "Easy", "likes": 12, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 551, "totalSubmissionRaw": 689}, "2775": {"acRate": 73.69942196531792, "difficulty": "Medium", "likes": 10, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 255, "totalSubmissionRaw": 346}, "2776": {"acRate": 92.93680297397769, "difficulty": "Medium", "likes": 9, "dislikes": 6, "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": 250, "totalSubmissionRaw": 269}, "2777": {"acRate": 91.70506912442397, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 199, "totalSubmissionRaw": 217}, "2778": {"acRate": 78.74263116071923, "difficulty": "Easy", "likes": 195, "dislikes": 55, "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": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42609, "totalSubmissionRaw": 54112}, "2779": {"acRate": 36.688513049162744, "difficulty": "Medium", "likes": 548, "dislikes": 11, "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": 21888, "totalSubmissionRaw": 59659}, "2780": {"acRate": 61.90593298493698, "difficulty": "Medium", "likes": 277, "dislikes": 11, "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": 20138, "totalSubmissionRaw": 32530}, "2781": {"acRate": 33.274390451253105, "difficulty": "Hard", "likes": 430, "dislikes": 6, "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": 9785, "totalSubmissionRaw": 29404}, "2782": {"acRate": 84.29268292682927, "difficulty": "Medium", "likes": 19, "dislikes": 1, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 864, "totalSubmissionRaw": 1025}, "2783": {"acRate": 35.427135678391956, "difficulty": "Medium", "likes": 10, "dislikes": 3, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 705, "totalSubmissionRaw": 1990}, "2784": {"acRate": 50.13659780402768, "difficulty": "Easy", "likes": 220, "dislikes": 39, "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": 38539, "totalSubmissionRaw": 76868}, "2785": {"acRate": 75.31998687233344, "difficulty": "Medium", "likes": 246, "dislikes": 7, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29835, "totalSubmissionRaw": 39611}, "2786": {"acRate": 35.14000084720634, "difficulty": "Medium", "likes": 429, "dislikes": 20, "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": 16591, "totalSubmissionRaw": 47214}, "2787": {"acRate": 33.04085123397827, "difficulty": "Medium", "likes": 336, "dislikes": 11, "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": 14874, "totalSubmissionRaw": 45017}, "2788": {"acRate": 71.48708193411883, "difficulty": "Easy", "likes": 238, "dislikes": 4, "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": 36828, "totalSubmissionRaw": 51517}, "2789": {"acRate": 46.32998301245753, "difficulty": "Medium", "likes": 402, "dislikes": 23, "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"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26182, "totalSubmissionRaw": 56512}, "2790": {"acRate": 18.810570486562096, "difficulty": "Hard", "likes": 375, "dislikes": 38, "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": 7531, "totalSubmissionRaw": 40031}, "2791": {"acRate": 44.34213445751054, "difficulty": "Hard", "likes": 331, "dislikes": 4, "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": 3997, "totalSubmissionRaw": 9014}, "2792": {"acRate": 59.43396226415094, "difficulty": "Hard", "likes": 14, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 441, "totalSubmissionRaw": 742}, "2793": {"acRate": 54.99351491569391, "difficulty": "Hard", "likes": 3, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 424, "totalSubmissionRaw": 771}, "2794": {"acRate": 65.14285714285715, "difficulty": "Easy", "likes": 6, "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": 456, "totalSubmissionRaw": 700}, "2795": {"acRate": 93.0327868852459, "difficulty": "Medium", "likes": 9, "dislikes": 4, "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": 227, "totalSubmissionRaw": 244}, "2796": {"acRate": 92.2675026123302, "difficulty": "Easy", "likes": 17, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 883, "totalSubmissionRaw": 957}, "2797": {"acRate": 92.67015706806284, "difficulty": "Easy", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 354, "totalSubmissionRaw": 382}, "2798": {"acRate": 87.62403621462357, "difficulty": "Easy", "likes": 320, "dislikes": 36, "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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77620, "totalSubmissionRaw": 88583}, "2799": {"acRate": 63.41928321568463, "difficulty": "Medium", "likes": 436, "dislikes": 9, "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": 30277, "totalSubmissionRaw": 47741}, "2800": {"acRate": 29.725052031985978, "difficulty": "Medium", "likes": 296, "dislikes": 237, "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": 13568, "totalSubmissionRaw": 45645}, "2801": {"acRate": 26.21404597017462, "difficulty": "Hard", "likes": 306, "dislikes": 8, "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": 6170, "totalSubmissionRaw": 23537}, "2802": {"acRate": 70.68527918781726, "difficulty": "Medium", "likes": 21, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 557, "totalSubmissionRaw": 788}, "2803": {"acRate": 83.9835728952772, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409, "totalSubmissionRaw": 487}, "2804": {"acRate": 91.91685912240185, "difficulty": "Easy", "likes": 7, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 398, "totalSubmissionRaw": 433}, "2805": {"acRate": 88.44221105527639, "difficulty": "Medium", "likes": 11, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176, "totalSubmissionRaw": 199}, "2806": {"acRate": 51.596860207322194, "difficulty": "Easy", "likes": 167, "dislikes": 37, "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": 34444, "totalSubmissionRaw": 66756}, "2807": {"acRate": 88.5345264596328, "difficulty": "Medium", "likes": 351, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40169, "totalSubmissionRaw": 45371}, "2808": {"acRate": 25.4151335481288, "difficulty": "Medium", "likes": 474, "dislikes": 24, "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"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13331, "totalSubmissionRaw": 52453}, "2809": {"acRate": 23.47631737299063, "difficulty": "Hard", "likes": 202, "dislikes": 10, "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": 2731, "totalSubmissionRaw": 11633}, "2810": {"acRate": 82.07529108724786, "difficulty": "Easy", "likes": 318, "dislikes": 4, "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": 47158, "totalSubmissionRaw": 57457}, "2811": {"acRate": 33.15242259392953, "difficulty": "Medium", "likes": 417, "dislikes": 82, "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": 26083, "totalSubmissionRaw": 78676}, "2812": {"acRate": 30.26223531061562, "difficulty": "Medium", "likes": 672, "dislikes": 67, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 15106, "totalSubmissionRaw": 49917}, "2813": {"acRate": 32.050947093403, "difficulty": "Hard", "likes": 264, "dislikes": 3, "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": "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": 4901, "totalSubmissionRaw": 15304}, "2814": {"acRate": 67.1484888304862, "difficulty": "Hard", "likes": 16, "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": 511, "totalSubmissionRaw": 761}, "2815": {"acRate": 57.63651946119887, "difficulty": "Easy", "likes": 258, "dislikes": 84, "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": 35643, "totalSubmissionRaw": 61841}, "2816": {"acRate": 47.83928768071484, "difficulty": "Medium", "likes": 374, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30410, "totalSubmissionRaw": 63567}, "2817": {"acRate": 31.852224911864575, "difficulty": "Medium", "likes": 595, "dislikes": 65, "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": 19606, "totalSubmissionRaw": 61553}, "2818": {"acRate": 32.250884602214356, "difficulty": "Hard", "likes": 291, "dislikes": 8, "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": 5651, "totalSubmissionRaw": 17522}, "2819": {"acRate": 55.660377358490564, "difficulty": "Hard", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 236, "totalSubmissionRaw": 424}, "2820": {"acRate": 68.68686868686868, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 544, "totalSubmissionRaw": 792}, "2821": {"acRate": 79.734219269103, "difficulty": "Easy", "likes": 11, "dislikes": 4, "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": 240, "totalSubmissionRaw": 301}, "2822": {"acRate": 68.76355748373102, "difficulty": "Easy", "likes": 12, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 317, "totalSubmissionRaw": 461}, "2823": {"acRate": 55.252918287937746, "difficulty": "Medium", "likes": 8, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142, "totalSubmissionRaw": 257}, "2824": {"acRate": 86.91818234644663, "difficulty": "Easy", "likes": 287, "dislikes": 19, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59831, "totalSubmissionRaw": 68836}, "2825": {"acRate": 46.66175285829377, "difficulty": "Medium", "likes": 261, "dislikes": 9, "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": 27221, "totalSubmissionRaw": 58338}, "2826": {"acRate": 40.95779465767896, "difficulty": "Medium", "likes": 331, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16284, "totalSubmissionRaw": 39758}, "2827": {"acRate": 16.72397301000491, "difficulty": "Hard", "likes": 295, "dislikes": 18, "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": 6469, "totalSubmissionRaw": 38681}, "2828": {"acRate": 82.9972371304265, "difficulty": "Easy", "likes": 230, "dislikes": 7, "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": 52269, "totalSubmissionRaw": 62977}, "2829": {"acRate": 60.74501388041188, "difficulty": "Medium", "likes": 300, "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": 30853, "totalSubmissionRaw": 50791}, "2830": {"acRate": 35.00205813748358, "difficulty": "Medium", "likes": 579, "dislikes": 19, "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": "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": 17857, "totalSubmissionRaw": 51017}, "2831": {"acRate": 34.165447383230166, "difficulty": "Medium", "likes": 553, "dislikes": 13, "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": 15178, "totalSubmissionRaw": 44425}, "2832": {"acRate": 74.1851368970013, "difficulty": "Medium", "likes": 20, "dislikes": 0, "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": 569, "totalSubmissionRaw": 767}, "2833": {"acRate": 63.053442804613915, "difficulty": "Easy", "likes": 192, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37553, "totalSubmissionRaw": 59558}, "2834": {"acRate": 41.81410744624758, "difficulty": "Medium", "likes": 270, "dislikes": 34, "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": 28549, "totalSubmissionRaw": 68276}, "2835": {"acRate": 30.625229413923893, "difficulty": "Hard", "likes": 496, "dislikes": 125, "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": 10012, "totalSubmissionRaw": 32692}, "2836": {"acRate": 29.166319646872658, "difficulty": "Hard", "likes": 198, "dislikes": 85, "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": 3502, "totalSubmissionRaw": 12007}, "2837": {"acRate": 71.84035476718404, "difficulty": "Easy", "likes": 11, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 646, "totalSubmissionRaw": 900}, "2838": {"acRate": 74.93638676844783, "difficulty": "Medium", "likes": 19, "dislikes": 0, "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": 589, "totalSubmissionRaw": 786}, "2839": {"acRate": 46.252179824431764, "difficulty": "Easy", "likes": 152, "dislikes": 19, "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": 31297, "totalSubmissionRaw": 67666}, "2840": {"acRate": 54.50468525031275, "difficulty": "Medium", "likes": 223, "dislikes": 2, "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": 23092, "totalSubmissionRaw": 42367}, "2841": {"acRate": 36.95632838210442, "difficulty": "Medium", "likes": 221, "dislikes": 130, "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": 20775, "totalSubmissionRaw": 56215}, "2842": {"acRate": 27.540951253207023, "difficulty": "Hard", "likes": 278, "dislikes": 16, "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": 8373, "totalSubmissionRaw": 30402}, "2843": {"acRate": 74.3346765265908, "difficulty": "Easy", "likes": 189, "dislikes": 7, "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": 33574, "totalSubmissionRaw": 45166}, "2844": {"acRate": 37.25965103059661, "difficulty": "Medium", "likes": 302, "dislikes": 47, "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": 22614, "totalSubmissionRaw": 60693}, "2845": {"acRate": 33.836098541980896, "difficulty": "Medium", "likes": 434, "dislikes": 57, "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": 11441, "totalSubmissionRaw": 33813}, "2846": {"acRate": 43.62194996396582, "difficulty": "Hard", "likes": 246, "dislikes": 3, "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": 4237, "totalSubmissionRaw": 9713}, "2847": {"acRate": 50.33557046979866, "difficulty": "Medium", "likes": 16, "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": 525, "totalSubmissionRaw": 1043}, "2848": {"acRate": 74.52674804268857, "difficulty": "Easy", "likes": 189, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33028, "totalSubmissionRaw": 44317}, "2849": {"acRate": 23.19206978905399, "difficulty": "Medium", "likes": 166, "dislikes": 194, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 23209, "totalSubmissionRaw": 100073}, "2850": {"acRate": 38.78654779074341, "difficulty": "Medium", "likes": 387, "dislikes": 37, "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": 11833, "totalSubmissionRaw": 30506}, "2851": {"acRate": 26.921387790953013, "difficulty": "Hard", "likes": 132, "dislikes": 16, "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": 1836, "totalSubmissionRaw": 6825}, "2852": {"acRate": 69.17510853835022, "difficulty": "Medium", "likes": 16, "dislikes": 0, "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": "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": 478, "totalSubmissionRaw": 691}, "2853": {"acRate": 76.28111273792094, "difficulty": "Easy", "likes": 7, "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": 521, "totalSubmissionRaw": 683}, "2854": {"acRate": 69.09788867562379, "difficulty": "Medium", "likes": 6, "dislikes": 1, "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": 360, "totalSubmissionRaw": 521}, "2855": {"acRate": 57.12882911730174, "difficulty": "Easy", "likes": 154, "dislikes": 5, "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": 26758, "totalSubmissionRaw": 46840}, "2856": {"acRate": 20.08087253301677, "difficulty": "Medium", "likes": 239, "dislikes": 83, "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": 16239, "totalSubmissionRaw": 80868}, "2857": {"acRate": 31.554061541871377, "difficulty": "Medium", "likes": 223, "dislikes": 33, "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": 8542, "totalSubmissionRaw": 27070}, "2858": {"acRate": 59.07734679825568, "difficulty": "Hard", "likes": 196, "dislikes": 2, "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": 5148, "totalSubmissionRaw": 8714}, "2859": {"acRate": 86.44411102775695, "difficulty": "Easy", "likes": 108, "dislikes": 8, "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": 34569, "totalSubmissionRaw": 39990}, "2860": {"acRate": 50.01001516582253, "difficulty": "Medium", "likes": 136, "dislikes": 259, "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": 17477, "totalSubmissionRaw": 34947}, "2861": {"acRate": 36.743708269132, "difficulty": "Medium", "likes": 214, "dislikes": 35, "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": 10731, "totalSubmissionRaw": 29204}, "2862": {"acRate": 42.8385698808234, "difficulty": "Hard", "likes": 146, "dislikes": 24, "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": 5931, "totalSubmissionRaw": 13845}, "2863": {"acRate": 71.77615571776155, "difficulty": "Medium", "likes": 15, "dislikes": 2, "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": 590, "totalSubmissionRaw": 822}, "2864": {"acRate": 71.90265486725663, "difficulty": "Easy", "likes": 119, "dislikes": 1, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29250, "totalSubmissionRaw": 40680}, "2865": {"acRate": 42.58715015598861, "difficulty": "Medium", "likes": 145, "dislikes": 25, "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": 18838, "totalSubmissionRaw": 44234}, "2866": {"acRate": 33.082378247571675, "difficulty": "Medium", "likes": 318, "dislikes": 19, "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": 9843, "totalSubmissionRaw": 29753}, "2867": {"acRate": 33.446184229087315, "difficulty": "Hard", "likes": 194, "dislikes": 5, "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": 4742, "totalSubmissionRaw": 14178}, "2868": {"acRate": 65.92039800995025, "difficulty": "Hard", "likes": 6, "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": 265, "totalSubmissionRaw": 402}, "2869": {"acRate": 57.827570518653324, "difficulty": "Easy", "likes": 87, "dislikes": 7, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25421, "totalSubmissionRaw": 43960}, "2870": {"acRate": 48.04956988331488, "difficulty": "Medium", "likes": 133, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 22566, "totalSubmissionRaw": 46964}, "2871": {"acRate": 42.93025817109909, "difficulty": "Medium", "likes": 176, "dislikes": 24, "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": 13253, "totalSubmissionRaw": 30871}, "2872": {"acRate": 60.82019383769709, "difficulty": "Hard", "likes": 150, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "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": 8409, "totalSubmissionRaw": 13826}, "2873": {"acRate": 43.91671181980029, "difficulty": "Easy", "likes": 104, "dislikes": 9, "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": 28367, "totalSubmissionRaw": 64592}, "2874": {"acRate": 40.653540505278144, "difficulty": "Medium", "likes": 217, "dislikes": 5, "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": 20565, "totalSubmissionRaw": 50586}, "2875": {"acRate": 30.035444916127435, "difficulty": "Medium", "likes": 281, "dislikes": 19, "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": 14575, "totalSubmissionRaw": 48526}, "2876": {"acRate": 31.27017604269789, "difficulty": "Hard", "likes": 244, "dislikes": 4, "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": 7265, "totalSubmissionRaw": 23232}, "2877": {"acRate": 81.32938924656342, "difficulty": "Easy", "likes": 33, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4674, "totalSubmissionRaw": 5747}, "2878": {"acRate": 84.8628192999054, "difficulty": "Easy", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3585, "totalSubmissionRaw": 4225}, "2879": {"acRate": 92.36902050113895, "difficulty": "Easy", "likes": 20, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4055, "totalSubmissionRaw": 4390}, "2880": {"acRate": 78.87470695493619, "difficulty": "Easy", "likes": 19, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3027, "totalSubmissionRaw": 3838}, "2881": {"acRate": 90.67269643866591, "difficulty": "Easy", "likes": 17, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3207, "totalSubmissionRaw": 3537}, "2882": {"acRate": 83.45035105315948, "difficulty": "Easy", "likes": 23, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2496, "totalSubmissionRaw": 2991}, "2883": {"acRate": 85.49188473004305, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2580, "totalSubmissionRaw": 3018}, "2884": {"acRate": 90.72673462676751, "difficulty": "Easy", "likes": 17, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2759, "totalSubmissionRaw": 3041}, "2885": {"acRate": 85.0632911392405, "difficulty": "Easy", "likes": 14, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2352, "totalSubmissionRaw": 2765}, "2886": {"acRate": 84.53167508744656, "difficulty": "Easy", "likes": 15, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2174, "totalSubmissionRaw": 2572}, "2887": {"acRate": 87.8765613519471, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2391, "totalSubmissionRaw": 2721}, "2888": {"acRate": 87.21165520032376, "difficulty": "Easy", "likes": 14, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2154, "totalSubmissionRaw": 2469}, "2889": {"acRate": 80.78375826251181, "difficulty": "Easy", "likes": 20, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1710, "totalSubmissionRaw": 2117}, "2890": {"acRate": 83.64348677766895, "difficulty": "Easy", "likes": 21, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1707, "totalSubmissionRaw": 2041}, "2891": {"acRate": 73.45702385460054, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1938, "totalSubmissionRaw": 2639}, "2892": {"acRate": 42.9305912596401, "difficulty": "Medium", "likes": 13, "dislikes": 0, "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": 334, "totalSubmissionRaw": 778}, "2893": {"acRate": 73.00380228136882, "difficulty": "Medium", "likes": 7, "dislikes": 1, "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": 192, "totalSubmissionRaw": 263}, "2894": {"acRate": 87.32807579468684, "difficulty": "Easy", "likes": 69, "dislikes": 5, "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": 32433, "totalSubmissionRaw": 37139}, "2895": {"acRate": 67.20249044856375, "difficulty": "Medium", "likes": 97, "dislikes": 17, "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": 23746, "totalSubmissionRaw": 35335}, "2896": {"acRate": 23.980653354589425, "difficulty": "Medium", "likes": 245, "dislikes": 60, "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": 8874, "totalSubmissionRaw": 37006}, "2897": {"acRate": 46.19660620245758, "difficulty": "Hard", "likes": 134, "dislikes": 2, "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": 4736, "totalSubmissionRaw": 10253}, "2898": {"acRate": 73.38403041825094, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 193, "totalSubmissionRaw": 263}, "2899": {"acRate": 61.66430181120107, "difficulty": "Easy", "likes": 23, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14762, "totalSubmissionRaw": 23942}, "2900": {"acRate": 61.7475347102978, "difficulty": "Medium", "likes": 28, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12574, "totalSubmissionRaw": 20370}, "2901": {"acRate": 20.40899462277986, "difficulty": "Medium", "likes": 56, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5003, "totalSubmissionRaw": 24532}, "2902": {"acRate": 9.731454400425418, "difficulty": "Hard", "likes": 40, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 725, "totalSubmissionRaw": 7499}} \ No newline at end of file +{"1": {"acRate": 50.85076962183188, "difficulty": "Easy", "likes": 52332, "dislikes": 1715, "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": 11104731, "totalSubmissionRaw": 21837890}, "2": {"acRate": 41.368464284927434, "difficulty": "Medium", "likes": 28676, "dislikes": 5532, "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": 3980634, "totalSubmissionRaw": 9622389}, "3": {"acRate": 34.06077163514618, "difficulty": "Medium", "likes": 37477, "dislikes": 1692, "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": 5011644, "totalSubmissionRaw": 14713838}, "4": {"acRate": 38.14749051362686, "difficulty": "Hard", "likes": 26444, "dislikes": 2901, "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": false, "totalAcceptedRaw": 2193307, "totalSubmissionRaw": 5749548}, "5": {"acRate": 32.82870812350606, "difficulty": "Medium", "likes": 27437, "dislikes": 1629, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2641601, "totalSubmissionRaw": 8046644}, "6": {"acRate": 46.07607135459038, "difficulty": "Medium", "likes": 6830, "dislikes": 13482, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1132171, "totalSubmissionRaw": 2457182}, "7": {"acRate": 27.902282973197888, "difficulty": "Medium", "likes": 11945, "dislikes": 13009, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2839548, "totalSubmissionRaw": 10176757}, "8": {"acRate": 16.784614349676712, "difficulty": "Medium", "likes": 3901, "dislikes": 12113, "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": 1352327, "totalSubmissionRaw": 8056944}, "9": {"acRate": 54.59096654204156, "difficulty": "Easy", "likes": 11287, "dislikes": 2609, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3747664, "totalSubmissionRaw": 6865030}, "10": {"acRate": 27.859712949008674, "difficulty": "Hard", "likes": 11479, "dislikes": 1926, "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": 864410, "totalSubmissionRaw": 3102724}, "11": {"acRate": 54.21864369097668, "difficulty": "Medium", "likes": 26951, "dislikes": 1482, "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": 2426501, "totalSubmissionRaw": 4475404}, "12": {"acRate": 63.23344705870898, "difficulty": "Medium", "likes": 6408, "dislikes": 5328, "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": 1104067, "totalSubmissionRaw": 1746012}, "13": {"acRate": 59.56921424121002, "difficulty": "Easy", "likes": 12578, "dislikes": 743, "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": 3065178, "totalSubmissionRaw": 5145574}, "14": {"acRate": 41.64694244281959, "difficulty": "Easy", "likes": 16069, "dislikes": 4249, "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": 2765120, "totalSubmissionRaw": 6639413}, "15": {"acRate": 33.40157867399837, "difficulty": "Medium", "likes": 28776, "dislikes": 2589, "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": 3003158, "totalSubmissionRaw": 8991062}, "16": {"acRate": 45.488861598584066, "difficulty": "Medium", "likes": 9894, "dislikes": 513, "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": 1099729, "totalSubmissionRaw": 2417600}, "17": {"acRate": 58.763023189787, "difficulty": "Medium", "likes": 17341, "dislikes": 905, "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": 1769620, "totalSubmissionRaw": 3011453}, "18": {"acRate": 35.777737381082225, "difficulty": "Medium", "likes": 10568, "dislikes": 1253, "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": 826609, "totalSubmissionRaw": 2310399}, "19": {"acRate": 42.75505865006993, "difficulty": "Medium", "likes": 17350, "dislikes": 715, "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": 2261275, "totalSubmissionRaw": 5288909}, "20": {"acRate": 40.18577281052359, "difficulty": "Easy", "likes": 22331, "dislikes": 1508, "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": 3863835, "totalSubmissionRaw": 9614931}, "21": {"acRate": 63.27776633220239, "difficulty": "Easy", "likes": 20262, "dislikes": 1890, "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": 3605857, "totalSubmissionRaw": 5698455}, "22": {"acRate": 73.5138246310018, "difficulty": "Medium", "likes": 19817, "dislikes": 813, "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": 1568442, "totalSubmissionRaw": 2133525}, "23": {"acRate": 51.09116091649992, "difficulty": "Hard", "likes": 18451, "dislikes": 662, "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": 1765452, "totalSubmissionRaw": 3455494}, "24": {"acRate": 63.204934593380656, "difficulty": "Medium", "likes": 11305, "dislikes": 411, "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": 1233814, "totalSubmissionRaw": 1952088}, "25": {"acRate": 56.75977581207624, "difficulty": "Hard", "likes": 12692, "dislikes": 625, "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": 788090, "totalSubmissionRaw": 1388464}, "26": {"acRate": 53.393967021585055, "difficulty": "Easy", "likes": 12880, "dislikes": 16998, "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": 3508012, "totalSubmissionRaw": 6570053}, "27": {"acRate": 54.82154968987514, "difficulty": "Easy", "likes": 1364, "dislikes": 1931, "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": 2223500, "totalSubmissionRaw": 4055891}, "28": {"acRate": 40.677479249676324, "difficulty": "Easy", "likes": 4923, "dislikes": 278, "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": 2026477, "totalSubmissionRaw": 4981824}, "29": {"acRate": 17.11211975426366, "difficulty": "Medium", "likes": 4712, "dislikes": 14209, "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": 654829, "totalSubmissionRaw": 3826681}, "30": {"acRate": 31.54223502808374, "difficulty": "Hard", "likes": 1410, "dislikes": 132, "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": 380522, "totalSubmissionRaw": 1206389}, "31": {"acRate": 38.68567362863746, "difficulty": "Medium", "likes": 17116, "dislikes": 4357, "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": 1164650, "totalSubmissionRaw": 3010545}, "32": {"acRate": 33.288665707015866, "difficulty": "Hard", "likes": 11800, "dislikes": 367, "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": 662778, "totalSubmissionRaw": 1990998}, "33": {"acRate": 40.03808336069596, "difficulty": "Medium", "likes": 24548, "dislikes": 1435, "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": 2368001, "totalSubmissionRaw": 5914371}, "34": {"acRate": 43.39271079810608, "difficulty": "Medium", "likes": 19262, "dislikes": 464, "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": 1784341, "totalSubmissionRaw": 4112086}, "35": {"acRate": 44.540214577764054, "difficulty": "Easy", "likes": 14912, "dislikes": 646, "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": 2458226, "totalSubmissionRaw": 5519117}, "36": {"acRate": 58.7155005297704, "difficulty": "Medium", "likes": 9805, "dislikes": 1011, "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": 1265143, "totalSubmissionRaw": 2154702}, "37": {"acRate": 59.403686029099, "difficulty": "Hard", "likes": 8880, "dislikes": 230, "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": 509742, "totalSubmissionRaw": 858099}, "38": {"acRate": 53.364161318368744, "difficulty": "Medium", "likes": 3582, "dislikes": 7425, "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": 835970, "totalSubmissionRaw": 1566540}, "39": {"acRate": 70.08736699849631, "difficulty": "Medium", "likes": 17662, "dislikes": 359, "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": 1656963, "totalSubmissionRaw": 2364146}, "40": {"acRate": 53.786547177189306, "difficulty": "Medium", "likes": 9712, "dislikes": 248, "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": 839051, "totalSubmissionRaw": 1559963}, "41": {"acRate": 37.20638993843798, "difficulty": "Hard", "likes": 15213, "dislikes": 1697, "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": 956358, "totalSubmissionRaw": 2570412}, "42": {"acRate": 60.02105238830101, "difficulty": "Hard", "likes": 29411, "dislikes": 423, "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": 1714040, "totalSubmissionRaw": 2855724}, "43": {"acRate": 39.540751183477546, "difficulty": "Medium", "likes": 6683, "dislikes": 3095, "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": 710725, "totalSubmissionRaw": 1797453}, "44": {"acRate": 27.294525705339662, "difficulty": "Hard", "likes": 7775, "dislikes": 318, "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": 512917, "totalSubmissionRaw": 1879199}, "45": {"acRate": 40.142744811506766, "difficulty": "Medium", "likes": 13524, "dislikes": 482, "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": 1024072, "totalSubmissionRaw": 2551081}, "46": {"acRate": 77.33072950364462, "difficulty": "Medium", "likes": 18034, "dislikes": 291, "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": 1822690, "totalSubmissionRaw": 2357008}, "47": {"acRate": 58.13029496178983, "difficulty": "Medium", "likes": 8140, "dislikes": 137, "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": 840533, "totalSubmissionRaw": 1445948}, "48": {"acRate": 72.77354628109842, "difficulty": "Medium", "likes": 16363, "dislikes": 713, "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": 1460011, "totalSubmissionRaw": 2006241}, "49": {"acRate": 67.06198408003692, "difficulty": "Medium", "likes": 17377, "dislikes": 515, "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": 2279816, "totalSubmissionRaw": 3399572}, "50": {"acRate": 34.05424371849407, "difficulty": "Medium", "likes": 8891, "dislikes": 8735, "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": 1418929, "totalSubmissionRaw": 4166673}, "51": {"acRate": 66.32105839215741, "difficulty": "Hard", "likes": 11483, "dislikes": 241, "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": 616244, "totalSubmissionRaw": 929182}, "52": {"acRate": 72.6857751978801, "difficulty": "Hard", "likes": 3623, "dislikes": 249, "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": 338212, "totalSubmissionRaw": 465307}, "53": {"acRate": 50.371452280705334, "difficulty": "Medium", "likes": 32254, "dislikes": 1347, "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": 3453890, "totalSubmissionRaw": 6856846}, "54": {"acRate": 47.767412694482225, "difficulty": "Medium", "likes": 13642, "dislikes": 1186, "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": 1221097, "totalSubmissionRaw": 2556339}, "55": {"acRate": 38.601053998743815, "difficulty": "Medium", "likes": 17994, "dislikes": 1030, "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": 1584976, "totalSubmissionRaw": 4106048}, "56": {"acRate": 46.599207476850324, "difficulty": "Medium", "likes": 20976, "dislikes": 710, "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": 2076037, "totalSubmissionRaw": 4455094}, "57": {"acRate": 39.44946330620652, "difficulty": "Medium", "likes": 9144, "dislikes": 665, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 858635, "totalSubmissionRaw": 2176546}, "58": {"acRate": 46.508400992369516, "difficulty": "Easy", "likes": 4163, "dislikes": 206, "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": 1397346, "totalSubmissionRaw": 3004511}, "59": {"acRate": 70.21237913559139, "difficulty": "Medium", "likes": 6058, "dislikes": 244, "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": 525221, "totalSubmissionRaw": 748047}, "60": {"acRate": 45.64335938848603, "difficulty": "Hard", "likes": 6302, "dislikes": 459, "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": 356957, "totalSubmissionRaw": 782058}, "61": {"acRate": 36.85501207688689, "difficulty": "Medium", "likes": 8895, "dislikes": 1411, "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": 818618, "totalSubmissionRaw": 2221185}, "62": {"acRate": 63.69521959614429, "difficulty": "Medium", "likes": 15722, "dislikes": 418, "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": 1610735, "totalSubmissionRaw": 2528817}, "63": {"acRate": 41.002200533150315, "difficulty": "Medium", "likes": 8261, "dislikes": 486, "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": 819646, "totalSubmissionRaw": 1999042}, "64": {"acRate": 62.95051694184253, "difficulty": "Medium", "likes": 11775, "dislikes": 152, "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": 1036301, "totalSubmissionRaw": 1646215}, "65": {"acRate": 18.97378719388656, "difficulty": "Hard", "likes": 1067, "dislikes": 1755, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 320089, "totalSubmissionRaw": 1687029}, "66": {"acRate": 44.29064362254486, "difficulty": "Easy", "likes": 8430, "dislikes": 5206, "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": 1907770, "totalSubmissionRaw": 4307412}, "67": {"acRate": 52.75559223068157, "difficulty": "Easy", "likes": 8824, "dislikes": 877, "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": 1271592, "totalSubmissionRaw": 2410349}, "68": {"acRate": 41.45822069079279, "difficulty": "Hard", "likes": 3321, "dislikes": 4289, "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": 361904, "totalSubmissionRaw": 872954}, "69": {"acRate": 37.988568154640326, "difficulty": "Easy", "likes": 7437, "dislikes": 4332, "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": false, "totalAcceptedRaw": 1665578, "totalSubmissionRaw": 4384419}, "70": {"acRate": 52.22714534104305, "difficulty": "Easy", "likes": 20172, "dislikes": 674, "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": 2686550, "totalSubmissionRaw": 5143973}, "71": {"acRate": 41.05624433858151, "difficulty": "Medium", "likes": 5043, "dislikes": 1054, "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": 622759, "totalSubmissionRaw": 1516845}, "72": {"acRate": 55.50636884662228, "difficulty": "Medium", "likes": 13905, "dislikes": 178, "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": 737395, "totalSubmissionRaw": 1328492}, "73": {"acRate": 53.63140020012162, "difficulty": "Medium", "likes": 13301, "dislikes": 658, "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": 1169523, "totalSubmissionRaw": 2180670}, "74": {"acRate": 49.28465472115438, "difficulty": "Medium", "likes": 14644, "dislikes": 379, "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": 1504709, "totalSubmissionRaw": 3053090}, "75": {"acRate": 60.550916871205864, "difficulty": "Medium", "likes": 16867, "dislikes": 582, "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": 1639292, "totalSubmissionRaw": 2707294}, "76": {"acRate": 41.305680870051816, "difficulty": "Hard", "likes": 16366, "dislikes": 672, "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": 1109424, "totalSubmissionRaw": 2685882}, "77": {"acRate": 69.40668189344763, "difficulty": "Medium", "likes": 7784, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 804357, "totalSubmissionRaw": 1158908}, "78": {"acRate": 76.26016992546796, "difficulty": "Medium", "likes": 15974, "dislikes": 234, "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": 1608422, "totalSubmissionRaw": 2109128}, "79": {"acRate": 40.79806443526315, "difficulty": "Medium", "likes": 14542, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1386585, "totalSubmissionRaw": 3398649}, "80": {"acRate": 55.34798681040404, "difficulty": "Medium", "likes": 6046, "dislikes": 1140, "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": 679303, "totalSubmissionRaw": 1227331}, "81": {"acRate": 37.27933480263069, "difficulty": "Medium", "likes": 7917, "dislikes": 978, "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": 637181, "totalSubmissionRaw": 1709207}, "82": {"acRate": 46.59974040174292, "difficulty": "Medium", "likes": 8321, "dislikes": 214, "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": 653762, "totalSubmissionRaw": 1402933}, "83": {"acRate": 51.540981917027025, "difficulty": "Easy", "likes": 8099, "dislikes": 272, "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": 1320264, "totalSubmissionRaw": 2561581}, "84": {"acRate": 43.417969993969415, "difficulty": "Hard", "likes": 16027, "dislikes": 230, "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": 756677, "totalSubmissionRaw": 1742777}, "85": {"acRate": 45.955064280901695, "difficulty": "Hard", "likes": 9394, "dislikes": 147, "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": 369680, "totalSubmissionRaw": 804438}, "86": {"acRate": 55.171504663884164, "difficulty": "Medium", "likes": 6950, "dislikes": 775, "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": 556636, "totalSubmissionRaw": 1008921}, "87": {"acRate": 39.3373608644469, "difficulty": "Hard", "likes": 3170, "dislikes": 1254, "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": 212857, "totalSubmissionRaw": 541106}, "88": {"acRate": 48.11574966607443, "difficulty": "Easy", "likes": 12930, "dislikes": 1440, "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": 2463590, "totalSubmissionRaw": 5120134}, "89": {"acRate": 58.050678477155856, "difficulty": "Medium", "likes": 2087, "dislikes": 2611, "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": 275119, "totalSubmissionRaw": 473929}, "90": {"acRate": 56.578025547854985, "difficulty": "Medium", "likes": 9118, "dislikes": 256, "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": 796264, "totalSubmissionRaw": 1407376}, "91": {"acRate": 33.400753898505606, "difficulty": "Medium", "likes": 10619, "dislikes": 4360, "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": 1084107, "totalSubmissionRaw": 3245776}, "92": {"acRate": 47.182668830150995, "difficulty": "Medium", "likes": 10900, "dislikes": 501, "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": 761558, "totalSubmissionRaw": 1614063}, "93": {"acRate": 48.5706443785263, "difficulty": "Medium", "likes": 4965, "dislikes": 765, "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": 422940, "totalSubmissionRaw": 870775}, "94": {"acRate": 74.8235827475517, "difficulty": "Easy", "likes": 12479, "dislikes": 660, "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": 2191788, "totalSubmissionRaw": 2929275}, "95": {"acRate": 56.49757073258244, "difficulty": "Medium", "likes": 7302, "dislikes": 485, "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": 421998, "totalSubmissionRaw": 746932}, "96": {"acRate": 60.43174463149791, "difficulty": "Medium", "likes": 9960, "dislikes": 381, "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": 613801, "totalSubmissionRaw": 1015692}, "97": {"acRate": 39.34108445534291, "difficulty": "Medium", "likes": 7822, "dislikes": 448, "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": 467186, "totalSubmissionRaw": 1187526}, "98": {"acRate": 32.37330964763919, "difficulty": "Medium", "likes": 15887, "dislikes": 1289, "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": 2092091, "totalSubmissionRaw": 6462399}, "99": {"acRate": 52.06892133458892, "difficulty": "Medium", "likes": 7501, "dislikes": 240, "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": 418564, "totalSubmissionRaw": 803868}, "100": {"acRate": 59.76210678353324, "difficulty": "Easy", "likes": 10507, "dislikes": 202, "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": false, "totalAcceptedRaw": 1741106, "totalSubmissionRaw": 2913399}, "101": {"acRate": 55.37155325707985, "difficulty": "Easy", "likes": 14457, "dislikes": 340, "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": 1782697, "totalSubmissionRaw": 3219518}, "102": {"acRate": 65.82680032070544, "difficulty": "Medium", "likes": 14413, "dislikes": 288, "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": 1967168, "totalSubmissionRaw": 2988398}, "103": {"acRate": 57.9671161434437, "difficulty": "Medium", "likes": 10167, "dislikes": 265, "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": 1043462, "totalSubmissionRaw": 1800093}, "104": {"acRate": 74.5971056752005, "difficulty": "Easy", "likes": 11964, "dislikes": 195, "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": false, "totalAcceptedRaw": 2636055, "totalSubmissionRaw": 3533720}, "105": {"acRate": 62.66829293641142, "difficulty": "Medium", "likes": 14054, "dislikes": 427, "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": 1073316, "totalSubmissionRaw": 1712701}, "106": {"acRate": 61.40369113779719, "difficulty": "Medium", "likes": 7626, "dislikes": 119, "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": 572986, "totalSubmissionRaw": 933149}, "107": {"acRate": 62.257186598108795, "difficulty": "Medium", "likes": 4634, "dislikes": 318, "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": 605519, "totalSubmissionRaw": 972609}, "108": {"acRate": 70.77058344184263, "difficulty": "Easy", "likes": 10345, "dislikes": 516, "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": false, "totalAcceptedRaw": 1077765, "totalSubmissionRaw": 1522901}, "109": {"acRate": 60.99540201011213, "difficulty": "Medium", "likes": 7183, "dislikes": 152, "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": 495340, "totalSubmissionRaw": 812094}, "110": {"acRate": 50.566271537725115, "difficulty": "Easy", "likes": 9959, "dislikes": 576, "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": 1265021, "totalSubmissionRaw": 2501710}, "111": {"acRate": 46.66752697633773, "difficulty": "Easy", "likes": 6941, "dislikes": 1246, "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": 1077668, "totalSubmissionRaw": 2309246}, "112": {"acRate": 49.180053637613085, "difficulty": "Easy", "likes": 9111, "dislikes": 1020, "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": 1278881, "totalSubmissionRaw": 2600408}, "113": {"acRate": 57.72388324744854, "difficulty": "Medium", "likes": 7549, "dislikes": 147, "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": 788269, "totalSubmissionRaw": 1365586}, "114": {"acRate": 63.397699907726235, "difficulty": "Medium", "likes": 11498, "dislikes": 536, "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": 845080, "totalSubmissionRaw": 1332983}, "115": {"acRate": 45.479075335693175, "difficulty": "Hard", "likes": 6227, "dislikes": 274, "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": 342658, "totalSubmissionRaw": 753441}, "116": {"acRate": 61.570438945315466, "difficulty": "Medium", "likes": 9254, "dislikes": 284, "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": 972338, "totalSubmissionRaw": 1579233}, "117": {"acRate": 51.29401898520969, "difficulty": "Medium", "likes": 5591, "dislikes": 308, "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": 578611, "totalSubmissionRaw": 1128032}, "118": {"acRate": 73.06932133050815, "difficulty": "Easy", "likes": 11943, "dislikes": 378, "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": 1456978, "totalSubmissionRaw": 1993969}, "119": {"acRate": 61.78472293442863, "difficulty": "Easy", "likes": 4170, "dislikes": 312, "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": 734662, "totalSubmissionRaw": 1189246}, "120": {"acRate": 55.677679975616165, "difficulty": "Medium", "likes": 8993, "dislikes": 518, "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": 663092, "totalSubmissionRaw": 1190950}, "121": {"acRate": 53.488915598290596, "difficulty": "Easy", "likes": 28709, "dislikes": 975, "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": 3877071, "totalSubmissionRaw": 7248364}, "122": {"acRate": 65.13444319076747, "difficulty": "Medium", "likes": 12601, "dislikes": 2608, "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": 1628475, "totalSubmissionRaw": 2500183}, "123": {"acRate": 46.917881041575335, "difficulty": "Hard", "likes": 9137, "dislikes": 165, "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": 536162, "totalSubmissionRaw": 1142768}, "124": {"acRate": 39.55852612228953, "difficulty": "Hard", "likes": 15645, "dislikes": 679, "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": 1076403, "totalSubmissionRaw": 2721036}, "125": {"acRate": 45.836516040067245, "difficulty": "Easy", "likes": 8326, "dislikes": 7939, "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": 2366657, "totalSubmissionRaw": 5163265}, "126": {"acRate": 27.339701265696633, "difficulty": "Hard", "likes": 5716, "dislikes": 707, "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": 351138, "totalSubmissionRaw": 1284345}, "127": {"acRate": 38.09462558044414, "difficulty": "Hard", "likes": 11370, "dislikes": 1832, "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": 971404, "totalSubmissionRaw": 2549980}, "128": {"acRate": 47.44093814939307, "difficulty": "Medium", "likes": 18483, "dislikes": 838, "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": 1387113, "totalSubmissionRaw": 2923873}, "129": {"acRate": 62.120507952516334, "difficulty": "Medium", "likes": 7191, "dislikes": 114, "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": 660294, "totalSubmissionRaw": 1062926}, "130": {"acRate": 38.13202437929011, "difficulty": "Medium", "likes": 7997, "dislikes": 1660, "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": 603685, "totalSubmissionRaw": 1583144}, "131": {"acRate": 66.3170550670865, "difficulty": "Medium", "likes": 11819, "dislikes": 382, "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": 712084, "totalSubmissionRaw": 1073758}, "132": {"acRate": 33.60509560748985, "difficulty": "Hard", "likes": 5192, "dislikes": 134, "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": 259101, "totalSubmissionRaw": 771017}, "133": {"acRate": 55.02827149808118, "difficulty": "Medium", "likes": 8887, "dislikes": 3536, "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": 1080163, "totalSubmissionRaw": 1962927}, "134": {"acRate": 45.803554530440074, "difficulty": "Medium", "likes": 11076, "dislikes": 966, "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": 672801, "totalSubmissionRaw": 1468879}, "135": {"acRate": 43.268775177782345, "difficulty": "Hard", "likes": 7193, "dislikes": 538, "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": 425549, "totalSubmissionRaw": 983495}, "136": {"acRate": 71.68363611573017, "difficulty": "Easy", "likes": 15417, "dislikes": 622, "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": 2418387, "totalSubmissionRaw": 3373697}, "137": {"acRate": 61.632783584520176, "difficulty": "Medium", "likes": 7415, "dislikes": 644, "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": 520379, "totalSubmissionRaw": 844321}, "138": {"acRate": 54.27792717172258, "difficulty": "Medium", "likes": 13054, "dislikes": 1329, "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": 1103470, "totalSubmissionRaw": 2033005}, "139": {"acRate": 46.262307980781294, "difficulty": "Medium", "likes": 16339, "dislikes": 709, "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": 1508701, "totalSubmissionRaw": 3261188}, "140": {"acRate": 46.47392119266648, "difficulty": "Hard", "likes": 6525, "dislikes": 520, "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": 539293, "totalSubmissionRaw": 1160423}, "141": {"acRate": 48.89782711141783, "difficulty": "Easy", "likes": 14274, "dislikes": 1175, "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": 2421769, "totalSubmissionRaw": 4952724}, "142": {"acRate": 50.095026391910395, "difficulty": "Medium", "likes": 12805, "dislikes": 895, "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": 1162405, "totalSubmissionRaw": 2320402}, "143": {"acRate": 54.66582452420632, "difficulty": "Medium", "likes": 9765, "dislikes": 322, "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": 759046, "totalSubmissionRaw": 1388521}, "144": {"acRate": 68.27090265716174, "difficulty": "Easy", "likes": 7542, "dislikes": 193, "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": 1442952, "totalSubmissionRaw": 2113567}, "145": {"acRate": 69.57503573757748, "difficulty": "Easy", "likes": 6506, "dislikes": 183, "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": 1056148, "totalSubmissionRaw": 1518002}, "146": {"acRate": 41.71074302777744, "difficulty": "Medium", "likes": 19501, "dislikes": 880, "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": 1452136, "totalSubmissionRaw": 3481444}, "147": {"acRate": 52.209091437362176, "difficulty": "Medium", "likes": 2920, "dislikes": 846, "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": 341413, "totalSubmissionRaw": 653934}, "148": {"acRate": 56.508720096940635, "difficulty": "Medium", "likes": 10821, "dislikes": 308, "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": 693905, "totalSubmissionRaw": 1227964}, "149": {"acRate": 25.871850486235036, "difficulty": "Hard", "likes": 3924, "dislikes": 440, "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": 359397, "totalSubmissionRaw": 1389143}, "150": {"acRate": 47.79047102378584, "difficulty": "Medium", "likes": 6617, "dislikes": 962, "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": 776974, "totalSubmissionRaw": 1625794}, "151": {"acRate": 37.41712185040395, "difficulty": "Medium", "likes": 7471, "dislikes": 4914, "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": 1157061, "totalSubmissionRaw": 3092337}, "152": {"acRate": 34.82243644578906, "difficulty": "Medium", "likes": 17511, "dislikes": 549, "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": 1115791, "totalSubmissionRaw": 3204231}, "153": {"acRate": 49.56010633933841, "difficulty": "Medium", "likes": 12126, "dislikes": 530, "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": 1498072, "totalSubmissionRaw": 3022745}, "154": {"acRate": 43.48294710909231, "difficulty": "Hard", "likes": 4451, "dislikes": 458, "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": 412304, "totalSubmissionRaw": 948197}, "155": {"acRate": 53.13447607660128, "difficulty": "Medium", "likes": 13093, "dislikes": 796, "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": 1429139, "totalSubmissionRaw": 2689661}, "156": {"acRate": 62.27554746831444, "difficulty": "Medium", "likes": 240, "dislikes": 318, "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": 98566, "totalSubmissionRaw": 158274}, "157": {"acRate": 41.18582503164854, "difficulty": "Easy", "likes": 554, "dislikes": 3393, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184139, "totalSubmissionRaw": 447096}, "158": {"acRate": 41.88307952424004, "difficulty": "Hard", "likes": 856, "dislikes": 1773, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 178356, "totalSubmissionRaw": 425844}, "159": {"acRate": 54.22210260939973, "difficulty": "Medium", "likes": 2120, "dislikes": 32, "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": 235723, "totalSubmissionRaw": 434736}, "160": {"acRate": 55.99482765251055, "difficulty": "Easy", "likes": 14151, "dislikes": 1244, "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": 1397826, "totalSubmissionRaw": 2496350}, "161": {"acRate": 34.221761629055116, "difficulty": "Medium", "likes": 1346, "dislikes": 184, "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": 195820, "totalSubmissionRaw": 572209}, "162": {"acRate": 45.78984033259791, "difficulty": "Medium", "likes": 10745, "dislikes": 4474, "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": 1148955, "totalSubmissionRaw": 2509192}, "163": {"acRate": 32.73940076711387, "difficulty": "Easy", "likes": 1014, "dislikes": 2909, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213305, "totalSubmissionRaw": 651522}, "164": {"acRate": 44.40153216348604, "difficulty": "Medium", "likes": 3039, "dislikes": 350, "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": 182106, "totalSubmissionRaw": 410136}, "165": {"acRate": 36.298955099289, "difficulty": "Medium", "likes": 2042, "dislikes": 2530, "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": 363962, "totalSubmissionRaw": 1002679}, "166": {"acRate": 24.574451111093254, "difficulty": "Medium", "likes": 1988, "dislikes": 3576, "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": 214085, "totalSubmissionRaw": 871169}, "167": {"acRate": 60.38935251788219, "difficulty": "Medium", "likes": 10854, "dislikes": 1311, "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": 1680330, "totalSubmissionRaw": 2782496}, "168": {"acRate": 39.545944569555914, "difficulty": "Easy", "likes": 5290, "dislikes": 739, "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": 478343, "totalSubmissionRaw": 1209588}, "169": {"acRate": 63.852915516337404, "difficulty": "Easy", "likes": 17239, "dislikes": 511, "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": 2127589, "totalSubmissionRaw": 3332016}, "170": {"acRate": 37.7474698523322, "difficulty": "Easy", "likes": 651, "dislikes": 436, "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": 147214, "totalSubmissionRaw": 389997}, "171": {"acRate": 62.92276101971296, "difficulty": "Easy", "likes": 4572, "dislikes": 350, "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": 637080, "totalSubmissionRaw": 1012480}, "172": {"acRate": 42.79161128939602, "difficulty": "Medium", "likes": 2978, "dislikes": 1909, "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": 401496, "totalSubmissionRaw": 938260}, "173": {"acRate": 70.83110965451209, "difficulty": "Medium", "likes": 8114, "dislikes": 467, "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": 715368, "totalSubmissionRaw": 1009963}, "174": {"acRate": 37.72035116237761, "difficulty": "Hard", "likes": 5547, "dislikes": 96, "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": 210234, "totalSubmissionRaw": 557349}, "175": {"acRate": 74.96527036147872, "difficulty": "Easy", "likes": 3240, "dislikes": 218, "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": 877445, "totalSubmissionRaw": 1170469}, "176": {"acRate": 39.037434843252875, "difficulty": "Medium", "likes": 3300, "dislikes": 898, "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": 741941, "totalSubmissionRaw": 1900581}, "177": {"acRate": 38.08689413334845, "difficulty": "Medium", "likes": 1831, "dislikes": 955, "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": 349294, "totalSubmissionRaw": 917102}, "178": {"acRate": 61.264118259705825, "difficulty": "Medium", "likes": 2020, "dislikes": 258, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340584, "totalSubmissionRaw": 555928}, "179": {"acRate": 35.30321705394294, "difficulty": "Medium", "likes": 7608, "dislikes": 601, "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": 426770, "totalSubmissionRaw": 1208870}, "180": {"acRate": 46.703242826053945, "difficulty": "Medium", "likes": 1827, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295299, "totalSubmissionRaw": 632288}, "181": {"acRate": 68.89518609649063, "difficulty": "Easy", "likes": 2394, "dislikes": 231, "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": 557483, "totalSubmissionRaw": 809174}, "182": {"acRate": 70.75232802588074, "difficulty": "Easy", "likes": 1919, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575840, "totalSubmissionRaw": 813875}, "183": {"acRate": 68.59993249286312, "difficulty": "Easy", "likes": 2460, "dislikes": 121, "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": 719461, "totalSubmissionRaw": 1048778}, "184": {"acRate": 50.661321985118946, "difficulty": "Medium", "likes": 1899, "dislikes": 182, "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": 338328, "totalSubmissionRaw": 667824}, "185": {"acRate": 51.16777562621528, "difficulty": "Hard", "likes": 1809, "dislikes": 215, "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": 254463, "totalSubmissionRaw": 497304}, "186": {"acRate": 53.58606557377049, "difficulty": "Medium", "likes": 1031, "dislikes": 141, "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": 152716, "totalSubmissionRaw": 284992}, "187": {"acRate": 47.84497682934599, "difficulty": "Medium", "likes": 3133, "dislikes": 504, "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": 345450, "totalSubmissionRaw": 722027}, "188": {"acRate": 41.10212861395425, "difficulty": "Hard", "likes": 7063, "dislikes": 202, "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": 403179, "totalSubmissionRaw": 980920}, "189": {"acRate": 39.87994721727293, "difficulty": "Medium", "likes": 16440, "dislikes": 1795, "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": 1756786, "totalSubmissionRaw": 4405171}, "190": {"acRate": 56.23716590942164, "difficulty": "Easy", "likes": 4794, "dislikes": 1275, "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": 695620, "totalSubmissionRaw": 1236940}, "191": {"acRate": 68.41398044469841, "difficulty": "Easy", "likes": 5864, "dislikes": 1221, "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": 1226009, "totalSubmissionRaw": 1792045}, "192": {"acRate": 25.45059933016041, "difficulty": "Medium", "likes": 512, "dislikes": 299, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46202, "totalSubmissionRaw": 181536}, "193": {"acRate": 25.739976476647158, "difficulty": "Easy", "likes": 379, "dislikes": 933, "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": 73970, "totalSubmissionRaw": 287374}, "194": {"acRate": 25.547437150217643, "difficulty": "Medium", "likes": 140, "dislikes": 282, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23007, "totalSubmissionRaw": 90056}, "195": {"acRate": 32.89176962133894, "difficulty": "Easy", "likes": 359, "dislikes": 456, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95098, "totalSubmissionRaw": 289124}, "196": {"acRate": 61.018751526494455, "difficulty": "Easy", "likes": 1399, "dislikes": 281, "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": 444701, "totalSubmissionRaw": 728794}, "197": {"acRate": 45.834274664074464, "difficulty": "Easy", "likes": 2312, "dislikes": 540, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442275, "totalSubmissionRaw": 964945}, "198": {"acRate": 49.988195558506746, "difficulty": "Medium", "likes": 19416, "dislikes": 362, "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": 1818799, "totalSubmissionRaw": 3638453}, "199": {"acRate": 62.3187464843842, "difficulty": "Medium", "likes": 11147, "dislikes": 742, "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": 1084618, "totalSubmissionRaw": 1740441}, "200": {"acRate": 57.90433603597127, "difficulty": "Medium", "likes": 21378, "dislikes": 460, "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": 2336024, "totalSubmissionRaw": 4034295}, "201": {"acRate": 42.72396845505376, "difficulty": "Medium", "likes": 3114, "dislikes": 217, "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": 257657, "totalSubmissionRaw": 603075}, "202": {"acRate": 55.38496311919662, "difficulty": "Easy", "likes": 9620, "dislikes": 1276, "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": 1271738, "totalSubmissionRaw": 2296179}, "203": {"acRate": 47.39693654921787, "difficulty": "Easy", "likes": 7845, "dislikes": 219, "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": 1013641, "totalSubmissionRaw": 2138628}, "204": {"acRate": 33.351901775623176, "difficulty": "Medium", "likes": 7480, "dislikes": 1356, "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": 787316, "totalSubmissionRaw": 2360629}, "205": {"acRate": 43.49375533670112, "difficulty": "Easy", "likes": 7728, "dislikes": 1681, "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": 1015171, "totalSubmissionRaw": 2334063}, "206": {"acRate": 74.88422813585967, "difficulty": "Easy", "likes": 19803, "dislikes": 357, "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": 3475370, "totalSubmissionRaw": 4640989}, "207": {"acRate": 46.2404279515586, "difficulty": "Medium", "likes": 15252, "dislikes": 609, "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": 1355214, "totalSubmissionRaw": 2930799}, "208": {"acRate": 63.925725502679185, "difficulty": "Medium", "likes": 10945, "dislikes": 121, "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": 903697, "totalSubmissionRaw": 1413667}, "209": {"acRate": 46.47678607335533, "difficulty": "Medium", "likes": 11783, "dislikes": 353, "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": 869073, "totalSubmissionRaw": 1869909}, "210": {"acRate": 49.41734346776161, "difficulty": "Medium", "likes": 10104, "dislikes": 319, "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": 901434, "totalSubmissionRaw": 1824135}, "211": {"acRate": 44.47085592753176, "difficulty": "Medium", "likes": 7241, "dislikes": 419, "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": 568738, "totalSubmissionRaw": 1278901}, "212": {"acRate": 36.13627918593106, "difficulty": "Hard", "likes": 8949, "dislikes": 423, "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": 593221, "totalSubmissionRaw": 1641623}, "213": {"acRate": 41.54109212164314, "difficulty": "Medium", "likes": 9188, "dislikes": 132, "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": 653038, "totalSubmissionRaw": 1572032}, "214": {"acRate": 32.73712908576524, "difficulty": "Hard", "likes": 3399, "dislikes": 228, "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": 165587, "totalSubmissionRaw": 505809}, "215": {"acRate": 67.04960572645076, "difficulty": "Medium", "likes": 16135, "dislikes": 785, "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": 2011263, "totalSubmissionRaw": 2999664}, "216": {"acRate": 68.68427730995501, "difficulty": "Medium", "likes": 5565, "dislikes": 100, "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": 446567, "totalSubmissionRaw": 650174}, "217": {"acRate": 61.04813669201295, "difficulty": "Easy", "likes": 10906, "dislikes": 1243, "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": 3293582, "totalSubmissionRaw": 5395048}, "218": {"acRate": 42.25267387906313, "difficulty": "Hard", "likes": 5689, "dislikes": 254, "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": 274639, "totalSubmissionRaw": 649992}, "219": {"acRate": 43.62326510944523, "difficulty": "Easy", "likes": 5572, "dislikes": 2879, "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": 773123, "totalSubmissionRaw": 1772285}, "220": {"acRate": 22.45666953265583, "difficulty": "Hard", "likes": 810, "dislikes": 42, "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": 238985, "totalSubmissionRaw": 1064205}, "221": {"acRate": 45.78590304172058, "difficulty": "Medium", "likes": 9605, "dislikes": 205, "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": 624609, "totalSubmissionRaw": 1364194}, "222": {"acRate": 62.79262331324512, "difficulty": "Easy", "likes": 8149, "dislikes": 453, "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": "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": 613498, "totalSubmissionRaw": 977022}, "223": {"acRate": 45.48482905187867, "difficulty": "Medium", "likes": 1894, "dislikes": 1615, "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": 207817, "totalSubmissionRaw": 456893}, "224": {"acRate": 42.72949465576453, "difficulty": "Hard", "likes": 5878, "dislikes": 431, "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": 409960, "totalSubmissionRaw": 959434}, "225": {"acRate": 62.33924278846153, "difficulty": "Easy", "likes": 5643, "dislikes": 1159, "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": 580902, "totalSubmissionRaw": 931840}, "226": {"acRate": 75.8589946705197, "difficulty": "Easy", "likes": 13208, "dislikes": 187, "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": 1762985, "totalSubmissionRaw": 2324034}, "227": {"acRate": 42.78221054010065, "difficulty": "Medium", "likes": 5827, "dislikes": 752, "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": 548837, "totalSubmissionRaw": 1282862}, "228": {"acRate": 49.6260602043071, "difficulty": "Easy", "likes": 3686, "dislikes": 1967, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 467140, "totalSubmissionRaw": 941321}, "229": {"acRate": 50.25510491889494, "difficulty": "Medium", "likes": 9052, "dislikes": 387, "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": 579074, "totalSubmissionRaw": 1152270}, "230": {"acRate": 71.36065752237994, "difficulty": "Medium", "likes": 10730, "dislikes": 201, "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": 1225770, "totalSubmissionRaw": 1717710}, "231": {"acRate": 46.34854223431992, "difficulty": "Easy", "likes": 5999, "dislikes": 382, "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": 1010067, "totalSubmissionRaw": 2179282}, "232": {"acRate": 64.05290088355694, "difficulty": "Easy", "likes": 6748, "dislikes": 384, "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": 739949, "totalSubmissionRaw": 1155213}, "233": {"acRate": 34.24816563451673, "difficulty": "Hard", "likes": 1394, "dislikes": 1406, "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": 83783, "totalSubmissionRaw": 244635}, "234": {"acRate": 51.09168947104427, "difficulty": "Easy", "likes": 15350, "dislikes": 824, "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": 1609378, "totalSubmissionRaw": 3149980}, "235": {"acRate": 63.206627609729956, "difficulty": "Medium", "likes": 10340, "dislikes": 288, "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": 1309210, "totalSubmissionRaw": 2071322}, "236": {"acRate": 60.46345519339329, "difficulty": "Medium", "likes": 15335, "dislikes": 354, "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": 1418737, "totalSubmissionRaw": 2346443}, "237": {"acRate": 77.35116773617872, "difficulty": "Medium", "likes": 3931, "dislikes": 1124, "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": 1158144, "totalSubmissionRaw": 1497255}, "238": {"acRate": 65.03337508312829, "difficulty": "Medium", "likes": 20278, "dislikes": 1164, "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": 1970444, "totalSubmissionRaw": 3029895}, "239": {"acRate": 46.43380151968685, "difficulty": "Hard", "likes": 17196, "dislikes": 593, "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": 907473, "totalSubmissionRaw": 1954340}, "240": {"acRate": 51.765017139018376, "difficulty": "Medium", "likes": 11305, "dislikes": 184, "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": 849158, "totalSubmissionRaw": 1640409}, "241": {"acRate": 64.72619883445994, "difficulty": "Medium", "likes": 5120, "dislikes": 240, "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": 205583, "totalSubmissionRaw": 317612}, "242": {"acRate": 63.365765622086634, "difficulty": "Easy", "likes": 10765, "dislikes": 338, "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": 2701734, "totalSubmissionRaw": 4263688}, "243": {"acRate": 65.12653665199575, "difficulty": "Easy", "likes": 1240, "dislikes": 109, "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": 205977, "totalSubmissionRaw": 316272}, "244": {"acRate": 60.99047790374874, "difficulty": "Medium", "likes": 1031, "dislikes": 313, "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": 149176, "totalSubmissionRaw": 244589}, "245": {"acRate": 58.22109294232421, "difficulty": "Medium", "likes": 489, "dislikes": 99, "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": 79969, "totalSubmissionRaw": 137354}, "246": {"acRate": 47.65902937494541, "difficulty": "Easy", "likes": 565, "dislikes": 983, "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": 163704, "totalSubmissionRaw": 343490}, "247": {"acRate": 51.734957621301916, "difficulty": "Medium", "likes": 878, "dislikes": 232, "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": 131905, "totalSubmissionRaw": 254963}, "248": {"acRate": 41.99615853087229, "difficulty": "Hard", "likes": 297, "dislikes": 185, "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": 35858, "totalSubmissionRaw": 85384}, "249": {"acRate": 64.62955556825179, "difficulty": "Medium", "likes": 1567, "dislikes": 316, "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": 203616, "totalSubmissionRaw": 315052}, "250": {"acRate": 56.05493613731727, "difficulty": "Medium", "likes": 1161, "dislikes": 395, "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": 145748, "totalSubmissionRaw": 260010}, "251": {"acRate": 49.28657848040007, "difficulty": "Medium", "likes": 700, "dislikes": 395, "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": 122211, "totalSubmissionRaw": 247960}, "252": {"acRate": 57.620265528400886, "difficulty": "Easy", "likes": 1938, "dislikes": 96, "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": 363391, "totalSubmissionRaw": 630666}, "253": {"acRate": 50.79701580506568, "difficulty": "Medium", "likes": 6709, "dislikes": 144, "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": 818750, "totalSubmissionRaw": 1611799}, "254": {"acRate": 49.264685318876076, "difficulty": "Medium", "likes": 1102, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123310, "totalSubmissionRaw": 250301}, "255": {"acRate": 48.57015042965594, "difficulty": "Medium", "likes": 1113, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"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": 72744, "totalSubmissionRaw": 149771}, "256": {"acRate": 61.65702478023185, "difficulty": "Medium", "likes": 2209, "dislikes": 128, "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": 193653, "totalSubmissionRaw": 314081}, "257": {"acRate": 62.56445253977271, "difficulty": "Easy", "likes": 6222, "dislikes": 266, "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": 661899, "totalSubmissionRaw": 1057948}, "258": {"acRate": 66.01840848144566, "difficulty": "Easy", "likes": 4537, "dislikes": 1912, "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": 703845, "totalSubmissionRaw": 1066135}, "259": {"acRate": 50.59707757666114, "difficulty": "Medium", "likes": 1491, "dislikes": 148, "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": 139823, "totalSubmissionRaw": 276346}, "260": {"acRate": 67.95586767914222, "difficulty": "Medium", "likes": 5438, "dislikes": 221, "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": 321451, "totalSubmissionRaw": 473030}, "261": {"acRate": 47.535029766940404, "difficulty": "Medium", "likes": 3152, "dislikes": 95, "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": 362418, "totalSubmissionRaw": 762422}, "262": {"acRate": 36.38128725455324, "difficulty": "Hard", "likes": 1158, "dislikes": 642, "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": 160583, "totalSubmissionRaw": 441389}, "263": {"acRate": 42.00660898537675, "difficulty": "Easy", "likes": 3119, "dislikes": 1623, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460935, "totalSubmissionRaw": 1097291}, "264": {"acRate": 46.1901129541762, "difficulty": "Medium", "likes": 5727, "dislikes": 284, "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": 321539, "totalSubmissionRaw": 696121}, "265": {"acRate": 54.02442120813424, "difficulty": "Hard", "likes": 1255, "dislikes": 34, "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": 117025, "totalSubmissionRaw": 216615}, "266": {"acRate": 66.40026592923171, "difficulty": "Easy", "likes": 1016, "dislikes": 68, "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": 187768, "totalSubmissionRaw": 282782}, "267": {"acRate": 40.90809740543598, "difficulty": "Medium", "likes": 852, "dislikes": 95, "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": 63635, "totalSubmissionRaw": 155556}, "268": {"acRate": 64.10386781811053, "difficulty": "Easy", "likes": 10795, "dislikes": 3228, "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": 1724727, "totalSubmissionRaw": 2690523}, "269": {"acRate": 35.465624770930546, "difficulty": "Hard", "likes": 4252, "dislikes": 949, "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": 353194, "totalSubmissionRaw": 995877}, "270": {"acRate": 53.21034795559887, "difficulty": "Easy", "likes": 1713, "dislikes": 113, "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": 299740, "totalSubmissionRaw": 563304}, "271": {"acRate": 44.864358415170294, "difficulty": "Medium", "likes": 1357, "dislikes": 364, "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": 168069, "totalSubmissionRaw": 374622}, "272": {"acRate": 58.67308560252745, "difficulty": "Hard", "likes": 1253, "dislikes": 41, "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": 113100, "totalSubmissionRaw": 192763}, "273": {"acRate": 30.207746882523022, "difficulty": "Hard", "likes": 2839, "dislikes": 6015, "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": 355737, "totalSubmissionRaw": 1177631}, "274": {"acRate": 38.48454296497132, "difficulty": "Medium", "likes": 784, "dislikes": 272, "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": 338954, "totalSubmissionRaw": 880754}, "275": {"acRate": 37.81970296751734, "difficulty": "Medium", "likes": 229, "dislikes": 41, "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": 188594, "totalSubmissionRaw": 498666}, "276": {"acRate": 45.22328675277013, "difficulty": "Medium", "likes": 1473, "dislikes": 378, "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": 102523, "totalSubmissionRaw": 226704}, "277": {"acRate": 46.854353414305386, "difficulty": "Medium", "likes": 2738, "dislikes": 261, "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": 254451, "totalSubmissionRaw": 543068}, "278": {"acRate": 43.80035553476536, "difficulty": "Easy", "likes": 8024, "dislikes": 3172, "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": 1565561, "totalSubmissionRaw": 3574320}, "279": {"acRate": 52.990968655923496, "difficulty": "Medium", "likes": 10139, "dislikes": 415, "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": 703209, "totalSubmissionRaw": 1327025}, "280": {"acRate": 67.37745377980167, "difficulty": "Medium", "likes": 1166, "dislikes": 99, "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": 135679, "totalSubmissionRaw": 201372}, "281": {"acRate": 63.268583231940234, "difficulty": "Medium", "likes": 650, "dislikes": 36, "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": 89439, "totalSubmissionRaw": 141364}, "282": {"acRate": 39.387089672345205, "difficulty": "Hard", "likes": 3200, "dislikes": 564, "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": 207529, "totalSubmissionRaw": 526896}, "283": {"acRate": 61.40412193283685, "difficulty": "Easy", "likes": 15423, "dislikes": 384, "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": false, "totalAcceptedRaw": 2526428, "totalSubmissionRaw": 4114428}, "284": {"acRate": 59.00196785648585, "difficulty": "Medium", "likes": 1794, "dislikes": 1021, "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": 211679, "totalSubmissionRaw": 358766}, "285": {"acRate": 49.12186436404891, "difficulty": "Medium", "likes": 2485, "dislikes": 88, "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": 311747, "totalSubmissionRaw": 634640}, "286": {"acRate": 60.82735412177384, "difficulty": "Medium", "likes": 2996, "dislikes": 54, "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": 285949, "totalSubmissionRaw": 470100}, "287": {"acRate": 59.35905588851892, "difficulty": "Medium", "likes": 21669, "dislikes": 3682, "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": 1415998, "totalSubmissionRaw": 2385479}, "288": {"acRate": 25.857811400037207, "difficulty": "Medium", "likes": 197, "dislikes": 1788, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 70891, "totalSubmissionRaw": 274157}, "289": {"acRate": 68.16004467383901, "difficulty": "Medium", "likes": 6030, "dislikes": 514, "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": 422319, "totalSubmissionRaw": 619600}, "290": {"acRate": 41.71297759347613, "difficulty": "Easy", "likes": 6810, "dislikes": 869, "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": 595282, "totalSubmissionRaw": 1427097}, "291": {"acRate": 47.328233857155524, "difficulty": "Medium", "likes": 863, "dislikes": 67, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 69360, "totalSubmissionRaw": 146551}, "292": {"acRate": 56.35996061527977, "difficulty": "Easy", "likes": 1587, "dislikes": 2627, "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": 344015, "totalSubmissionRaw": 610389}, "293": {"acRate": 63.44500213999456, "difficulty": "Easy", "likes": 202, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65224, "totalSubmissionRaw": 102804}, "294": {"acRate": 51.9659215139292, "difficulty": "Medium", "likes": 604, "dislikes": 61, "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": 68925, "totalSubmissionRaw": 132635}, "295": {"acRate": 51.491127995481364, "difficulty": "Hard", "likes": 11217, "dislikes": 218, "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": 690097, "totalSubmissionRaw": 1340224}, "296": {"acRate": 60.121030042918456, "difficulty": "Hard", "likes": 1073, "dislikes": 90, "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": 70039, "totalSubmissionRaw": 116497}, "297": {"acRate": 56.00469291563276, "difficulty": "Hard", "likes": 9592, "dislikes": 352, "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": 792887, "totalSubmissionRaw": 1415751}, "298": {"acRate": 53.15693764539389, "difficulty": "Medium", "likes": 1099, "dislikes": 234, "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": 142358, "totalSubmissionRaw": 267807}, "299": {"acRate": 49.81802737483007, "difficulty": "Medium", "likes": 2299, "dislikes": 1750, "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": 356581, "totalSubmissionRaw": 715767}, "300": {"acRate": 53.44148812866871, "difficulty": "Medium", "likes": 19008, "dislikes": 359, "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": 1373998, "totalSubmissionRaw": 2571039}, "301": {"acRate": 47.42264588740447, "difficulty": "Hard", "likes": 5676, "dislikes": 268, "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": 396496, "totalSubmissionRaw": 836089}, "302": {"acRate": 58.711142242940994, "difficulty": "Hard", "likes": 519, "dislikes": 96, "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": 48614, "totalSubmissionRaw": 82802}, "303": {"acRate": 61.38392452732519, "difficulty": "Easy", "likes": 3000, "dislikes": 1860, "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": 474332, "totalSubmissionRaw": 772730}, "304": {"acRate": 53.55556189317312, "difficulty": "Medium", "likes": 4734, "dislikes": 334, "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": 338015, "totalSubmissionRaw": 631150}, "305": {"acRate": 39.58721282007601, "difficulty": "Hard", "likes": 1772, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134781, "totalSubmissionRaw": 340466}, "306": {"acRate": 31.264889690070046, "difficulty": "Medium", "likes": 1084, "dislikes": 779, "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": 83597, "totalSubmissionRaw": 267382}, "307": {"acRate": 40.75733287532681, "difficulty": "Medium", "likes": 4563, "dislikes": 243, "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": 256287, "totalSubmissionRaw": 628812}, "308": {"acRate": 43.53465536152654, "difficulty": "Hard", "likes": 780, "dislikes": 89, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 75015, "totalSubmissionRaw": 172311}, "309": {"acRate": 57.36890722275649, "difficulty": "Medium", "likes": 8983, "dislikes": 293, "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": 453373, "totalSubmissionRaw": 790275}, "310": {"acRate": 38.6756993892922, "difficulty": "Medium", "likes": 7205, "dislikes": 299, "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": 267123, "totalSubmissionRaw": 690674}, "311": {"acRate": 67.79302785789369, "difficulty": "Medium", "likes": 1021, "dislikes": 347, "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": 181225, "totalSubmissionRaw": 267321}, "312": {"acRate": 58.05688773936468, "difficulty": "Hard", "likes": 8549, "dislikes": 218, "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": 254096, "totalSubmissionRaw": 437663}, "313": {"acRate": 45.313189686828856, "difficulty": "Medium", "likes": 2054, "dislikes": 369, "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": 122162, "totalSubmissionRaw": 269594}, "314": {"acRate": 52.766460030995354, "difficulty": "Medium", "likes": 3006, "dislikes": 296, "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": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337752, "totalSubmissionRaw": 640091}, "315": {"acRate": 42.40089276224891, "difficulty": "Hard", "likes": 8529, "dislikes": 230, "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": 303202, "totalSubmissionRaw": 715084}, "316": {"acRate": 48.85027595944038, "difficulty": "Medium", "likes": 8258, "dislikes": 564, "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": 304473, "totalSubmissionRaw": 623279}, "317": {"acRate": 42.656610941637624, "difficulty": "Hard", "likes": 1798, "dislikes": 254, "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": 158990, "totalSubmissionRaw": 372720}, "318": {"acRate": 59.80741489991437, "difficulty": "Medium", "likes": 3394, "dislikes": 137, "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": 208131, "totalSubmissionRaw": 348002}, "319": {"acRate": 52.52905578659589, "difficulty": "Medium", "likes": 2509, "dislikes": 3024, "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": 204244, "totalSubmissionRaw": 388821}, "320": {"acRate": 58.00245813756854, "difficulty": "Medium", "likes": 671, "dislikes": 221, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 66541, "totalSubmissionRaw": 114721}, "321": {"acRate": 29.49684884802149, "difficulty": "Hard", "likes": 1817, "dislikes": 342, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"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": 57100, "totalSubmissionRaw": 193580}, "322": {"acRate": 42.987194153355, "difficulty": "Medium", "likes": 17831, "dislikes": 404, "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": 1554924, "totalSubmissionRaw": 3617207}, "323": {"acRate": 62.448194274719846, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "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": 360273, "totalSubmissionRaw": 576915}, "324": {"acRate": 33.82937067990236, "difficulty": "Medium", "likes": 2940, "dislikes": 940, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149811, "totalSubmissionRaw": 442843}, "325": {"acRate": 49.34286295911055, "difficulty": "Medium", "likes": 1979, "dislikes": 60, "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": 176943, "totalSubmissionRaw": 358600}, "326": {"acRate": 45.90308881764106, "difficulty": "Easy", "likes": 2900, "dislikes": 263, "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": 742918, "totalSubmissionRaw": 1618450}, "327": {"acRate": 35.75451263537906, "difficulty": "Hard", "likes": 2186, "dislikes": 226, "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": 71804, "totalSubmissionRaw": 200825}, "328": {"acRate": 61.346362066068075, "difficulty": "Medium", "likes": 9216, "dislikes": 490, "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": 799448, "totalSubmissionRaw": 1303171}, "329": {"acRate": 52.94532733699825, "difficulty": "Hard", "likes": 8586, "dislikes": 127, "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": 476446, "totalSubmissionRaw": 899883}, "330": {"acRate": 40.79934127185204, "difficulty": "Hard", "likes": 1407, "dislikes": 129, "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": 64414, "totalSubmissionRaw": 157880}, "331": {"acRate": 44.82629133166587, "difficulty": "Medium", "likes": 2212, "dislikes": 114, "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": 133698, "totalSubmissionRaw": 298258}, "332": {"acRate": 43.50176574423356, "difficulty": "Hard", "likes": 5634, "dislikes": 1808, "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": 397507, "totalSubmissionRaw": 913764}, "333": {"acRate": 43.170980337952244, "difficulty": "Medium", "likes": 1427, "dislikes": 118, "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": 99946, "totalSubmissionRaw": 231512}, "334": {"acRate": 41.00983427182496, "difficulty": "Medium", "likes": 7419, "dislikes": 382, "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": 458747, "totalSubmissionRaw": 1118623}, "335": {"acRate": 29.70845180118046, "difficulty": "Hard", "likes": 356, "dislikes": 497, "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": 31660, "totalSubmissionRaw": 106569}, "336": {"acRate": 35.005149458376245, "difficulty": "Hard", "likes": 4354, "dislikes": 442, "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": 197477, "totalSubmissionRaw": 564135}, "337": {"acRate": 54.0620208985114, "difficulty": "Medium", "likes": 8184, "dislikes": 132, "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": 355798, "totalSubmissionRaw": 658131}, "338": {"acRate": 77.58330588227696, "difficulty": "Easy", "likes": 10555, "dislikes": 481, "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": 960915, "totalSubmissionRaw": 1238560}, "339": {"acRate": 82.54019360865011, "difficulty": "Medium", "likes": 1619, "dislikes": 372, "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": 233278, "totalSubmissionRaw": 282625}, "340": {"acRate": 48.37779626782251, "difficulty": "Medium", "likes": 2743, "dislikes": 79, "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": 325018, "totalSubmissionRaw": 671833}, "341": {"acRate": 62.10798100266652, "difficulty": "Medium", "likes": 4328, "dislikes": 1524, "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": 374531, "totalSubmissionRaw": 603032}, "342": {"acRate": 46.81066182449417, "difficulty": "Easy", "likes": 3286, "dislikes": 348, "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": 503729, "totalSubmissionRaw": 1076099}, "343": {"acRate": 59.91836705129041, "difficulty": "Medium", "likes": 4897, "dislikes": 421, "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": 330882, "totalSubmissionRaw": 552224}, "344": {"acRate": 77.28752569962593, "difficulty": "Easy", "likes": 7953, "dislikes": 1129, "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": 2275425, "totalSubmissionRaw": 2944105}, "345": {"acRate": 51.42875512852969, "difficulty": "Easy", "likes": 4053, "dislikes": 2672, "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": 639904, "totalSubmissionRaw": 1244257}, "346": {"acRate": 77.30625334045965, "difficulty": "Easy", "likes": 1544, "dislikes": 156, "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": 325440, "totalSubmissionRaw": 420975}, "347": {"acRate": 62.991011531101904, "difficulty": "Medium", "likes": 16134, "dislikes": 585, "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": 1736157, "totalSubmissionRaw": 2756198}, "348": {"acRate": 57.70505276823854, "difficulty": "Medium", "likes": 1985, "dislikes": 114, "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": 220461, "totalSubmissionRaw": 382048}, "349": {"acRate": 71.71342035047235, "difficulty": "Easy", "likes": 5316, "dislikes": 2196, "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": 934783, "totalSubmissionRaw": 1303498}, "350": {"acRate": 56.18887551977705, "difficulty": "Easy", "likes": 6881, "dislikes": 910, "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": 1122638, "totalSubmissionRaw": 1997971}, "351": {"acRate": 51.73350316979254, "difficulty": "Medium", "likes": 149, "dislikes": 168, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70669, "totalSubmissionRaw": 136602}, "352": {"acRate": 59.84948755490483, "difficulty": "Hard", "likes": 1686, "dislikes": 352, "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": 102193, "totalSubmissionRaw": 170750}, "353": {"acRate": 38.85140156356827, "difficulty": "Medium", "likes": 902, "dislikes": 318, "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": 78420, "totalSubmissionRaw": 201846}, "354": {"acRate": 37.31241246530947, "difficulty": "Hard", "likes": 5643, "dislikes": 137, "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": 201939, "totalSubmissionRaw": 541213}, "355": {"acRate": 38.48116832393861, "difficulty": "Medium", "likes": 3511, "dislikes": 446, "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": 145814, "totalSubmissionRaw": 378930}, "356": {"acRate": 35.13818019293083, "difficulty": "Medium", "likes": 276, "dislikes": 581, "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": 37737, "totalSubmissionRaw": 107396}, "357": {"acRate": 52.3630780436528, "difficulty": "Medium", "likes": 1419, "dislikes": 1457, "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": 126527, "totalSubmissionRaw": 241634}, "358": {"acRate": 38.42890387626885, "difficulty": "Hard", "likes": 932, "dislikes": 37, "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": 61595, "totalSubmissionRaw": 160283}, "359": {"acRate": 75.6537754180963, "difficulty": "Easy", "likes": 1642, "dislikes": 185, "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"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 290829, "totalSubmissionRaw": 384421}, "360": {"acRate": 55.3163371579104, "difficulty": "Medium", "likes": 655, "dislikes": 202, "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": 63205, "totalSubmissionRaw": 114261}, "361": {"acRate": 51.557693610678236, "difficulty": "Medium", "likes": 931, "dislikes": 114, "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": 76094, "totalSubmissionRaw": 147590}, "362": {"acRate": 68.4665791291469, "difficulty": "Medium", "likes": 1939, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "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": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220039, "totalSubmissionRaw": 321383}, "363": {"acRate": 43.97850007606105, "difficulty": "Hard", "likes": 3376, "dislikes": 167, "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": 121422, "totalSubmissionRaw": 276094}, "364": {"acRate": 66.08615393926556, "difficulty": "Medium", "likes": 1098, "dislikes": 421, "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": 131031, "totalSubmissionRaw": 198273}, "365": {"acRate": 39.00906392103382, "difficulty": "Medium", "likes": 1335, "dislikes": 1402, "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": 88959, "totalSubmissionRaw": 228047}, "366": {"acRate": 80.3914995431629, "difficulty": "Medium", "likes": 3129, "dislikes": 53, "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": 244604, "totalSubmissionRaw": 304266}, "367": {"acRate": 43.40866213513035, "difficulty": "Easy", "likes": 3971, "dislikes": 290, "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": 534264, "totalSubmissionRaw": 1230779}, "368": {"acRate": 42.17845401287928, "difficulty": "Medium", "likes": 4944, "dislikes": 187, "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": 195905, "totalSubmissionRaw": 464467}, "369": {"acRate": 60.93476729738927, "difficulty": "Medium", "likes": 913, "dislikes": 42, "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": 76999, "totalSubmissionRaw": 126363}, "370": {"acRate": 71.3566329636276, "difficulty": "Medium", "likes": 1600, "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": 90264, "totalSubmissionRaw": 126497}, "371": {"acRate": 51.07100361788039, "difficulty": "Medium", "likes": 3861, "dislikes": 5254, "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": 423204, "totalSubmissionRaw": 828658}, "372": {"acRate": 35.66306260444218, "difficulty": "Medium", "likes": 846, "dislikes": 1393, "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": 64451, "totalSubmissionRaw": 180722}, "373": {"acRate": 40.08866409528661, "difficulty": "Medium", "likes": 5856, "dislikes": 380, "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": 264410, "totalSubmissionRaw": 659565}, "374": {"acRate": 52.60330954565793, "difficulty": "Easy", "likes": 3401, "dislikes": 440, "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": 554905, "totalSubmissionRaw": 1054886}, "375": {"acRate": 47.96503779697624, "difficulty": "Medium", "likes": 2017, "dislikes": 2051, "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": 113702, "totalSubmissionRaw": 237053}, "376": {"acRate": 48.374309749964496, "difficulty": "Medium", "likes": 4941, "dislikes": 155, "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": 231622, "totalSubmissionRaw": 478812}, "377": {"acRate": 53.95522611829756, "difficulty": "Medium", "likes": 7145, "dislikes": 639, "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": 449846, "totalSubmissionRaw": 833742}, "378": {"acRate": 62.03574053978367, "difficulty": "Medium", "likes": 9532, "dislikes": 328, "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": 567096, "totalSubmissionRaw": 914144}, "379": {"acRate": 51.408199932017936, "difficulty": "Medium", "likes": 340, "dislikes": 457, "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": 63521, "totalSubmissionRaw": 123562}, "380": {"acRate": 52.80614505507937, "difficulty": "Medium", "likes": 8116, "dislikes": 450, "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": 691239, "totalSubmissionRaw": 1309016}, "381": {"acRate": 35.40023552799326, "difficulty": "Hard", "likes": 2174, "dislikes": 140, "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": 131063, "totalSubmissionRaw": 370230}, "382": {"acRate": 62.900573177880545, "difficulty": "Medium", "likes": 2996, "dislikes": 692, "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": 231770, "totalSubmissionRaw": 368471}, "383": {"acRate": 59.64444634411548, "difficulty": "Easy", "likes": 4569, "dislikes": 461, "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": 920981, "totalSubmissionRaw": 1544121}, "384": {"acRate": 57.976375351970034, "difficulty": "Medium", "likes": 1284, "dislikes": 894, "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": 317703, "totalSubmissionRaw": 547987}, "385": {"acRate": 37.38571695929133, "difficulty": "Medium", "likes": 439, "dislikes": 1305, "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": 53936, "totalSubmissionRaw": 144269}, "386": {"acRate": 62.61865775039791, "difficulty": "Medium", "likes": 1831, "dislikes": 134, "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": 109371, "totalSubmissionRaw": 174662}, "387": {"acRate": 60.18369807311142, "difficulty": "Easy", "likes": 8269, "dislikes": 266, "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": 1472663, "totalSubmissionRaw": 2446946}, "388": {"acRate": 46.87803082438423, "difficulty": "Medium", "likes": 1202, "dislikes": 2419, "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": 146454, "totalSubmissionRaw": 312415}, "389": {"acRate": 60.352299125048106, "difficulty": "Easy", "likes": 4751, "dislikes": 457, "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": 650806, "totalSubmissionRaw": 1078345}, "390": {"acRate": 45.914635024408504, "difficulty": "Medium", "likes": 1423, "dislikes": 665, "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": 63769, "totalSubmissionRaw": 138886}, "391": {"acRate": 33.16766789709442, "difficulty": "Hard", "likes": 830, "dislikes": 113, "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": 41243, "totalSubmissionRaw": 124347}, "392": {"acRate": 47.991395167097224, "difficulty": "Easy", "likes": 8917, "dislikes": 476, "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": 1125034, "totalSubmissionRaw": 2344243}, "393": {"acRate": 44.99334814882005, "difficulty": "Medium", "likes": 881, "dislikes": 2840, "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": 119047, "totalSubmissionRaw": 264588}, "394": {"acRate": 58.485285555496745, "difficulty": "Medium", "likes": 11873, "dislikes": 539, "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": 707168, "totalSubmissionRaw": 1209142}, "395": {"acRate": 44.86983692313093, "difficulty": "Medium", "likes": 5855, "dislikes": 466, "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": 204488, "totalSubmissionRaw": 455736}, "396": {"acRate": 41.79754562217842, "difficulty": "Medium", "likes": 1473, "dislikes": 257, "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": 78882, "totalSubmissionRaw": 188724}, "397": {"acRate": 35.41835664681558, "difficulty": "Medium", "likes": 1249, "dislikes": 474, "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": 107408, "totalSubmissionRaw": 303253}, "398": {"acRate": 62.53269405374409, "difficulty": "Medium", "likes": 1195, "dislikes": 1246, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 196287, "totalSubmissionRaw": 313895}, "399": {"acRate": 61.40811947933973, "difficulty": "Medium", "likes": 8695, "dislikes": 805, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411007, "totalSubmissionRaw": 669304}, "400": {"acRate": 34.30334893659541, "difficulty": "Medium", "likes": 986, "dislikes": 1944, "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": 89258, "totalSubmissionRaw": 260202}, "401": {"acRate": 53.17951195941048, "difficulty": "Easy", "likes": 1290, "dislikes": 2373, "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": 132065, "totalSubmissionRaw": 248339}, "402": {"acRate": 30.785889617682244, "difficulty": "Medium", "likes": 8251, "dislikes": 359, "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": 336624, "totalSubmissionRaw": 1093436}, "403": {"acRate": 45.86021615368449, "difficulty": "Hard", "likes": 5341, "dislikes": 240, "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": 246577, "totalSubmissionRaw": 537672}, "404": {"acRate": 57.28010793960965, "difficulty": "Easy", "likes": 4835, "dislikes": 281, "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": 467837, "totalSubmissionRaw": 816753}, "405": {"acRate": 47.5089522594488, "difficulty": "Easy", "likes": 1261, "dislikes": 204, "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": 131080, "totalSubmissionRaw": 275906}, "406": {"acRate": 73.1816394236102, "difficulty": "Medium", "likes": 6911, "dislikes": 692, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290294, "totalSubmissionRaw": 396676}, "407": {"acRate": 47.62541266484989, "difficulty": "Hard", "likes": 3601, "dislikes": 84, "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": 82662, "totalSubmissionRaw": 173567}, "408": {"acRate": 35.009929337559804, "difficulty": "Easy", "likes": 610, "dislikes": 2007, "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": 130106, "totalSubmissionRaw": 371626}, "409": {"acRate": 53.898052330813314, "difficulty": "Easy", "likes": 5054, "dislikes": 329, "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": 565998, "totalSubmissionRaw": 1050127}, "410": {"acRate": 54.38310319674204, "difficulty": "Hard", "likes": 9094, "dislikes": 189, "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": 296722, "totalSubmissionRaw": 545616}, "411": {"acRate": 39.60108496123181, "difficulty": "Hard", "likes": 179, "dislikes": 142, "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": 14454, "totalSubmissionRaw": 36499}, "412": {"acRate": 70.98831701926113, "difficulty": "Easy", "likes": 2401, "dislikes": 312, "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": 1090365, "totalSubmissionRaw": 1535983}, "413": {"acRate": 65.01977771444855, "difficulty": "Medium", "likes": 5054, "dislikes": 286, "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": 285193, "totalSubmissionRaw": 438625}, "414": {"acRate": 33.93615921723552, "difficulty": "Easy", "likes": 2809, "dislikes": 2970, "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": 472803, "totalSubmissionRaw": 1393215}, "415": {"acRate": 51.88985517721453, "difficulty": "Easy", "likes": 4767, "dislikes": 694, "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": 603053, "totalSubmissionRaw": 1162179}, "416": {"acRate": 46.181206847740796, "difficulty": "Medium", "likes": 11586, "dislikes": 210, "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": 714482, "totalSubmissionRaw": 1547123}, "417": {"acRate": 54.792982627618514, "difficulty": "Medium", "likes": 6928, "dislikes": 1345, "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": 403615, "totalSubmissionRaw": 736621}, "418": {"acRate": 35.72444085273232, "difficulty": "Medium", "likes": 1073, "dislikes": 524, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "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": 95482, "totalSubmissionRaw": 267278}, "419": {"acRate": 75.0300917603289, "difficulty": "Medium", "likes": 2148, "dislikes": 932, "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": 191990, "totalSubmissionRaw": 255884}, "420": {"acRate": 13.542547951283526, "difficulty": "Hard", "likes": 790, "dislikes": 1667, "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": 36016, "totalSubmissionRaw": 265947}, "421": {"acRate": 53.63109040395702, "difficulty": "Medium", "likes": 5226, "dislikes": 375, "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": 149413, "totalSubmissionRaw": 278594}, "422": {"acRate": 40.462281702433906, "difficulty": "Easy", "likes": 403, "dislikes": 261, "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": 52849, "totalSubmissionRaw": 130613}, "423": {"acRate": 51.134208483784974, "difficulty": "Medium", "likes": 784, "dislikes": 2615, "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": 75763, "totalSubmissionRaw": 148165}, "424": {"acRate": 52.71935049934697, "difficulty": "Medium", "likes": 9581, "dislikes": 418, "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": 565521, "totalSubmissionRaw": 1072700}, "425": {"acRate": 53.12287144253265, "difficulty": "Hard", "likes": 1070, "dislikes": 70, "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": 71752, "totalSubmissionRaw": 135068}, "426": {"acRate": 64.69276137707676, "difficulty": "Medium", "likes": 2460, "dislikes": 190, "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": 244489, "totalSubmissionRaw": 377925}, "427": {"acRate": 74.94153846153846, "difficulty": "Medium", "likes": 1387, "dislikes": 1734, "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": 103513, "totalSubmissionRaw": 138125}, "428": {"acRate": 66.31876619290087, "difficulty": "Hard", "likes": 1015, "dislikes": 56, "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": 81143, "totalSubmissionRaw": 122353}, "429": {"acRate": 70.72579345506401, "difficulty": "Medium", "likes": 3521, "dislikes": 134, "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": 289649, "totalSubmissionRaw": 409538}, "430": {"acRate": 59.79519531604468, "difficulty": "Medium", "likes": 4816, "dislikes": 310, "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": 303115, "totalSubmissionRaw": 506922}, "431": {"acRate": 79.14374273537389, "difficulty": "Hard", "likes": 503, "dislikes": 26, "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": 20427, "totalSubmissionRaw": 25810}, "432": {"acRate": 36.51847458990029, "difficulty": "Hard", "likes": 1474, "dislikes": 163, "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": 72663, "totalSubmissionRaw": 198976}, "433": {"acRate": 52.99637148180838, "difficulty": "Medium", "likes": 2721, "dislikes": 283, "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": 135101, "totalSubmissionRaw": 254925}, "434": {"acRate": 36.62266052371213, "difficulty": "Easy", "likes": 726, "dislikes": 1234, "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": 159536, "totalSubmissionRaw": 435621}, "435": {"acRate": 52.30491992418207, "difficulty": "Medium", "likes": 7581, "dislikes": 201, "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": 476009, "totalSubmissionRaw": 910067}, "436": {"acRate": 51.49079348523748, "difficulty": "Medium", "likes": 1993, "dislikes": 320, "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": 102685, "totalSubmissionRaw": 199420}, "437": {"acRate": 47.08154551145042, "difficulty": "Medium", "likes": 10311, "dislikes": 483, "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": 497172, "totalSubmissionRaw": 1055984}, "438": {"acRate": 50.465684956938205, "difficulty": "Medium", "likes": 11836, "dislikes": 321, "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": 807345, "totalSubmissionRaw": 1599791}, "439": {"acRate": 60.3668433094116, "difficulty": "Medium", "likes": 464, "dislikes": 62, "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": 30871, "totalSubmissionRaw": 51139}, "440": {"acRate": 31.614270052446, "difficulty": "Hard", "likes": 734, "dislikes": 86, "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": 21339, "totalSubmissionRaw": 67498}, "441": {"acRate": 46.377874688543365, "difficulty": "Easy", "likes": 3630, "dislikes": 1278, "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": 391996, "totalSubmissionRaw": 845222}, "442": {"acRate": 73.6102841185357, "difficulty": "Medium", "likes": 9298, "dislikes": 326, "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": 566199, "totalSubmissionRaw": 769185}, "443": {"acRate": 53.052319433805316, "difficulty": "Medium", "likes": 4406, "dislikes": 7012, "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": 451552, "totalSubmissionRaw": 851146}, "444": {"acRate": 27.378275386703987, "difficulty": "Medium", "likes": 540, "dislikes": 1478, "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": 52231, "totalSubmissionRaw": 190778}, "445": {"acRate": 61.02961391529854, "difficulty": "Medium", "likes": 5701, "dislikes": 279, "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": 446193, "totalSubmissionRaw": 731109}, "446": {"acRate": 46.579794684598916, "difficulty": "Hard", "likes": 2394, "dislikes": 116, "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": 76818, "totalSubmissionRaw": 164917}, "447": {"acRate": 55.13563498308511, "difficulty": "Medium", "likes": 795, "dislikes": 994, "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": 95995, "totalSubmissionRaw": 174107}, "448": {"acRate": 60.41920203988885, "difficulty": "Easy", "likes": 8965, "dislikes": 454, "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": 792363, "totalSubmissionRaw": 1311443}, "449": {"acRate": 57.33465633706064, "difficulty": "Medium", "likes": 3405, "dislikes": 161, "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": 225350, "totalSubmissionRaw": 393044}, "450": {"acRate": 50.67610454414515, "difficulty": "Medium", "likes": 8424, "dislikes": 226, "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": 415165, "totalSubmissionRaw": 819247}, "451": {"acRate": 70.40610030858842, "difficulty": "Medium", "likes": 7322, "dislikes": 242, "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": 547799, "totalSubmissionRaw": 778057}, "452": {"acRate": 55.64736672821879, "difficulty": "Medium", "likes": 6520, "dislikes": 184, "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": 340834, "totalSubmissionRaw": 612489}, "453": {"acRate": 56.39297692127828, "difficulty": "Medium", "likes": 2450, "dislikes": 1869, "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": 161589, "totalSubmissionRaw": 286541}, "454": {"acRate": 57.13133612786366, "difficulty": "Medium", "likes": 4778, "dislikes": 135, "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": 308159, "totalSubmissionRaw": 539387}, "455": {"acRate": 49.702750821038855, "difficulty": "Easy", "likes": 2679, "dislikes": 242, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 255160, "totalSubmissionRaw": 513373}, "456": {"acRate": 33.69901851387972, "difficulty": "Medium", "likes": 6893, "dislikes": 395, "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": 236771, "totalSubmissionRaw": 702607}, "457": {"acRate": 33.17771931008118, "difficulty": "Medium", "likes": 624, "dislikes": 644, "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": 73769, "totalSubmissionRaw": 222345}, "458": {"acRate": 61.47889672449834, "difficulty": "Hard", "likes": 1411, "dislikes": 2867, "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": 75584, "totalSubmissionRaw": 122943}, "459": {"acRate": 46.05426836541684, "difficulty": "Easy", "likes": 6151, "dislikes": 487, "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": 405391, "totalSubmissionRaw": 880246}, "460": {"acRate": 43.61841555422172, "difficulty": "Hard", "likes": 5367, "dislikes": 319, "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": 229637, "totalSubmissionRaw": 526468}, "461": {"acRate": 75.16890329828978, "difficulty": "Easy", "likes": 3714, "dislikes": 215, "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": 544618, "totalSubmissionRaw": 724526}, "462": {"acRate": 59.95843594972796, "difficulty": "Medium", "likes": 3219, "dislikes": 119, "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": 169933, "totalSubmissionRaw": 283418}, "463": {"acRate": 69.94170883949516, "difficulty": "Easy", "likes": 6029, "dislikes": 303, "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": 464228, "totalSubmissionRaw": 663736}, "464": {"acRate": 29.525971751300407, "difficulty": "Medium", "likes": 2557, "dislikes": 367, "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": 89345, "totalSubmissionRaw": 302598}, "465": {"acRate": 49.357541066690516, "difficulty": "Hard", "likes": 1387, "dislikes": 129, "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": 82780, "totalSubmissionRaw": 167715}, "466": {"acRate": 29.64719938154473, "difficulty": "Hard", "likes": 387, "dislikes": 338, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 16874, "totalSubmissionRaw": 56916}, "467": {"acRate": 39.090858167152135, "difficulty": "Medium", "likes": 1375, "dislikes": 167, "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": 41871, "totalSubmissionRaw": 107110}, "468": {"acRate": 26.731274302016427, "difficulty": "Medium", "likes": 933, "dislikes": 2654, "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": 148701, "totalSubmissionRaw": 556281}, "469": {"acRate": 39.298969072164944, "difficulty": "Medium", "likes": 97, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10483, "totalSubmissionRaw": 26675}, "470": {"acRate": 46.009543982665015, "difficulty": "Medium", "likes": 1055, "dislikes": 353, "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": 75590, "totalSubmissionRaw": 164292}, "471": {"acRate": 50.49261906352282, "difficulty": "Hard", "likes": 619, "dislikes": 49, "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": 30237, "totalSubmissionRaw": 59884}, "472": {"acRate": 49.74622710350309, "difficulty": "Hard", "likes": 3743, "dislikes": 276, "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": 214059, "totalSubmissionRaw": 430302}, "473": {"acRate": 40.167765828191236, "difficulty": "Medium", "likes": 3669, "dislikes": 280, "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": 151414, "totalSubmissionRaw": 376954}, "474": {"acRate": 47.152257139309974, "difficulty": "Medium", "likes": 5222, "dislikes": 432, "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": 186101, "totalSubmissionRaw": 394681}, "475": {"acRate": 36.99768639656264, "difficulty": "Medium", "likes": 1971, "dislikes": 1131, "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": 107462, "totalSubmissionRaw": 290454}, "476": {"acRate": 67.4906897773323, "difficulty": "Easy", "likes": 2578, "dislikes": 118, "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": 312437, "totalSubmissionRaw": 462933}, "477": {"acRate": 52.27600454075946, "difficulty": "Medium", "likes": 2128, "dislikes": 88, "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": 102232, "totalSubmissionRaw": 195562}, "478": {"acRate": 39.55115904403239, "difficulty": "Medium", "likes": 434, "dislikes": 758, "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": 38543, "totalSubmissionRaw": 97451}, "479": {"acRate": 32.472110538535595, "difficulty": "Hard", "likes": 165, "dislikes": 1540, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22937, "totalSubmissionRaw": 70636}, "480": {"acRate": 39.85221777866715, "difficulty": "Hard", "likes": 3032, "dislikes": 178, "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": 133430, "totalSubmissionRaw": 334809}, "481": {"acRate": 50.92143256685866, "difficulty": "Medium", "likes": 281, "dislikes": 1204, "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": 33683, "totalSubmissionRaw": 66147}, "482": {"acRate": 43.40878960461178, "difficulty": "Easy", "likes": 1035, "dislikes": 1364, "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": 262272, "totalSubmissionRaw": 604191}, "483": {"acRate": 39.409803921568624, "difficulty": "Hard", "likes": 364, "dislikes": 479, "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": 20099, "totalSubmissionRaw": 51000}, "484": {"acRate": 66.87879871290669, "difficulty": "Medium", "likes": 676, "dislikes": 133, "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": 37412, "totalSubmissionRaw": 55940}, "485": {"acRate": 57.784143944688616, "difficulty": "Easy", "likes": 5221, "dislikes": 445, "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": 985522, "totalSubmissionRaw": 1705530}, "486": {"acRate": 55.449377199118786, "difficulty": "Medium", "likes": 5577, "dislikes": 259, "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": 212431, "totalSubmissionRaw": 383108}, "487": {"acRate": 49.87173458425566, "difficulty": "Medium", "likes": 1459, "dislikes": 24, "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": 130447, "totalSubmissionRaw": 261566}, "488": {"acRate": 33.224127098106095, "difficulty": "Hard", "likes": 427, "dislikes": 481, "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": 22209, "totalSubmissionRaw": 66846}, "489": {"acRate": 76.56724972621107, "difficulty": "Hard", "likes": 2674, "dislikes": 163, "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": 149616, "totalSubmissionRaw": 195405}, "490": {"acRate": 56.9967591970938, "difficulty": "Medium", "likes": 1773, "dislikes": 178, "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": 157053, "totalSubmissionRaw": 275548}, "491": {"acRate": 60.3965013685643, "difficulty": "Medium", "likes": 3529, "dislikes": 224, "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": 157990, "totalSubmissionRaw": 261588}, "492": {"acRate": 56.11167931287449, "difficulty": "Easy", "likes": 653, "dislikes": 374, "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": 104788, "totalSubmissionRaw": 186749}, "493": {"acRate": 30.45507009451361, "difficulty": "Hard", "likes": 5678, "dislikes": 242, "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": 148290, "totalSubmissionRaw": 486914}, "494": {"acRate": 46.09658802847334, "difficulty": "Medium", "likes": 10262, "dislikes": 331, "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": 517348, "totalSubmissionRaw": 1122313}, "495": {"acRate": 56.50370210415724, "difficulty": "Easy", "likes": 1035, "dislikes": 107, "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": 136066, "totalSubmissionRaw": 240809}, "496": {"acRate": 71.69823854651915, "difficulty": "Easy", "likes": 7203, "dislikes": 543, "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": 604410, "totalSubmissionRaw": 842993}, "497": {"acRate": 39.52051178534828, "difficulty": "Medium", "likes": 449, "dislikes": 656, "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": 38178, "totalSubmissionRaw": 96603}, "498": {"acRate": 58.71162314318351, "difficulty": "Medium", "likes": 3165, "dislikes": 636, "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": 258525, "totalSubmissionRaw": 440333}, "499": {"acRate": 48.14845428996528, "difficulty": "Hard", "likes": 453, "dislikes": 68, "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": 29124, "totalSubmissionRaw": 60489}, "500": {"acRate": 70.05869619515444, "difficulty": "Easy", "likes": 1480, "dislikes": 1102, "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": 201954, "totalSubmissionRaw": 288264}, "501": {"acRate": 50.19323079937305, "difficulty": "Easy", "likes": 3078, "dislikes": 676, "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": 204949, "totalSubmissionRaw": 408320}, "502": {"acRate": 49.58943268352478, "difficulty": "Hard", "likes": 2879, "dislikes": 181, "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": 104778, "totalSubmissionRaw": 211285}, "503": {"acRate": 63.436806561879436, "difficulty": "Medium", "likes": 7443, "dislikes": 180, "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": 342768, "totalSubmissionRaw": 540331}, "504": {"acRate": 49.21808871717942, "difficulty": "Easy", "likes": 747, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117457, "totalSubmissionRaw": 238646}, "505": {"acRate": 53.146597432990816, "difficulty": "Medium", "likes": 1286, "dislikes": 56, "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": 101736, "totalSubmissionRaw": 191427}, "506": {"acRate": 62.28652331652066, "difficulty": "Easy", "likes": 1246, "dislikes": 62, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 140780, "totalSubmissionRaw": 226020}, "507": {"acRate": 38.497487212815464, "difficulty": "Easy", "likes": 976, "dislikes": 1180, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155198, "totalSubmissionRaw": 403138}, "508": {"acRate": 65.63694739441837, "difficulty": "Medium", "likes": 2137, "dislikes": 297, "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": 132883, "totalSubmissionRaw": 202451}, "509": {"acRate": 70.3783294429141, "difficulty": "Easy", "likes": 7604, "dislikes": 332, "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": 1526806, "totalSubmissionRaw": 2169427}, "510": {"acRate": 60.986695475293686, "difficulty": "Medium", "likes": 840, "dislikes": 40, "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": 62662, "totalSubmissionRaw": 102747}, "511": {"acRate": 74.43023846104711, "difficulty": "Easy", "likes": 755, "dislikes": 25, "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": 221389, "totalSubmissionRaw": 297445}, "512": {"acRate": 52.44396884056044, "difficulty": "Easy", "likes": 253, "dislikes": 41, "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": 78903, "totalSubmissionRaw": 150452}, "513": {"acRate": 67.50593586321885, "difficulty": "Medium", "likes": 3119, "dislikes": 252, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 229157, "totalSubmissionRaw": 339460}, "514": {"acRate": 47.24362610151203, "difficulty": "Hard", "likes": 874, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 34151, "totalSubmissionRaw": 72287}, "515": {"acRate": 64.47772708530081, "difficulty": "Medium", "likes": 2837, "dislikes": 98, "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": 242372, "totalSubmissionRaw": 375902}, "516": {"acRate": 62.22290347930466, "difficulty": "Medium", "likes": 9065, "dislikes": 315, "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": 432321, "totalSubmissionRaw": 694794}, "517": {"acRate": 40.798067459962425, "difficulty": "Hard", "likes": 733, "dislikes": 209, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 27360, "totalSubmissionRaw": 67062}, "518": {"acRate": 63.157771348996846, "difficulty": "Medium", "likes": 8848, "dislikes": 154, "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": 538798, "totalSubmissionRaw": 853102}, "519": {"acRate": 40.49271656240011, "difficulty": "Medium", "likes": 390, "dislikes": 112, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 17735, "totalSubmissionRaw": 43798}, "520": {"acRate": 56.691368575095055, "difficulty": "Easy", "likes": 3309, "dislikes": 452, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 405989, "totalSubmissionRaw": 716139}, "521": {"acRate": 60.46889494177218, "difficulty": "Easy", "likes": 787, "dislikes": 6378, "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": 102343, "totalSubmissionRaw": 169249}, "522": {"acRate": 40.857703057861585, "difficulty": "Medium", "likes": 485, "dislikes": 1254, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 48970, "totalSubmissionRaw": 119855}, "523": {"acRate": 28.568152676760093, "difficulty": "Medium", "likes": 5197, "dislikes": 502, "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": 414854, "totalSubmissionRaw": 1452159}, "524": {"acRate": 51.07086427830638, "difficulty": "Medium", "likes": 1711, "dislikes": 355, "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": 146746, "totalSubmissionRaw": 287338}, "525": {"acRate": 46.85926050957142, "difficulty": "Medium", "likes": 6769, "dislikes": 270, "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": 310929, "totalSubmissionRaw": 663538}, "526": {"acRate": 64.28059844023556, "difficulty": "Medium", "likes": 3076, "dislikes": 348, "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": 161550, "totalSubmissionRaw": 251319}, "527": {"acRate": 60.77630703585603, "difficulty": "Hard", "likes": 382, "dislikes": 284, "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": 26493, "totalSubmissionRaw": 43591}, "528": {"acRate": 46.23596957946313, "difficulty": "Medium", "likes": 1606, "dislikes": 657, "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": 384532, "totalSubmissionRaw": 831674}, "529": {"acRate": 66.08768259561036, "difficulty": "Medium", "likes": 1867, "dislikes": 1022, "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": 144050, "totalSubmissionRaw": 217969}, "530": {"acRate": 58.64591404647952, "difficulty": "Easy", "likes": 4097, "dislikes": 198, "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": 312588, "totalSubmissionRaw": 533008}, "531": {"acRate": 62.151750913751, "difficulty": "Medium", "likes": 419, "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": 40981, "totalSubmissionRaw": 65937}, "532": {"acRate": 41.95407692637721, "difficulty": "Medium", "likes": 3649, "dislikes": 2218, "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": 312916, "totalSubmissionRaw": 745854}, "533": {"acRate": 48.49108881234087, "difficulty": "Medium", "likes": 83, "dislikes": 753, "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": 12951, "totalSubmissionRaw": 26708}, "534": {"acRate": 81.10137083014651, "difficulty": "Medium", "likes": 377, "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": 68924, "totalSubmissionRaw": 84985}, "535": {"acRate": 86.14837129946245, "difficulty": "Medium", "likes": 1918, "dislikes": 3689, "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": 241354, "totalSubmissionRaw": 280160}, "536": {"acRate": 56.394754655376076, "difficulty": "Medium", "likes": 1013, "dislikes": 153, "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": "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": 84979, "totalSubmissionRaw": 150686}, "537": {"acRate": 71.545603066386, "difficulty": "Medium", "likes": 677, "dislikes": 1231, "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": 91089, "totalSubmissionRaw": 127316}, "538": {"acRate": 68.46714578301754, "difficulty": "Medium", "likes": 5031, "dislikes": 170, "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": 279804, "totalSubmissionRaw": 408669}, "539": {"acRate": 56.53095004443396, "difficulty": "Medium", "likes": 1729, "dislikes": 242, "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": 134222, "totalSubmissionRaw": 237431}, "540": {"acRate": 58.99414735220573, "difficulty": "Medium", "likes": 10362, "dislikes": 159, "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": 543810, "totalSubmissionRaw": 921803}, "541": {"acRate": 50.3974143180287, "difficulty": "Easy", "likes": 1805, "dislikes": 3525, "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": 217675, "totalSubmissionRaw": 431917}, "542": {"acRate": 47.73133320629405, "difficulty": "Medium", "likes": 8887, "dislikes": 391, "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": 493442, "totalSubmissionRaw": 1033795}, "543": {"acRate": 58.096715408705165, "difficulty": "Easy", "likes": 12600, "dislikes": 795, "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": 1189137, "totalSubmissionRaw": 2046826}, "544": {"acRate": 77.07745557139117, "difficulty": "Medium", "likes": 383, "dislikes": 129, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 26500, "totalSubmissionRaw": 34381}, "545": {"acRate": 44.766054190775215, "difficulty": "Medium", "likes": 1272, "dislikes": 2054, "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": 122475, "totalSubmissionRaw": 273589}, "546": {"acRate": 47.692839770622754, "difficulty": "Hard", "likes": 2153, "dislikes": 119, "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": 42749, "totalSubmissionRaw": 89634}, "547": {"acRate": 65.54022956804732, "difficulty": "Medium", "likes": 9060, "dislikes": 327, "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": 760438, "totalSubmissionRaw": 1160262}, "548": {"acRate": 50.11909825606124, "difficulty": "Hard", "likes": 410, "dislikes": 132, "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23566, "totalSubmissionRaw": 47020}, "549": {"acRate": 49.4366814724441, "difficulty": "Medium", "likes": 1130, "dislikes": 88, "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": 51866, "totalSubmissionRaw": 104914}, "550": {"acRate": 36.181464730619695, "difficulty": "Medium", "likes": 637, "dislikes": 134, "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": 91196, "totalSubmissionRaw": 252053}, "551": {"acRate": 48.45773872101972, "difficulty": "Easy", "likes": 660, "dislikes": 41, "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": 192667, "totalSubmissionRaw": 397598}, "552": {"acRate": 42.09046750040255, "difficulty": "Hard", "likes": 1680, "dislikes": 248, "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": 62735, "totalSubmissionRaw": 149048}, "553": {"acRate": 60.394204580251085, "difficulty": "Medium", "likes": 357, "dislikes": 1554, "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": 37474, "totalSubmissionRaw": 62049}, "554": {"acRate": 54.21310935300435, "difficulty": "Medium", "likes": 2396, "dislikes": 141, "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": 126702, "totalSubmissionRaw": 233711}, "555": {"acRate": 43.5494607908401, "difficulty": "Medium", "likes": 73, "dislikes": 255, "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": 6542, "totalSubmissionRaw": 15022}, "556": {"acRate": 33.920734354648644, "difficulty": "Medium", "likes": 3478, "dislikes": 436, "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": 136725, "totalSubmissionRaw": 403073}, "557": {"acRate": 82.87821646763891, "difficulty": "Easy", "likes": 5690, "dislikes": 241, "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": 834427, "totalSubmissionRaw": 1006811}, "558": {"acRate": 48.992999461497035, "difficulty": "Medium", "likes": 178, "dislikes": 464, "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": 13647, "totalSubmissionRaw": 27855}, "559": {"acRate": 71.84047338311717, "difficulty": "Easy", "likes": 2664, "dislikes": 83, "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": 263212, "totalSubmissionRaw": 366384}, "560": {"acRate": 43.24159718762021, "difficulty": "Medium", "likes": 20049, "dislikes": 591, "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": 1065700, "totalSubmissionRaw": 2464527}, "561": {"acRate": 77.92112359957287, "difficulty": "Easy", "likes": 1888, "dislikes": 235, "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": 430522, "totalSubmissionRaw": 552510}, "562": {"acRate": 50.31697980017377, "difficulty": "Medium", "likes": 869, "dislikes": 114, "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": 74131, "totalSubmissionRaw": 147328}, "563": {"acRate": 60.90855630696854, "difficulty": "Easy", "likes": 2150, "dislikes": 2138, "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": 198863, "totalSubmissionRaw": 326495}, "564": {"acRate": 21.795485450095185, "difficulty": "Hard", "likes": 681, "dislikes": 1374, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 40071, "totalSubmissionRaw": 183850}, "565": {"acRate": 56.33149954678848, "difficulty": "Medium", "likes": 2158, "dislikes": 151, "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": 125537, "totalSubmissionRaw": 222854}, "566": {"acRate": 62.999034971783416, "difficulty": "Easy", "likes": 3389, "dislikes": 392, "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": 360356, "totalSubmissionRaw": 572003}, "567": {"acRate": 44.1759538230698, "difficulty": "Medium", "likes": 10736, "dislikes": 354, "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": 738394, "totalSubmissionRaw": 1671481}, "568": {"acRate": 45.34452034452035, "difficulty": "Hard", "likes": 552, "dislikes": 106, "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": 36642, "totalSubmissionRaw": 80808}, "569": {"acRate": 66.4349840718216, "difficulty": "Hard", "likes": 311, "dislikes": 149, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36704, "totalSubmissionRaw": 55248}, "570": {"acRate": 55.248886877946745, "difficulty": "Medium", "likes": 745, "dislikes": 75, "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": 168497, "totalSubmissionRaw": 304973}, "571": {"acRate": 42.740129158832666, "difficulty": "Hard", "likes": 292, "dislikes": 76, "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": 26142, "totalSubmissionRaw": 61165}, "572": {"acRate": 47.069162880307545, "difficulty": "Easy", "likes": 7784, "dislikes": 452, "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": 735619, "totalSubmissionRaw": 1562847}, "573": {"acRate": 55.326305673183775, "difficulty": "Medium", "likes": 338, "dislikes": 36, "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": false, "totalAcceptedRaw": 18422, "totalSubmissionRaw": 33297}, "574": {"acRate": 60.079678857801554, "difficulty": "Medium", "likes": 164, "dislikes": 414, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59417, "totalSubmissionRaw": 98897}, "575": {"acRate": 66.96803307957833, "difficulty": "Easy", "likes": 1419, "dislikes": 1315, "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": 258806, "totalSubmissionRaw": 386462}, "576": {"acRate": 44.23615119873149, "difficulty": "Medium", "likes": 3105, "dislikes": 232, "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": 121077, "totalSubmissionRaw": 273706}, "577": {"acRate": 73.82300117668917, "difficulty": "Easy", "likes": 609, "dislikes": 165, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178803, "totalSubmissionRaw": 242205}, "578": {"acRate": 40.607275262207295, "difficulty": "Medium", "likes": 118, "dislikes": 900, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51259, "totalSubmissionRaw": 126234}, "579": {"acRate": 45.885596731335184, "difficulty": "Hard", "likes": 221, "dislikes": 399, "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": 32119, "totalSubmissionRaw": 69998}, "580": {"acRate": 58.67985259131409, "difficulty": "Medium", "likes": 237, "dislikes": 35, "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": 62896, "totalSubmissionRaw": 107185}, "581": {"acRate": 36.61140612233687, "difficulty": "Medium", "likes": 7574, "dislikes": 255, "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": 313216, "totalSubmissionRaw": 855520}, "582": {"acRate": 69.01535069120516, "difficulty": "Medium", "likes": 1085, "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": 81376, "totalSubmissionRaw": 117910}, "583": {"acRate": 60.94114293551189, "difficulty": "Medium", "likes": 5501, "dislikes": 80, "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": 226620, "totalSubmissionRaw": 371867}, "584": {"acRate": 68.92361607100344, "difficulty": "Easy", "likes": 1560, "dislikes": 319, "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": 506625, "totalSubmissionRaw": 735051}, "585": {"acRate": 47.588537685655616, "difficulty": "Medium", "likes": 417, "dislikes": 371, "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": 63503, "totalSubmissionRaw": 133444}, "586": {"acRate": 65.62318534551022, "difficulty": "Easy", "likes": 889, "dislikes": 65, "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": 211327, "totalSubmissionRaw": 322031}, "587": {"acRate": 51.9003636295301, "difficulty": "Hard", "likes": 1399, "dislikes": 637, "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": 55236, "totalSubmissionRaw": 106427}, "588": {"acRate": 48.407021758013144, "difficulty": "Hard", "likes": 1399, "dislikes": 146, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90281, "totalSubmissionRaw": 186500}, "589": {"acRate": 75.66490568273773, "difficulty": "Easy", "likes": 3040, "dislikes": 183, "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": 408620, "totalSubmissionRaw": 540039}, "590": {"acRate": 77.58606087455048, "difficulty": "Easy", "likes": 2254, "dislikes": 92, "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": 238183, "totalSubmissionRaw": 306992}, "591": {"acRate": 37.63511300360302, "difficulty": "Hard", "likes": 161, "dislikes": 637, "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": 13788, "totalSubmissionRaw": 36636}, "592": {"acRate": 52.77327430317391, "difficulty": "Medium", "likes": 373, "dislikes": 498, "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": 33853, "totalSubmissionRaw": 64148}, "593": {"acRate": 43.88306626245127, "difficulty": "Medium", "likes": 1000, "dislikes": 890, "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": 101326, "totalSubmissionRaw": 230900}, "594": {"acRate": 54.009714343942115, "difficulty": "Easy", "likes": 2036, "dislikes": 200, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143108, "totalSubmissionRaw": 264968}, "595": {"acRate": 68.60458927368025, "difficulty": "Easy", "likes": 2315, "dislikes": 1242, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 837820, "totalSubmissionRaw": 1221232}, "596": {"acRate": 51.182481605284025, "difficulty": "Easy", "likes": 882, "dislikes": 1056, "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": 305924, "totalSubmissionRaw": 597717}, "597": {"acRate": 42.14243567507644, "difficulty": "Easy", "likes": 290, "dislikes": 755, "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": 70707, "totalSubmissionRaw": 167781}, "598": {"acRate": 55.66946603970126, "difficulty": "Easy", "likes": 902, "dislikes": 940, "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": 94593, "totalSubmissionRaw": 169919}, "599": {"acRate": 54.31287575349247, "difficulty": "Easy", "likes": 1854, "dislikes": 384, "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": 205162, "totalSubmissionRaw": 377741}, "600": {"acRate": 39.620046419668185, "difficulty": "Hard", "likes": 1461, "dislikes": 126, "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": 36872, "totalSubmissionRaw": 93064}, "601": {"acRate": 48.5819832355962, "difficulty": "Hard", "likes": 604, "dislikes": 552, "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": 87981, "totalSubmissionRaw": 181098}, "602": {"acRate": 57.16099684648229, "difficulty": "Medium", "likes": 481, "dislikes": 93, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81930, "totalSubmissionRaw": 143332}, "603": {"acRate": 66.61627848058507, "difficulty": "Easy", "likes": 617, "dislikes": 67, "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": 78883, "totalSubmissionRaw": 118414}, "604": {"acRate": 39.61261112312251, "difficulty": "Easy", "likes": 427, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "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": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31146, "totalSubmissionRaw": 78628}, "605": {"acRate": 30.057014696704353, "difficulty": "Easy", "likes": 5921, "dislikes": 1026, "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": 575997, "totalSubmissionRaw": 1916348}, "606": {"acRate": 64.73435955373535, "difficulty": "Easy", "likes": 2692, "dislikes": 3209, "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": 229192, "totalSubmissionRaw": 354050}, "607": {"acRate": 66.36240741368337, "difficulty": "Easy", "likes": 1033, "dislikes": 85, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176233, "totalSubmissionRaw": 265562}, "608": {"acRate": 71.5314146235961, "difficulty": "Medium", "likes": 1156, "dislikes": 123, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138909, "totalSubmissionRaw": 194193}, "609": {"acRate": 67.61531858638622, "difficulty": "Medium", "likes": 1471, "dislikes": 1638, "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": 147302, "totalSubmissionRaw": 217853}, "610": {"acRate": 70.58585285838683, "difficulty": "Easy", "likes": 448, "dislikes": 113, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104569, "totalSubmissionRaw": 148144}, "611": {"acRate": 50.75711655572866, "difficulty": "Medium", "likes": 3625, "dislikes": 200, "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": 179198, "totalSubmissionRaw": 353050}, "612": {"acRate": 62.167121330215636, "difficulty": "Medium", "likes": 211, "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": 38285, "totalSubmissionRaw": 61584}, "613": {"acRate": 80.4865884070312, "difficulty": "Easy", "likes": 308, "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": 66164, "totalSubmissionRaw": 82205}, "614": {"acRate": 37.88790894418395, "difficulty": "Medium", "likes": 151, "dislikes": 740, "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": 49531, "totalSubmissionRaw": 130729}, "615": {"acRate": 55.97966929160187, "difficulty": "Hard", "likes": 225, "dislikes": 72, "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": 33482, "totalSubmissionRaw": 59811}, "616": {"acRate": 49.218920502188176, "difficulty": "Medium", "likes": 1026, "dislikes": 180, "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": 85699, "totalSubmissionRaw": 174118}, "617": {"acRate": 78.76694848886129, "difficulty": "Easy", "likes": 8484, "dislikes": 285, "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": 719132, "totalSubmissionRaw": 912987}, "618": {"acRate": 63.70610543380714, "difficulty": "Hard", "likes": 170, "dislikes": 168, "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": 22006, "totalSubmissionRaw": 34543}, "619": {"acRate": 56.517497988736935, "difficulty": "Easy", "likes": 437, "dislikes": 166, "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": 112401, "totalSubmissionRaw": 198879}, "620": {"acRate": 72.63766893653107, "difficulty": "Easy", "likes": 929, "dislikes": 530, "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": 313499, "totalSubmissionRaw": 431593}, "621": {"acRate": 57.455318267901625, "difficulty": "Medium", "likes": 9035, "dislikes": 1839, "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": 471757, "totalSubmissionRaw": 821085}, "622": {"acRate": 51.337943583768464, "difficulty": "Medium", "likes": 3359, "dislikes": 259, "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": 285516, "totalSubmissionRaw": 556151}, "623": {"acRate": 59.52117569689159, "difficulty": "Medium", "likes": 2907, "dislikes": 227, "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": 156576, "totalSubmissionRaw": 263060}, "624": {"acRate": 41.50960294556672, "difficulty": "Medium", "likes": 693, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": true, "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": 41713, "totalSubmissionRaw": 100490}, "625": {"acRate": 33.512637916806746, "difficulty": "Medium", "likes": 125, "dislikes": 110, "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": 10965, "totalSubmissionRaw": 32719}, "626": {"acRate": 68.50033642040123, "difficulty": "Medium", "likes": 1208, "dislikes": 556, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159838, "totalSubmissionRaw": 233339}, "627": {"acRate": 82.96732502767577, "difficulty": "Easy", "likes": 1652, "dislikes": 562, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 377727, "totalSubmissionRaw": 455272}, "628": {"acRate": 45.31172557920756, "difficulty": "Easy", "likes": 3997, "dislikes": 645, "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": 287064, "totalSubmissionRaw": 633534}, "629": {"acRate": 42.583329170740065, "difficulty": "Hard", "likes": 1968, "dislikes": 220, "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": 59675, "totalSubmissionRaw": 140137}, "630": {"acRate": 40.09645754922172, "difficulty": "Hard", "likes": 3652, "dislikes": 93, "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": 106001, "totalSubmissionRaw": 264365}, "631": {"acRate": 43.538926413082116, "difficulty": "Hard", "likes": 222, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14697, "totalSubmissionRaw": 33756}, "632": {"acRate": 61.946470735664626, "difficulty": "Hard", "likes": 3236, "dislikes": 56, "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": 93922, "totalSubmissionRaw": 151618}, "633": {"acRate": 34.07329601971584, "difficulty": "Medium", "likes": 2396, "dislikes": 532, "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": 183604, "totalSubmissionRaw": 538850}, "634": {"acRate": 42.040704715027935, "difficulty": "Medium", "likes": 214, "dislikes": 161, "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": 10762, "totalSubmissionRaw": 25599}, "635": {"acRate": 61.96764367920915, "difficulty": "Medium", "likes": 462, "dislikes": 203, "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": 33975, "totalSubmissionRaw": 54827}, "636": {"acRate": 61.438591160570724, "difficulty": "Medium", "likes": 1834, "dislikes": 2625, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 194114, "totalSubmissionRaw": 315948}, "637": {"acRate": 71.9669852475277, "difficulty": "Easy", "likes": 4990, "dislikes": 306, "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": 433876, "totalSubmissionRaw": 602882}, "638": {"acRate": 52.40820976356777, "difficulty": "Medium", "likes": 1416, "dislikes": 729, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 56125, "totalSubmissionRaw": 107092}, "639": {"acRate": 30.491276798888983, "difficulty": "Hard", "likes": 1483, "dislikes": 805, "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": 70258, "totalSubmissionRaw": 230420}, "640": {"acRate": 43.57795488756899, "difficulty": "Medium", "likes": 467, "dislikes": 819, "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": 37345, "totalSubmissionRaw": 85697}, "641": {"acRate": 56.808715155398914, "difficulty": "Medium", "likes": 1096, "dislikes": 72, "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": 62054, "totalSubmissionRaw": 109234}, "642": {"acRate": 48.66523170700511, "difficulty": "Hard", "likes": 2034, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"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": 133169, "totalSubmissionRaw": 273643}, "643": {"acRate": 43.08871529687901, "difficulty": "Easy", "likes": 3033, "dislikes": 253, "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": 305474, "totalSubmissionRaw": 708942}, "644": {"acRate": 36.34447118523908, "difficulty": "Hard", "likes": 600, "dislikes": 68, "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": 19481, "totalSubmissionRaw": 53601}, "645": {"acRate": 42.50283475930316, "difficulty": "Easy", "likes": 3903, "dislikes": 907, "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": 288624, "totalSubmissionRaw": 679070}, "646": {"acRate": 59.506019499669996, "difficulty": "Medium", "likes": 4375, "dislikes": 127, "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": 213676, "totalSubmissionRaw": 359083}, "647": {"acRate": 67.84426836029607, "difficulty": "Medium", "likes": 9697, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 628968, "totalSubmissionRaw": 927075}, "648": {"acRate": 62.70739473762039, "difficulty": "Medium", "likes": 2142, "dislikes": 170, "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": 127217, "totalSubmissionRaw": 202874}, "649": {"acRate": 47.37948449621221, "difficulty": "Medium", "likes": 2040, "dislikes": 1548, "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": 104133, "totalSubmissionRaw": 219785}, "650": {"acRate": 53.78629075648338, "difficulty": "Medium", "likes": 3348, "dislikes": 199, "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": 124959, "totalSubmissionRaw": 232325}, "651": {"acRate": 56.066987767275954, "difficulty": "Medium", "likes": 678, "dislikes": 89, "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": 27821, "totalSubmissionRaw": 49621}, "652": {"acRate": 59.18870559483286, "difficulty": "Medium", "likes": 5570, "dislikes": 437, "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": 244124, "totalSubmissionRaw": 412451}, "653": {"acRate": 61.10936901585114, "difficulty": "Easy", "likes": 6406, "dislikes": 253, "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": 493040, "totalSubmissionRaw": 806817}, "654": {"acRate": 85.07914667973473, "difficulty": "Medium", "likes": 5005, "dislikes": 326, "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": 270833, "totalSubmissionRaw": 318330}, "655": {"acRate": 62.61156130738333, "difficulty": "Medium", "likes": 424, "dislikes": 414, "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": 62507, "totalSubmissionRaw": 99833}, "656": {"acRate": 31.96435219657483, "difficulty": "Hard", "likes": 240, "dislikes": 107, "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": 13737, "totalSubmissionRaw": 42976}, "657": {"acRate": 75.4504733495113, "difficulty": "Easy", "likes": 2305, "dislikes": 738, "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": 393311, "totalSubmissionRaw": 521284}, "658": {"acRate": 46.94880550143904, "difficulty": "Medium", "likes": 7641, "dislikes": 602, "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": 472568, "totalSubmissionRaw": 1006566}, "659": {"acRate": 50.89662957587486, "difficulty": "Medium", "likes": 4311, "dislikes": 789, "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": 126244, "totalSubmissionRaw": 248040}, "660": {"acRate": 57.32859874351271, "difficulty": "Hard", "likes": 160, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10494, "totalSubmissionRaw": 18305}, "661": {"acRate": 55.88445209662347, "difficulty": "Easy", "likes": 490, "dislikes": 1887, "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": 75952, "totalSubmissionRaw": 135909}, "662": {"acRate": 42.6603911591668, "difficulty": "Medium", "likes": 8230, "dislikes": 1127, "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": 335364, "totalSubmissionRaw": 786125}, "663": {"acRate": 41.43326595993345, "difficulty": "Medium", "likes": 476, "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": 30134, "totalSubmissionRaw": 72729}, "664": {"acRate": 55.05913477719769, "difficulty": "Hard", "likes": 2131, "dislikes": 205, "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": 70343, "totalSubmissionRaw": 127759}, "665": {"acRate": 24.46581759625238, "difficulty": "Medium", "likes": 5578, "dislikes": 763, "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": 250689, "totalSubmissionRaw": 1024650}, "666": {"acRate": 60.1782363977486, "difficulty": "Medium", "likes": 352, "dislikes": 447, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 24376, "totalSubmissionRaw": 40507}, "667": {"acRate": 59.99676648227917, "difficulty": "Medium", "likes": 769, "dislikes": 1040, "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": 51953, "totalSubmissionRaw": 86593}, "668": {"acRate": 51.53192740861201, "difficulty": "Hard", "likes": 2055, "dislikes": 55, "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": 59574, "totalSubmissionRaw": 115606}, "669": {"acRate": 66.29727920432266, "difficulty": "Medium", "likes": 5626, "dislikes": 251, "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": 277294, "totalSubmissionRaw": 418259}, "670": {"acRate": 47.97866671587839, "difficulty": "Medium", "likes": 3179, "dislikes": 178, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 207984, "totalSubmissionRaw": 433497}, "671": {"acRate": 44.260664189065146, "difficulty": "Easy", "likes": 1736, "dislikes": 1828, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 178405, "totalSubmissionRaw": 403078}, "672": {"acRate": 50.3571172634546, "difficulty": "Medium", "likes": 134, "dislikes": 199, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21081, "totalSubmissionRaw": 41863}, "673": {"acRate": 47.582756228749474, "difficulty": "Medium", "likes": 6461, "dislikes": 257, "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": 209217, "totalSubmissionRaw": 439693}, "674": {"acRate": 49.60884374704681, "difficulty": "Easy", "likes": 2270, "dislikes": 173, "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": 241477, "totalSubmissionRaw": 486762}, "675": {"acRate": 34.11979273737422, "difficulty": "Hard", "likes": 1166, "dislikes": 658, "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": 64729, "totalSubmissionRaw": 189711}, "676": {"acRate": 56.96481495554373, "difficulty": "Medium", "likes": 1337, "dislikes": 197, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 74959, "totalSubmissionRaw": 131588}, "677": {"acRate": 56.6699184616749, "difficulty": "Medium", "likes": 1583, "dislikes": 145, "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": 108630, "totalSubmissionRaw": 191689}, "678": {"acRate": 34.475635808213454, "difficulty": "Medium", "likes": 4911, "dislikes": 124, "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": 229324, "totalSubmissionRaw": 665177}, "679": {"acRate": 49.24093910786092, "difficulty": "Hard", "likes": 1414, "dislikes": 238, "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": 73596, "totalSubmissionRaw": 149461}, "680": {"acRate": 39.68867630931563, "difficulty": "Easy", "likes": 7754, "dislikes": 393, "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": 642742, "totalSubmissionRaw": 1619462}, "681": {"acRate": 46.423175605002726, "difficulty": "Medium", "likes": 709, "dislikes": 1043, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103857, "totalSubmissionRaw": 223718}, "682": {"acRate": 75.1730920943365, "difficulty": "Easy", "likes": 2588, "dislikes": 1845, "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": 289675, "totalSubmissionRaw": 385344}, "683": {"acRate": 36.99525417034381, "difficulty": "Hard", "likes": 788, "dislikes": 685, "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": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59946, "totalSubmissionRaw": 162037}, "684": {"acRate": 62.499949538377074, "difficulty": "Medium", "likes": 5791, "dislikes": 367, "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": 309636, "totalSubmissionRaw": 495417}, "685": {"acRate": 34.14485696895922, "difficulty": "Hard", "likes": 2222, "dislikes": 304, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 65076, "totalSubmissionRaw": 190588}, "686": {"acRate": 34.480944454775106, "difficulty": "Medium", "likes": 2358, "dislikes": 968, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 152052, "totalSubmissionRaw": 440974}, "687": {"acRate": 40.824672986919474, "difficulty": "Medium", "likes": 4070, "dislikes": 659, "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": 170096, "totalSubmissionRaw": 416647}, "688": {"acRate": 56.20541255350494, "difficulty": "Medium", "likes": 3693, "dislikes": 443, "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": 145359, "totalSubmissionRaw": 258621}, "689": {"acRate": 49.14867536295551, "difficulty": "Hard", "likes": 1893, "dislikes": 106, "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": 69365, "totalSubmissionRaw": 141133}, "690": {"acRate": 66.13931476199761, "difficulty": "Medium", "likes": 1990, "dislikes": 1323, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200124, "totalSubmissionRaw": 302580}, "691": {"acRate": 46.6837926202709, "difficulty": "Hard", "likes": 1073, "dislikes": 81, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43981, "totalSubmissionRaw": 94207}, "692": {"acRate": 57.52582932033161, "difficulty": "Medium", "likes": 7374, "dislikes": 337, "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": 574828, "totalSubmissionRaw": 999252}, "693": {"acRate": 61.87629282074567, "difficulty": "Easy", "likes": 1290, "dislikes": 110, "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": 122645, "totalSubmissionRaw": 198210}, "694": {"acRate": 60.953182543822216, "difficulty": "Medium", "likes": 2150, "dislikes": 133, "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": 154251, "totalSubmissionRaw": 253064}, "695": {"acRate": 71.85273625514695, "difficulty": "Medium", "likes": 9550, "dislikes": 198, "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": 768503, "totalSubmissionRaw": 1069555}, "696": {"acRate": 65.45718821378095, "difficulty": "Easy", "likes": 3841, "dislikes": 822, "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": 195446, "totalSubmissionRaw": 298586}, "697": {"acRate": 56.11702896247189, "difficulty": "Easy", "likes": 2876, "dislikes": 1651, "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": 194184, "totalSubmissionRaw": 346034}, "698": {"acRate": 38.879380305905684, "difficulty": "Medium", "likes": 6864, "dislikes": 472, "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": 250556, "totalSubmissionRaw": 644446}, "699": {"acRate": 44.78606947050145, "difficulty": "Hard", "likes": 602, "dislikes": 73, "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": 24588, "totalSubmissionRaw": 54901}, "700": {"acRate": 78.73301272206697, "difficulty": "Easy", "likes": 5540, "dislikes": 177, "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": 733113, "totalSubmissionRaw": 931138}, "701": {"acRate": 73.89662344944036, "difficulty": "Medium", "likes": 5450, "dislikes": 163, "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": 458649, "totalSubmissionRaw": 620663}, "702": {"acRate": 71.67854116317756, "difficulty": "Medium", "likes": 881, "dislikes": 45, "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": 91350, "totalSubmissionRaw": 127444}, "703": {"acRate": 56.60356200849305, "difficulty": "Easy", "likes": 5101, "dislikes": 3152, "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": 464386, "totalSubmissionRaw": 820412}, "704": {"acRate": 56.7081833246821, "difficulty": "Easy", "likes": 10947, "dislikes": 218, "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": 2042919, "totalSubmissionRaw": 3602511}, "705": {"acRate": 67.16494659353349, "difficulty": "Easy", "likes": 3617, "dislikes": 290, "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": 372255, "totalSubmissionRaw": 554240}, "706": {"acRate": 65.95667129022024, "difficulty": "Easy", "likes": 4929, "dislikes": 433, "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": 530196, "totalSubmissionRaw": 803855}, "707": {"acRate": 27.9724930436488, "difficulty": "Medium", "likes": 2442, "dislikes": 1532, "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": 288115, "totalSubmissionRaw": 1029994}, "708": {"acRate": 34.86303860372099, "difficulty": "Medium", "likes": 1105, "dislikes": 718, "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": 138060, "totalSubmissionRaw": 396008}, "709": {"acRate": 82.7985968899285, "difficulty": "Easy", "likes": 1726, "dislikes": 2736, "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": 460511, "totalSubmissionRaw": 556183}, "710": {"acRate": 33.43618198160824, "difficulty": "Hard", "likes": 818, "dislikes": 113, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 38687, "totalSubmissionRaw": 115704}, "711": {"acRate": 52.38683127572017, "difficulty": "Hard", "likes": 254, "dislikes": 258, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 10184, "totalSubmissionRaw": 19440}, "712": {"acRate": 64.88990990205059, "difficulty": "Medium", "likes": 3854, "dislikes": 101, "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": 133886, "totalSubmissionRaw": 206329}, "713": {"acRate": 46.53087644943217, "difficulty": "Medium", "likes": 5815, "dislikes": 178, "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": 249439, "totalSubmissionRaw": 536072}, "714": {"acRate": 68.06832520143145, "difficulty": "Medium", "likes": 6790, "dislikes": 188, "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": 316127, "totalSubmissionRaw": 464426}, "715": {"acRate": 44.42568043007121, "difficulty": "Hard", "likes": 1365, "dislikes": 106, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 63136, "totalSubmissionRaw": 142116}, "716": {"acRate": 45.09542289585702, "difficulty": "Hard", "likes": 1857, "dislikes": 502, "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": 143973, "totalSubmissionRaw": 319263}, "717": {"acRate": 45.25856892806067, "difficulty": "Easy", "likes": 836, "dislikes": 2037, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 124371, "totalSubmissionRaw": 274801}, "718": {"acRate": 51.03388893652186, "difficulty": "Medium", "likes": 6533, "dislikes": 160, "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": 279754, "totalSubmissionRaw": 548173}, "719": {"acRate": 37.188361212587324, "difficulty": "Hard", "likes": 2821, "dislikes": 86, "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": 81235, "totalSubmissionRaw": 218442}, "720": {"acRate": 52.136783489725104, "difficulty": "Medium", "likes": 1852, "dislikes": 1459, "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": 142128, "totalSubmissionRaw": 272606}, "721": {"acRate": 56.621305446523984, "difficulty": "Medium", "likes": 6236, "dislikes": 1053, "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": 338562, "totalSubmissionRaw": 597941}, "722": {"acRate": 38.41945254144653, "difficulty": "Medium", "likes": 675, "dislikes": 1749, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 67483, "totalSubmissionRaw": 175648}, "723": {"acRate": 76.96812842337769, "difficulty": "Medium", "likes": 987, "dislikes": 510, "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": 68995, "totalSubmissionRaw": 89641}, "724": {"acRate": 56.16236867239732, "difficulty": "Easy", "likes": 7786, "dislikes": 787, "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": 940830, "totalSubmissionRaw": 1675195}, "725": {"acRate": 63.77046249888277, "difficulty": "Medium", "likes": 3753, "dislikes": 298, "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": 185507, "totalSubmissionRaw": 290898}, "726": {"acRate": 52.50548338113716, "difficulty": "Hard", "likes": 1211, "dislikes": 281, "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": 56016, "totalSubmissionRaw": 106686}, "727": {"acRate": 43.21082501053258, "difficulty": "Hard", "likes": 1430, "dislikes": 87, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 87180, "totalSubmissionRaw": 201755}, "728": {"acRate": 78.10765530749805, "difficulty": "Easy", "likes": 1675, "dislikes": 365, "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": 220519, "totalSubmissionRaw": 282327}, "729": {"acRate": 56.64940137556253, "difficulty": "Medium", "likes": 4072, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"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": 266864, "totalSubmissionRaw": 471077}, "730": {"acRate": 44.81001526085719, "difficulty": "Hard", "likes": 1851, "dislikes": 94, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 34648, "totalSubmissionRaw": 77322}, "731": {"acRate": 55.223033204759766, "difficulty": "Medium", "likes": 1668, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"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": 94348, "totalSubmissionRaw": 170849}, "732": {"acRate": 71.56176577649823, "difficulty": "Hard", "likes": 1901, "dislikes": 261, "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": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86501, "totalSubmissionRaw": 120876}, "733": {"acRate": 63.1145927336354, "difficulty": "Easy", "likes": 7895, "dislikes": 778, "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": 801496, "totalSubmissionRaw": 1269906}, "734": {"acRate": 44.07924515163121, "difficulty": "Easy", "likes": 28, "dislikes": 38, "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": 63298, "totalSubmissionRaw": 143603}, "735": {"acRate": 45.14537589723791, "difficulty": "Medium", "likes": 7199, "dislikes": 799, "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": 401073, "totalSubmissionRaw": 888408}, "736": {"acRate": 51.51038852595904, "difficulty": "Hard", "likes": 457, "dislikes": 345, "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": 20974, "totalSubmissionRaw": 40718}, "737": {"acRate": 49.35880948006614, "difficulty": "Medium", "likes": 815, "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": 67165, "totalSubmissionRaw": 136075}, "738": {"acRate": 47.534281410770525, "difficulty": "Medium", "likes": 1260, "dislikes": 101, "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": 48600, "totalSubmissionRaw": 102242}, "739": {"acRate": 65.88918787593224, "difficulty": "Medium", "likes": 11767, "dislikes": 256, "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": 715959, "totalSubmissionRaw": 1086616}, "740": {"acRate": 56.63091560011073, "difficulty": "Medium", "likes": 7169, "dislikes": 356, "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": 304817, "totalSubmissionRaw": 538253}, "741": {"acRate": 36.531746597306345, "difficulty": "Hard", "likes": 4023, "dislikes": 144, "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": 71771, "totalSubmissionRaw": 196461}, "742": {"acRate": 46.03171295813973, "difficulty": "Medium", "likes": 846, "dislikes": 172, "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": 44183, "totalSubmissionRaw": 95983}, "743": {"acRate": 52.82233544200692, "difficulty": "Medium", "likes": 6990, "dislikes": 346, "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": 424765, "totalSubmissionRaw": 804139}, "744": {"acRate": 51.23449790088308, "difficulty": "Easy", "likes": 4147, "dislikes": 2171, "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": 424693, "totalSubmissionRaw": 828920}, "745": {"acRate": 41.03780294813208, "difficulty": "Hard", "likes": 2221, "dislikes": 476, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "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": 92317, "totalSubmissionRaw": 224956}, "746": {"acRate": 65.01597145082995, "difficulty": "Easy", "likes": 10785, "dislikes": 1629, "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": 1007299, "totalSubmissionRaw": 1549308}, "747": {"acRate": 47.9448727540852, "difficulty": "Easy", "likes": 1123, "dislikes": 870, "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": 221081, "totalSubmissionRaw": 461115}, "748": {"acRate": 59.28943360136021, "difficulty": "Easy", "likes": 500, "dislikes": 1061, "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": 66951, "totalSubmissionRaw": 112923}, "749": {"acRate": 51.12850798882938, "difficulty": "Hard", "likes": 362, "dislikes": 448, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 11168, "totalSubmissionRaw": 21843}, "750": {"acRate": 67.64921700223714, "difficulty": "Medium", "likes": 611, "dislikes": 91, "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": 37799, "totalSubmissionRaw": 55875}, "751": {"acRate": 54.47488107062575, "difficulty": "Medium", "likes": 70, "dislikes": 272, "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": 20841, "totalSubmissionRaw": 38258}, "752": {"acRate": 55.87102870582339, "difficulty": "Medium", "likes": 3802, "dislikes": 141, "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": 214038, "totalSubmissionRaw": 383093}, "753": {"acRate": 56.27466937945066, "difficulty": "Hard", "likes": 497, "dislikes": 79, "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": 55318, "totalSubmissionRaw": 98300}, "754": {"acRate": 42.846419974634834, "difficulty": "Medium", "likes": 1706, "dislikes": 767, "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": 49662, "totalSubmissionRaw": 115907}, "755": {"acRate": 46.563709562583334, "difficulty": "Medium", "likes": 289, "dislikes": 744, "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": 35970, "totalSubmissionRaw": 77249}, "756": {"acRate": 52.49305625271894, "difficulty": "Medium", "likes": 512, "dislikes": 470, "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": 31373, "totalSubmissionRaw": 59766}, "757": {"acRate": 43.967539071418194, "difficulty": "Hard", "likes": 679, "dislikes": 78, "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": 21184, "totalSubmissionRaw": 48181}, "758": {"acRate": 51.08628702614928, "difficulty": "Medium", "likes": 260, "dislikes": 123, "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": 18247, "totalSubmissionRaw": 35718}, "759": {"acRate": 71.94165783953311, "difficulty": "Hard", "likes": 1820, "dislikes": 123, "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": 138551, "totalSubmissionRaw": 192588}, "760": {"acRate": 83.44581798147446, "difficulty": "Easy", "likes": 594, "dislikes": 226, "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": 96934, "totalSubmissionRaw": 116164}, "761": {"acRate": 60.74099511599511, "difficulty": "Hard", "likes": 676, "dislikes": 204, "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": 15919, "totalSubmissionRaw": 26208}, "762": {"acRate": 68.68365427051636, "difficulty": "Easy", "likes": 671, "dislikes": 502, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 88707, "totalSubmissionRaw": 129153}, "763": {"acRate": 79.77217047298302, "difficulty": "Medium", "likes": 9931, "dislikes": 365, "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": 493627, "totalSubmissionRaw": 618796}, "764": {"acRate": 48.20554720162713, "difficulty": "Medium", "likes": 1407, "dislikes": 220, "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": 55460, "totalSubmissionRaw": 115049}, "765": {"acRate": 56.74777196208799, "difficulty": "Hard", "likes": 2230, "dislikes": 110, "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": 56161, "totalSubmissionRaw": 98966}, "766": {"acRate": 68.48064862130502, "difficulty": "Easy", "likes": 3406, "dislikes": 158, "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": 292409, "totalSubmissionRaw": 426995}, "767": {"acRate": 54.331399377606424, "difficulty": "Medium", "likes": 8043, "dislikes": 236, "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": 344986, "totalSubmissionRaw": 634967}, "768": {"acRate": 52.869718633414806, "difficulty": "Hard", "likes": 1765, "dislikes": 50, "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": 57536, "totalSubmissionRaw": 108826}, "769": {"acRate": 58.21707900076466, "difficulty": "Medium", "likes": 2699, "dislikes": 226, "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": 96691, "totalSubmissionRaw": 166087}, "770": {"acRate": 54.969102556834294, "difficulty": "Hard", "likes": 154, "dislikes": 1375, "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": 9696, "totalSubmissionRaw": 17639}, "771": {"acRate": 88.3232731286845, "difficulty": "Easy", "likes": 4849, "dislikes": 564, "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": 940133, "totalSubmissionRaw": 1064422}, "772": {"acRate": 49.47924293860525, "difficulty": "Hard", "likes": 1080, "dislikes": 276, "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": 111498, "totalSubmissionRaw": 225337}, "773": {"acRate": 64.42320225939605, "difficulty": "Hard", "likes": 1951, "dislikes": 49, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 88962, "totalSubmissionRaw": 138090}, "774": {"acRate": 51.92974925778875, "difficulty": "Hard", "likes": 657, "dislikes": 92, "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": 29036, "totalSubmissionRaw": 55914}, "775": {"acRate": 42.687253009833654, "difficulty": "Medium", "likes": 1739, "dislikes": 363, "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": 69672, "totalSubmissionRaw": 163215}, "776": {"acRate": 83.06461292258452, "difficulty": "Medium", "likes": 987, "dislikes": 100, "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": 103810, "totalSubmissionRaw": 124975}, "777": {"acRate": 36.781807044100304, "difficulty": "Medium", "likes": 1169, "dislikes": 909, "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": 72654, "totalSubmissionRaw": 197527}, "778": {"acRate": 60.22510737906253, "difficulty": "Hard", "likes": 3388, "dislikes": 217, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 135589, "totalSubmissionRaw": 225137}, "779": {"acRate": 41.939852874619184, "difficulty": "Medium", "likes": 2762, "dislikes": 306, "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": 124173, "totalSubmissionRaw": 296074}, "780": {"acRate": 32.815093166667594, "difficulty": "Hard", "likes": 1382, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59120, "totalSubmissionRaw": 180161}, "781": {"acRate": 54.02635896893029, "difficulty": "Medium", "likes": 1203, "dislikes": 574, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 51036, "totalSubmissionRaw": 94465}, "782": {"acRate": 51.36548700281867, "difficulty": "Hard", "likes": 344, "dislikes": 304, "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": 16401, "totalSubmissionRaw": 31930}, "783": {"acRate": 59.454018920136434, "difficulty": "Easy", "likes": 3358, "dislikes": 405, "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": 230964, "totalSubmissionRaw": 388475}, "784": {"acRate": 73.98848284765099, "difficulty": "Medium", "likes": 4503, "dislikes": 153, "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": 284849, "totalSubmissionRaw": 384991}, "785": {"acRate": 55.0506737328249, "difficulty": "Medium", "likes": 7789, "dislikes": 349, "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": 497776, "totalSubmissionRaw": 904215}, "786": {"acRate": 52.914590650439706, "difficulty": "Medium", "likes": 1217, "dislikes": 50, "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": "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": 38869, "totalSubmissionRaw": 73449}, "787": {"acRate": 37.31481714033533, "difficulty": "Medium", "likes": 8789, "dislikes": 360, "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": 415974, "totalSubmissionRaw": 1114801}, "788": {"acRate": 56.47624814964338, "difficulty": "Medium", "likes": 719, "dislikes": 1889, "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": 100722, "totalSubmissionRaw": 178344}, "789": {"acRate": 61.33315020830472, "difficulty": "Medium", "likes": 264, "dislikes": 25, "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": 26794, "totalSubmissionRaw": 43686}, "790": {"acRate": 51.61341532312663, "difficulty": "Medium", "likes": 3178, "dislikes": 990, "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": 110540, "totalSubmissionRaw": 214169}, "791": {"acRate": 69.0204208438385, "difficulty": "Medium", "likes": 2716, "dislikes": 329, "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": 231044, "totalSubmissionRaw": 334746}, "792": {"acRate": 51.28170297280143, "difficulty": "Medium", "likes": 5322, "dislikes": 225, "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": 218958, "totalSubmissionRaw": 426971}, "793": {"acRate": 43.65263679774548, "difficulty": "Hard", "likes": 418, "dislikes": 91, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 16729, "totalSubmissionRaw": 38323}, "794": {"acRate": 34.92305185853573, "difficulty": "Medium", "likes": 525, "dislikes": 1125, "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": 55733, "totalSubmissionRaw": 159588}, "795": {"acRate": 52.86309704150733, "difficulty": "Medium", "likes": 2195, "dislikes": 113, "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": 64558, "totalSubmissionRaw": 122123}, "796": {"acRate": 56.56836461126006, "difficulty": "Easy", "likes": 3272, "dislikes": 125, "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": 249401, "totalSubmissionRaw": 440885}, "797": {"acRate": 82.4211764664752, "difficulty": "Medium", "likes": 6893, "dislikes": 139, "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": 471506, "totalSubmissionRaw": 572069}, "798": {"acRate": 50.545816733067724, "difficulty": "Hard", "likes": 515, "dislikes": 35, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 12687, "totalSubmissionRaw": 25100}, "799": {"acRate": 57.868643334580824, "difficulty": "Medium", "likes": 3524, "dislikes": 190, "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": 143802, "totalSubmissionRaw": 248497}, "800": {"acRate": 67.07889981931339, "difficulty": "Easy", "likes": 105, "dislikes": 675, "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": 16706, "totalSubmissionRaw": 24905}, "801": {"acRate": 39.56228006857349, "difficulty": "Hard", "likes": 2702, "dislikes": 134, "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": 70155, "totalSubmissionRaw": 177328}, "802": {"acRate": 61.70451326598055, "difficulty": "Medium", "likes": 5303, "dislikes": 430, "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": 209124, "totalSubmissionRaw": 338912}, "803": {"acRate": 34.51099588771679, "difficulty": "Hard", "likes": 1057, "dislikes": 187, "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": 28953, "totalSubmissionRaw": 83895}, "804": {"acRate": 82.66450523539285, "difficulty": "Easy", "likes": 2424, "dislikes": 1508, "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": 330948, "totalSubmissionRaw": 400350}, "805": {"acRate": 25.35069675363843, "difficulty": "Hard", "likes": 1207, "dislikes": 132, "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": 32782, "totalSubmissionRaw": 129314}, "806": {"acRate": 67.32202164003692, "difficulty": "Easy", "likes": 554, "dislikes": 1285, "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": 70744, "totalSubmissionRaw": 105083}, "807": {"acRate": 85.99465112253843, "difficulty": "Medium", "likes": 2444, "dislikes": 501, "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": 154019, "totalSubmissionRaw": 179103}, "808": {"acRate": 54.865246704937675, "difficulty": "Medium", "likes": 919, "dislikes": 2479, "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": 61358, "totalSubmissionRaw": 111834}, "809": {"acRate": 46.14193056717556, "difficulty": "Medium", "likes": 827, "dislikes": 1863, "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": 111406, "totalSubmissionRaw": 241442}, "810": {"acRate": 57.55355823688747, "difficulty": "Hard", "likes": 205, "dislikes": 275, "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": 9349, "totalSubmissionRaw": 16244}, "811": {"acRate": 75.79310537295314, "difficulty": "Medium", "likes": 1475, "dislikes": 1285, "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": 217266, "totalSubmissionRaw": 286657}, "812": {"acRate": 60.11426744975829, "difficulty": "Easy", "likes": 507, "dislikes": 1561, "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": 45138, "totalSubmissionRaw": 75087}, "813": {"acRate": 53.13852813852814, "difficulty": "Medium", "likes": 2007, "dislikes": 94, "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": 49591, "totalSubmissionRaw": 93324}, "814": {"acRate": 72.29192612006419, "difficulty": "Medium", "likes": 4380, "dislikes": 109, "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": 233354, "totalSubmissionRaw": 322794}, "815": {"acRate": 45.527689209320535, "difficulty": "Hard", "likes": 3293, "dislikes": 80, "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": 137220, "totalSubmissionRaw": 301399}, "816": {"acRate": 56.37841365263304, "difficulty": "Medium", "likes": 302, "dislikes": 648, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28510, "totalSubmissionRaw": 50569}, "817": {"acRate": 57.19348122046929, "difficulty": "Medium", "likes": 986, "dislikes": 2146, "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": 85701, "totalSubmissionRaw": 149844}, "818": {"acRate": 43.47360014578744, "difficulty": "Hard", "likes": 1815, "dislikes": 170, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81110, "totalSubmissionRaw": 186572}, "819": {"acRate": 44.46845009040753, "difficulty": "Easy", "likes": 1618, "dislikes": 2982, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "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": 335699, "totalSubmissionRaw": 754915}, "820": {"acRate": 60.51224973145069, "difficulty": "Medium", "likes": 1709, "dislikes": 638, "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": 93512, "totalSubmissionRaw": 154534}, "821": {"acRate": 71.28632142826967, "difficulty": "Easy", "likes": 3009, "dislikes": 153, "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": 168739, "totalSubmissionRaw": 236706}, "822": {"acRate": 46.57488058443383, "difficulty": "Medium", "likes": 155, "dislikes": 723, "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": 16576, "totalSubmissionRaw": 35590}, "823": {"acRate": 49.58863530709104, "difficulty": "Medium", "likes": 2560, "dislikes": 184, "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": 91736, "totalSubmissionRaw": 184994}, "824": {"acRate": 67.91637192486048, "difficulty": "Easy", "likes": 857, "dislikes": 1213, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 164179, "totalSubmissionRaw": 241737}, "825": {"acRate": 46.37467356368019, "difficulty": "Medium", "likes": 665, "dislikes": 1153, "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": 73873, "totalSubmissionRaw": 159296}, "826": {"acRate": 45.42219953610221, "difficulty": "Medium", "likes": 1486, "dislikes": 129, "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": 60511, "totalSubmissionRaw": 133219}, "827": {"acRate": 45.77659132551692, "difficulty": "Hard", "likes": 3575, "dislikes": 62, "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": 142153, "totalSubmissionRaw": 310538}, "828": {"acRate": 51.91924671600729, "difficulty": "Hard", "likes": 2055, "dislikes": 241, "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": 66994, "totalSubmissionRaw": 129035}, "829": {"acRate": 41.668570036392424, "difficulty": "Hard", "likes": 1328, "dislikes": 1366, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 82095, "totalSubmissionRaw": 197019}, "830": {"acRate": 51.98166780555621, "difficulty": "Easy", "likes": 829, "dislikes": 122, "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": 88242, "totalSubmissionRaw": 169756}, "831": {"acRate": 48.034155700272926, "difficulty": "Medium", "likes": 156, "dislikes": 434, "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": 17776, "totalSubmissionRaw": 37007}, "832": {"acRate": 81.28180531957358, "difficulty": "Easy", "likes": 3268, "dislikes": 232, "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": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 388931, "totalSubmissionRaw": 478497}, "833": {"acRate": 53.604920649538016, "difficulty": "Medium", "likes": 1124, "dislikes": 959, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 139703, "totalSubmissionRaw": 260616}, "834": {"acRate": 59.27112889288072, "difficulty": "Hard", "likes": 4823, "dislikes": 108, "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": 87109, "totalSubmissionRaw": 146967}, "835": {"acRate": 63.737017921046544, "difficulty": "Medium", "likes": 1289, "dislikes": 466, "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": 91012, "totalSubmissionRaw": 142793}, "836": {"acRate": 44.26786036171364, "difficulty": "Easy", "likes": 1903, "dislikes": 449, "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": 132610, "totalSubmissionRaw": 299567}, "837": {"acRate": 45.19407355933886, "difficulty": "Medium", "likes": 1924, "dislikes": 1776, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 72841, "totalSubmissionRaw": 161174}, "838": {"acRate": 57.06077358745868, "difficulty": "Medium", "likes": 3299, "dislikes": 209, "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": 118077, "totalSubmissionRaw": 206932}, "839": {"acRate": 54.55140263351599, "difficulty": "Hard", "likes": 2258, "dislikes": 214, "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": 113390, "totalSubmissionRaw": 207859}, "840": {"acRate": 38.77686402931483, "difficulty": "Medium", "likes": 316, "dislikes": 1573, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36826, "totalSubmissionRaw": 94969}, "841": {"acRate": 72.23095942364728, "difficulty": "Medium", "likes": 5740, "dislikes": 253, "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": 366047, "totalSubmissionRaw": 506772}, "842": {"acRate": 38.72447857195236, "difficulty": "Medium", "likes": 1094, "dislikes": 295, "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": 36966, "totalSubmissionRaw": 95459}, "843": {"acRate": 40.19175990367956, "difficulty": "Hard", "likes": 1465, "dislikes": 1735, "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": 136865, "totalSubmissionRaw": 340530}, "844": {"acRate": 48.096715712182956, "difficulty": "Easy", "likes": 6712, "dislikes": 309, "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": 677043, "totalSubmissionRaw": 1407671}, "845": {"acRate": 40.21545511408447, "difficulty": "Medium", "likes": 2658, "dislikes": 73, "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": 118301, "totalSubmissionRaw": 294168}, "846": {"acRate": 55.98755270026099, "difficulty": "Medium", "likes": 2363, "dislikes": 160, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 139437, "totalSubmissionRaw": 249050}, "847": {"acRate": 65.96307890617807, "difficulty": "Hard", "likes": 4115, "dislikes": 159, "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": 114628, "totalSubmissionRaw": 173776}, "848": {"acRate": 44.874816560679506, "difficulty": "Medium", "likes": 1306, "dislikes": 120, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90819, "totalSubmissionRaw": 202383}, "849": {"acRate": 47.80892553449264, "difficulty": "Medium", "likes": 3111, "dislikes": 193, "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": 211118, "totalSubmissionRaw": 441587}, "850": {"acRate": 54.044147200205785, "difficulty": "Hard", "likes": 925, "dislikes": 60, "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": 33616, "totalSubmissionRaw": 62201}, "851": {"acRate": 58.84372259020657, "difficulty": "Medium", "likes": 1173, "dislikes": 751, "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": 38911, "totalSubmissionRaw": 66126}, "852": {"acRate": 68.81000429824003, "difficulty": "Medium", "likes": 6920, "dislikes": 1890, "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": 713994, "totalSubmissionRaw": 1037631}, "853": {"acRate": 50.33184283749986, "difficulty": "Medium", "likes": 3071, "dislikes": 743, "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": 185950, "totalSubmissionRaw": 369449}, "854": {"acRate": 39.86111754085459, "difficulty": "Hard", "likes": 1089, "dislikes": 58, "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": 43052, "totalSubmissionRaw": 108005}, "855": {"acRate": 43.30647178779632, "difficulty": "Medium", "likes": 1253, "dislikes": 455, "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": 57126, "totalSubmissionRaw": 131911}, "856": {"acRate": 64.3194561282636, "difficulty": "Medium", "likes": 5256, "dislikes": 179, "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": 168968, "totalSubmissionRaw": 262703}, "857": {"acRate": 52.68973686437093, "difficulty": "Hard", "likes": 2138, "dislikes": 273, "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": 62274, "totalSubmissionRaw": 118190}, "858": {"acRate": 62.74240031261703, "difficulty": "Medium", "likes": 1084, "dislikes": 2528, "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": 77069, "totalSubmissionRaw": 122834}, "859": {"acRate": 32.86810302304277, "difficulty": "Easy", "likes": 3045, "dislikes": 1737, "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": 223887, "totalSubmissionRaw": 681167}, "860": {"acRate": 53.02317023211893, "difficulty": "Easy", "likes": 2149, "dislikes": 147, "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": 152729, "totalSubmissionRaw": 288042}, "861": {"acRate": 74.9375020832639, "difficulty": "Medium", "likes": 1504, "dislikes": 175, "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": 44964, "totalSubmissionRaw": 60002}, "862": {"acRate": 25.923886959713165, "difficulty": "Hard", "likes": 4057, "dislikes": 110, "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": 91825, "totalSubmissionRaw": 354210}, "863": {"acRate": 64.07229047301357, "difficulty": "Medium", "likes": 10367, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-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": 387037, "totalSubmissionRaw": 604062}, "864": {"acRate": 54.0921358915466, "difficulty": "Hard", "likes": 2224, "dislikes": 96, "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": 69946, "totalSubmissionRaw": 129309}, "865": {"acRate": 69.55810882939574, "difficulty": "Medium", "likes": 2516, "dislikes": 360, "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": 123802, "totalSubmissionRaw": 177984}, "866": {"acRate": 25.819836930948043, "difficulty": "Medium", "likes": 408, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30179, "totalSubmissionRaw": 116883}, "867": {"acRate": 65.88648161236078, "difficulty": "Easy", "likes": 3077, "dislikes": 427, "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": 270352, "totalSubmissionRaw": 410330}, "868": {"acRate": 62.682291886062835, "difficulty": "Easy", "likes": 594, "dislikes": 647, "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": 74402, "totalSubmissionRaw": 118697}, "869": {"acRate": 63.03313992604903, "difficulty": "Medium", "likes": 2079, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"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": 109614, "totalSubmissionRaw": 173899}, "870": {"acRate": 52.157207247887946, "difficulty": "Medium", "likes": 1556, "dislikes": 93, "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": 63528, "totalSubmissionRaw": 121801}, "871": {"acRate": 39.823151724394876, "difficulty": "Hard", "likes": 4497, "dislikes": 80, "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": 128263, "totalSubmissionRaw": 322083}, "872": {"acRate": 67.84185395570923, "difficulty": "Easy", "likes": 3318, "dislikes": 71, "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": 296665, "totalSubmissionRaw": 437288}, "873": {"acRate": 48.13013024413657, "difficulty": "Medium", "likes": 1942, "dislikes": 66, "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": 59163, "totalSubmissionRaw": 122923}, "874": {"acRate": 39.41644889812548, "difficulty": "Medium", "likes": 183, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38312, "totalSubmissionRaw": 97198}, "875": {"acRate": 49.70288039052715, "difficulty": "Medium", "likes": 9302, "dislikes": 458, "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": 471805, "totalSubmissionRaw": 949255}, "876": {"acRate": 76.67686376901091, "difficulty": "Easy", "likes": 10607, "dislikes": 314, "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": 1534716, "totalSubmissionRaw": 2001540}, "877": {"acRate": 70.23219618615603, "difficulty": "Medium", "likes": 3041, "dislikes": 2781, "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": 211182, "totalSubmissionRaw": 300691}, "878": {"acRate": 35.286817012259725, "difficulty": "Hard", "likes": 1227, "dislikes": 153, "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": 34971, "totalSubmissionRaw": 99105}, "879": {"acRate": 48.73573725535006, "difficulty": "Hard", "likes": 1766, "dislikes": 117, "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": 59712, "totalSubmissionRaw": 122522}, "880": {"acRate": 36.550159563208204, "difficulty": "Medium", "likes": 2409, "dislikes": 339, "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": 91511, "totalSubmissionRaw": 250371}, "881": {"acRate": 56.187462118113885, "difficulty": "Medium", "likes": 5651, "dislikes": 134, "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": 267908, "totalSubmissionRaw": 476811}, "882": {"acRate": 50.00394181875517, "difficulty": "Hard", "likes": 756, "dislikes": 216, "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": 25371, "totalSubmissionRaw": 50738}, "883": {"acRate": 71.83374905411843, "difficulty": "Easy", "likes": 542, "dislikes": 1376, "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": 51262, "totalSubmissionRaw": 71362}, "884": {"acRate": 66.6605481492359, "difficulty": "Easy", "likes": 1281, "dislikes": 164, "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": 127106, "totalSubmissionRaw": 190677}, "885": {"acRate": 74.07437559021785, "difficulty": "Medium", "likes": 867, "dislikes": 836, "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": 45495, "totalSubmissionRaw": 61418}, "886": {"acRate": 50.30322011217721, "difficulty": "Medium", "likes": 4503, "dislikes": 104, "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": 194348, "totalSubmissionRaw": 386353}, "887": {"acRate": 27.369406088837135, "difficulty": "Hard", "likes": 3488, "dislikes": 173, "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": 65807, "totalSubmissionRaw": 240440}, "888": {"acRate": 61.113459634446166, "difficulty": "Easy", "likes": 1983, "dislikes": 347, "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": 109870, "totalSubmissionRaw": 179781}, "889": {"acRate": 71.25569935926808, "difficulty": "Medium", "likes": 2646, "dislikes": 104, "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": 94862, "totalSubmissionRaw": 133129}, "890": {"acRate": 77.14689314953466, "difficulty": "Medium", "likes": 3810, "dislikes": 167, "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": 176401, "totalSubmissionRaw": 228656}, "891": {"acRate": 37.20350506118749, "difficulty": "Hard", "likes": 694, "dislikes": 166, "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": 19700, "totalSubmissionRaw": 52952}, "892": {"acRate": 64.85889873909511, "difficulty": "Easy", "likes": 526, "dislikes": 718, "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": 36727, "totalSubmissionRaw": 56626}, "893": {"acRate": 71.34142603151248, "difficulty": "Medium", "likes": 506, "dislikes": 1468, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46546, "totalSubmissionRaw": 65244}, "894": {"acRate": 82.76691093999125, "difficulty": "Medium", "likes": 4833, "dislikes": 324, "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": 164558, "totalSubmissionRaw": 198821}, "895": {"acRate": 66.48756695589687, "difficulty": "Hard", "likes": 4516, "dislikes": 66, "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": 160991, "totalSubmissionRaw": 242137}, "896": {"acRate": 61.06266749938732, "difficulty": "Easy", "likes": 2882, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 386199, "totalSubmissionRaw": 632464}, "897": {"acRate": 78.29877516090498, "difficulty": "Easy", "likes": 4161, "dislikes": 659, "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": 263502, "totalSubmissionRaw": 336534}, "898": {"acRate": 38.09545694785946, "difficulty": "Medium", "likes": 1369, "dislikes": 197, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 33156, "totalSubmissionRaw": 87034}, "899": {"acRate": 65.9868971971824, "difficulty": "Hard", "likes": 1708, "dislikes": 604, "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": 66980, "totalSubmissionRaw": 101505}, "900": {"acRate": 59.40064794816414, "difficulty": "Medium", "likes": 692, "dislikes": 174, "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": 66004, "totalSubmissionRaw": 111116}, "901": {"acRate": 65.54637678611346, "difficulty": "Medium", "likes": 5861, "dislikes": 349, "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": 260967, "totalSubmissionRaw": 398141}, "902": {"acRate": 42.13149186597182, "difficulty": "Hard", "likes": 1346, "dislikes": 95, "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": 42525, "totalSubmissionRaw": 100934}, "903": {"acRate": 57.549147581187455, "difficulty": "Hard", "likes": 692, "dislikes": 41, "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": 14549, "totalSubmissionRaw": 25281}, "904": {"acRate": 43.78785674450183, "difficulty": "Medium", "likes": 4310, "dislikes": 302, "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": 361168, "totalSubmissionRaw": 824816}, "905": {"acRate": 76.23944573396592, "difficulty": "Easy", "likes": 5187, "dislikes": 142, "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": 738699, "totalSubmissionRaw": 968920}, "906": {"acRate": 38.8571047320401, "difficulty": "Hard", "likes": 349, "dislikes": 414, "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": 23296, "totalSubmissionRaw": 59953}, "907": {"acRate": 35.220556707319766, "difficulty": "Medium", "likes": 6703, "dislikes": 436, "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": 159353, "totalSubmissionRaw": 452445}, "908": {"acRate": 69.13584508379213, "difficulty": "Easy", "likes": 640, "dislikes": 1960, "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": 80116, "totalSubmissionRaw": 115882}, "909": {"acRate": 44.31525795329975, "difficulty": "Medium", "likes": 2645, "dislikes": 815, "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": 156038, "totalSubmissionRaw": 352104}, "910": {"acRate": 35.82371414021389, "difficulty": "Medium", "likes": 1590, "dislikes": 438, "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": 50649, "totalSubmissionRaw": 141384}, "911": {"acRate": 51.9600405899333, "difficulty": "Medium", "likes": 942, "dislikes": 636, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 52741, "totalSubmissionRaw": 101503}, "912": {"acRate": 57.87725801311618, "difficulty": "Medium", "likes": 5580, "dislikes": 722, "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": 517602, "totalSubmissionRaw": 894311}, "913": {"acRate": 34.25519131838834, "difficulty": "Hard", "likes": 869, "dislikes": 147, "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": 18245, "totalSubmissionRaw": 53262}, "914": {"acRate": 30.311708367764396, "difficulty": "Easy", "likes": 1741, "dislikes": 463, "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": 111879, "totalSubmissionRaw": 369095}, "915": {"acRate": 48.68901570952847, "difficulty": "Medium", "likes": 1602, "dislikes": 74, "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": 78661, "totalSubmissionRaw": 161558}, "916": {"acRate": 52.89911379551988, "difficulty": "Medium", "likes": 2653, "dislikes": 224, "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": 110967, "totalSubmissionRaw": 209771}, "917": {"acRate": 63.18446456327889, "difficulty": "Easy", "likes": 2103, "dislikes": 66, "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": 185363, "totalSubmissionRaw": 293368}, "918": {"acRate": 43.84786487928684, "difficulty": "Medium", "likes": 6236, "dislikes": 270, "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": 229259, "totalSubmissionRaw": 522851}, "919": {"acRate": 64.73292765382016, "difficulty": "Medium", "likes": 1036, "dislikes": 109, "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": 47870, "totalSubmissionRaw": 73950}, "920": {"acRate": 60.95194085027727, "difficulty": "Hard", "likes": 2243, "dislikes": 191, "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": 65950, "totalSubmissionRaw": 108200}, "921": {"acRate": 75.08079148817384, "difficulty": "Medium", "likes": 3782, "dislikes": 180, "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": 279724, "totalSubmissionRaw": 372564}, "922": {"acRate": 70.5956135646831, "difficulty": "Easy", "likes": 2494, "dislikes": 88, "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": 233009, "totalSubmissionRaw": 330059}, "923": {"acRate": 45.276714714577075, "difficulty": "Medium", "likes": 2548, "dislikes": 303, "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": 98787, "totalSubmissionRaw": 218185}, "924": {"acRate": 41.99667707363386, "difficulty": "Hard", "likes": 927, "dislikes": 541, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46003, "totalSubmissionRaw": 109540}, "925": {"acRate": 32.59421356858809, "difficulty": "Easy", "likes": 2329, "dislikes": 334, "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": 127944, "totalSubmissionRaw": 392531}, "926": {"acRate": 61.42030492611664, "difficulty": "Medium", "likes": 4307, "dislikes": 176, "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": 183097, "totalSubmissionRaw": 298105}, "927": {"acRate": 39.62714577468675, "difficulty": "Hard", "likes": 811, "dislikes": 119, "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": 28717, "totalSubmissionRaw": 72468}, "928": {"acRate": 42.8369595931054, "difficulty": "Hard", "likes": 632, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19708, "totalSubmissionRaw": 46007}, "929": {"acRate": 67.01811920964171, "difficulty": "Easy", "likes": 2557, "dislikes": 313, "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": 449571, "totalSubmissionRaw": 670822}, "930": {"acRate": 54.963409937090766, "difficulty": "Medium", "likes": 2616, "dislikes": 73, "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": 85622, "totalSubmissionRaw": 155780}, "931": {"acRate": 65.50398823069673, "difficulty": "Medium", "likes": 5372, "dislikes": 132, "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": 284961, "totalSubmissionRaw": 435029}, "932": {"acRate": 65.44848418449595, "difficulty": "Medium", "likes": 1007, "dislikes": 1464, "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": 41817, "totalSubmissionRaw": 63893}, "933": {"acRate": 73.75735218447947, "difficulty": "Easy", "likes": 321, "dislikes": 465, "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": 186344, "totalSubmissionRaw": 252645}, "934": {"acRate": 57.74275688600441, "difficulty": "Medium", "likes": 5106, "dislikes": 189, "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": 185948, "totalSubmissionRaw": 322024}, "935": {"acRate": 51.380805853705816, "difficulty": "Medium", "likes": 2129, "dislikes": 394, "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": 106032, "totalSubmissionRaw": 206365}, "936": {"acRate": 62.57621203032121, "difficulty": "Hard", "likes": 1520, "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": 57373, "totalSubmissionRaw": 91685}, "937": {"acRate": 56.348963352337734, "difficulty": "Medium", "likes": 2034, "dislikes": 4356, "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": 349678, "totalSubmissionRaw": 620558}, "938": {"acRate": 85.91366062938786, "difficulty": "Easy", "likes": 6127, "dislikes": 357, "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": 829445, "totalSubmissionRaw": 965441}, "939": {"acRate": 53.1436993739056, "difficulty": "Medium", "likes": 1842, "dislikes": 268, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 126558, "totalSubmissionRaw": 238143}, "940": {"acRate": 43.23680701085921, "difficulty": "Hard", "likes": 1628, "dislikes": 35, "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": 36312, "totalSubmissionRaw": 83984}, "941": {"acRate": 33.34893193913281, "difficulty": "Easy", "likes": 2805, "dislikes": 176, "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": 388393, "totalSubmissionRaw": 1164634}, "942": {"acRate": 77.96356581500115, "difficulty": "Easy", "likes": 2348, "dislikes": 946, "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": 142257, "totalSubmissionRaw": 182466}, "943": {"acRate": 43.80973835806005, "difficulty": "Hard", "likes": 1376, "dislikes": 144, "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": 27226, "totalSubmissionRaw": 62146}, "944": {"acRate": 74.62847710001626, "difficulty": "Easy", "likes": 1653, "dislikes": 2842, "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": 179027, "totalSubmissionRaw": 239891}, "945": {"acRate": 51.95116868025338, "difficulty": "Medium", "likes": 1723, "dislikes": 53, "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": 82260, "totalSubmissionRaw": 158341}, "946": {"acRate": 69.40650704999307, "difficulty": "Medium", "likes": 5746, "dislikes": 117, "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": 285448, "totalSubmissionRaw": 411272}, "947": {"acRate": 58.87615836174114, "difficulty": "Medium", "likes": 5086, "dislikes": 631, "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": 191364, "totalSubmissionRaw": 325028}, "948": {"acRate": 52.1872781981946, "difficulty": "Medium", "likes": 2305, "dislikes": 426, "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": 104409, "totalSubmissionRaw": 200066}, "949": {"acRate": 35.12781351854064, "difficulty": "Medium", "likes": 676, "dislikes": 1029, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82341, "totalSubmissionRaw": 234404}, "950": {"acRate": 77.94373122097788, "difficulty": "Medium", "likes": 2419, "dislikes": 337, "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": 71338, "totalSubmissionRaw": 91525}, "951": {"acRate": 66.91332284354465, "difficulty": "Medium", "likes": 2194, "dislikes": 91, "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": 137359, "totalSubmissionRaw": 205278}, "952": {"acRate": 40.32853495229286, "difficulty": "Hard", "likes": 1558, "dislikes": 88, "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": 51016, "totalSubmissionRaw": 126501}, "953": {"acRate": 54.64362850971922, "difficulty": "Easy", "likes": 4750, "dislikes": 1565, "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": 475891, "totalSubmissionRaw": 870894}, "954": {"acRate": 39.05302661304164, "difficulty": "Medium", "likes": 1471, "dislikes": 145, "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": 84187, "totalSubmissionRaw": 215571}, "955": {"acRate": 34.92601045424428, "difficulty": "Medium", "likes": 624, "dislikes": 85, "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": 18976, "totalSubmissionRaw": 54332}, "956": {"acRate": 52.56756246697365, "difficulty": "Hard", "likes": 2238, "dislikes": 55, "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": 55709, "totalSubmissionRaw": 105976}, "957": {"acRate": 38.9951571117225, "difficulty": "Medium", "likes": 1442, "dislikes": 1713, "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": 155485, "totalSubmissionRaw": 398729}, "958": {"acRate": 56.33927351354827, "difficulty": "Medium", "likes": 4090, "dislikes": 53, "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": 210262, "totalSubmissionRaw": 373212}, "959": {"acRate": 69.3250663299329, "difficulty": "Medium", "likes": 2984, "dislikes": 559, "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": 48861, "totalSubmissionRaw": 70481}, "960": {"acRate": 57.53141676708555, "difficulty": "Hard", "likes": 568, "dislikes": 13, "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": 13368, "totalSubmissionRaw": 23236}, "961": {"acRate": 76.28366534973013, "difficulty": "Easy", "likes": 1291, "dislikes": 325, "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": 219341, "totalSubmissionRaw": 287533}, "962": {"acRate": 49.327220287956614, "difficulty": "Medium", "likes": 1585, "dislikes": 42, "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": 42928, "totalSubmissionRaw": 87027}, "963": {"acRate": 54.64069647336579, "difficulty": "Medium", "likes": 355, "dislikes": 442, "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": 25921, "totalSubmissionRaw": 47439}, "964": {"acRate": 48.06281640665358, "difficulty": "Hard", "likes": 307, "dislikes": 67, "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": 9304, "totalSubmissionRaw": 19358}, "965": {"acRate": 70.25939486045868, "difficulty": "Easy", "likes": 1809, "dislikes": 63, "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": 203415, "totalSubmissionRaw": 289520}, "966": {"acRate": 51.25376779960503, "difficulty": "Medium", "likes": 404, "dislikes": 798, "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": 39449, "totalSubmissionRaw": 76968}, "967": {"acRate": 57.65797650346565, "difficulty": "Medium", "likes": 2729, "dislikes": 190, "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": 125442, "totalSubmissionRaw": 217561}, "968": {"acRate": 46.479394497942714, "difficulty": "Hard", "likes": 5111, "dislikes": 66, "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": 128100, "totalSubmissionRaw": 275606}, "969": {"acRate": 70.34961345048409, "difficulty": "Medium", "likes": 1414, "dislikes": 1479, "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": 87994, "totalSubmissionRaw": 125081}, "970": {"acRate": 43.66583333333333, "difficulty": "Medium", "likes": 361, "dislikes": 76, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52399, "totalSubmissionRaw": 120000}, "971": {"acRate": 50.25593532157742, "difficulty": "Medium", "likes": 912, "dislikes": 265, "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": 40156, "totalSubmissionRaw": 79903}, "972": {"acRate": 43.47996601085038, "difficulty": "Hard", "likes": 90, "dislikes": 208, "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": 6652, "totalSubmissionRaw": 15299}, "973": {"acRate": 65.89762215785979, "difficulty": "Medium", "likes": 7976, "dislikes": 279, "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": 1056834, "totalSubmissionRaw": 1603752}, "974": {"acRate": 53.963086817989016, "difficulty": "Medium", "likes": 6351, "dislikes": 263, "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": 218816, "totalSubmissionRaw": 405492}, "975": {"acRate": 39.284626783865534, "difficulty": "Hard", "likes": 1885, "dislikes": 469, "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": 77408, "totalSubmissionRaw": 197043}, "976": {"acRate": 55.05141022053838, "difficulty": "Easy", "likes": 2883, "dislikes": 396, "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": 218395, "totalSubmissionRaw": 396711}, "977": {"acRate": 71.77842063347121, "difficulty": "Easy", "likes": 8403, "dislikes": 206, "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": 1524964, "totalSubmissionRaw": 2124543}, "978": {"acRate": 47.23211125684425, "difficulty": "Medium", "likes": 1851, "dislikes": 210, "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": 90748, "totalSubmissionRaw": 192132}, "979": {"acRate": 72.40196708448046, "difficulty": "Medium", "likes": 4792, "dislikes": 161, "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": 107034, "totalSubmissionRaw": 147833}, "980": {"acRate": 81.74586799534669, "difficulty": "Hard", "likes": 4924, "dislikes": 182, "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": 186213, "totalSubmissionRaw": 227795}, "981": {"acRate": 50.394900317628235, "difficulty": "Medium", "likes": 4463, "dislikes": 455, "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": 365869, "totalSubmissionRaw": 725997}, "982": {"acRate": 57.850383860025, "difficulty": "Hard", "likes": 411, "dislikes": 211, "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": 16201, "totalSubmissionRaw": 28005}, "983": {"acRate": 65.54379663163728, "difficulty": "Medium", "likes": 7542, "dislikes": 135, "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": 264949, "totalSubmissionRaw": 404232}, "984": {"acRate": 43.56817663337268, "difficulty": "Medium", "likes": 760, "dislikes": 362, "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": 43925, "totalSubmissionRaw": 100819}, "985": {"acRate": 68.01734713969093, "difficulty": "Medium", "likes": 2036, "dislikes": 314, "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": 134724, "totalSubmissionRaw": 198073}, "986": {"acRate": 71.28384911089282, "difficulty": "Medium", "likes": 5319, "dislikes": 104, "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": 368642, "totalSubmissionRaw": 517143}, "987": {"acRate": 46.2928531452246, "difficulty": "Hard", "likes": 6980, "dislikes": 4251, "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": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 369731, "totalSubmissionRaw": 798678}, "988": {"acRate": 50.76487010027348, "difficulty": "Medium", "likes": 1625, "dislikes": 223, "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": "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": 71282, "totalSubmissionRaw": 140416}, "989": {"acRate": 46.08640121507102, "difficulty": "Easy", "likes": 3296, "dislikes": 266, "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": 240318, "totalSubmissionRaw": 521451}, "990": {"acRate": 50.460918241577644, "difficulty": "Medium", "likes": 3574, "dislikes": 56, "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": 117909, "totalSubmissionRaw": 233664}, "991": {"acRate": 54.240321464147634, "difficulty": "Medium", "likes": 2608, "dislikes": 205, "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": 96378, "totalSubmissionRaw": 177687}, "992": {"acRate": 55.87216946293784, "difficulty": "Hard", "likes": 4811, "dislikes": 65, "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": 106665, "totalSubmissionRaw": 190908}, "993": {"acRate": 55.269439327504344, "difficulty": "Easy", "likes": 3791, "dislikes": 186, "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": 255630, "totalSubmissionRaw": 462516}, "994": {"acRate": 53.55101411180545, "difficulty": "Medium", "likes": 11807, "dislikes": 369, "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": 701232, "totalSubmissionRaw": 1309467}, "995": {"acRate": 51.39820940771502, "difficulty": "Hard", "likes": 1152, "dislikes": 56, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 32551, "totalSubmissionRaw": 63331}, "996": {"acRate": 49.1920159092583, "difficulty": "Hard", "likes": 947, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "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": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33394, "totalSubmissionRaw": 67885}, "997": {"acRate": 49.25488087208561, "difficulty": "Easy", "likes": 5869, "dislikes": 467, "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": 432316, "totalSubmissionRaw": 877712}, "998": {"acRate": 68.14560607917637, "difficulty": "Medium", "likes": 502, "dislikes": 761, "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": 33360, "totalSubmissionRaw": 48954}, "999": {"acRate": 68.48268499366117, "difficulty": "Easy", "likes": 625, "dislikes": 625, "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": 61581, "totalSubmissionRaw": 89922}, "1000": {"acRate": 42.81908990011099, "difficulty": "Hard", "likes": 2333, "dislikes": 103, "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": 36651, "totalSubmissionRaw": 85595}, "1001": {"acRate": 36.30470945907188, "difficulty": "Hard", "likes": 576, "dislikes": 142, "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": 18987, "totalSubmissionRaw": 52299}, "1002": {"acRate": 68.64199713583564, "difficulty": "Easy", "likes": 3349, "dislikes": 269, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 194123, "totalSubmissionRaw": 282805}, "1003": {"acRate": 58.83401714175241, "difficulty": "Medium", "likes": 916, "dislikes": 466, "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": 54778, "totalSubmissionRaw": 93106}, "1004": {"acRate": 62.77469485639674, "difficulty": "Medium", "likes": 7655, "dislikes": 93, "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": 382687, "totalSubmissionRaw": 609622}, "1005": {"acRate": 50.80022304975677, "difficulty": "Easy", "likes": 1449, "dislikes": 104, "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": 79258, "totalSubmissionRaw": 156019}, "1006": {"acRate": 56.33241843283736, "difficulty": "Medium", "likes": 336, "dislikes": 336, "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": 27297, "totalSubmissionRaw": 48457}, "1007": {"acRate": 52.24349776261386, "difficulty": "Medium", "likes": 2778, "dislikes": 250, "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": 196609, "totalSubmissionRaw": 376332}, "1008": {"acRate": 81.67259518661041, "difficulty": "Medium", "likes": 5796, "dislikes": 73, "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": 325578, "totalSubmissionRaw": 398638}, "1009": {"acRate": 60.84888689990435, "difficulty": "Easy", "likes": 2246, "dislikes": 108, "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": 208031, "totalSubmissionRaw": 341881}, "1010": {"acRate": 52.66739878045256, "difficulty": "Medium", "likes": 4081, "dislikes": 159, "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": 255143, "totalSubmissionRaw": 484442}, "1011": {"acRate": 68.48395098783524, "difficulty": "Medium", "likes": 8748, "dislikes": 184, "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": 310305, "totalSubmissionRaw": 453103}, "1012": {"acRate": 41.34207699700379, "difficulty": "Hard", "likes": 711, "dislikes": 78, "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": 14626, "totalSubmissionRaw": 35378}, "1013": {"acRate": 42.17903917162458, "difficulty": "Easy", "likes": 1630, "dislikes": 148, "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": 85216, "totalSubmissionRaw": 202034}, "1014": {"acRate": 59.37724776316055, "difficulty": "Medium", "likes": 2429, "dislikes": 57, "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": 88329, "totalSubmissionRaw": 148759}, "1015": {"acRate": 46.80760936537276, "difficulty": "Medium", "likes": 1111, "dislikes": 845, "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": 60775, "totalSubmissionRaw": 129840}, "1016": {"acRate": 57.34632683658171, "difficulty": "Medium", "likes": 333, "dislikes": 518, "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": 35190, "totalSubmissionRaw": 61364}, "1017": {"acRate": 60.48860176728299, "difficulty": "Medium", "likes": 489, "dislikes": 277, "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": 24438, "totalSubmissionRaw": 40401}, "1018": {"acRate": 46.73551305702075, "difficulty": "Easy", "likes": 699, "dislikes": 179, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50414, "totalSubmissionRaw": 107872}, "1019": {"acRate": 60.14343865090134, "difficulty": "Medium", "likes": 3132, "dislikes": 112, "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": 139626, "totalSubmissionRaw": 232155}, "1020": {"acRate": 68.77671903167654, "difficulty": "Medium", "likes": 3759, "dislikes": 70, "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": 186942, "totalSubmissionRaw": 271810}, "1021": {"acRate": 81.62080749999203, "difficulty": "Easy", "likes": 2566, "dislikes": 1507, "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": 255789, "totalSubmissionRaw": 313387}, "1022": {"acRate": 73.3569142291117, "difficulty": "Easy", "likes": 3231, "dislikes": 182, "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": 198473, "totalSubmissionRaw": 270558}, "1023": {"acRate": 61.40105578541875, "difficulty": "Medium", "likes": 839, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"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": 43035, "totalSubmissionRaw": 70089}, "1024": {"acRate": 50.847499122713955, "difficulty": "Medium", "likes": 1685, "dislikes": 60, "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": 62305, "totalSubmissionRaw": 122535}, "1025": {"acRate": 68.1008188965905, "difficulty": "Easy", "likes": 2023, "dislikes": 3988, "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": 225283, "totalSubmissionRaw": 330809}, "1026": {"acRate": 75.59826874995623, "difficulty": "Medium", "likes": 4151, "dislikes": 98, "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": 215889, "totalSubmissionRaw": 285574}, "1027": {"acRate": 49.02461858424081, "difficulty": "Medium", "likes": 4470, "dislikes": 198, "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": 160762, "totalSubmissionRaw": 327922}, "1028": {"acRate": 73.61554587969682, "difficulty": "Hard", "likes": 1535, "dislikes": 40, "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": 45649, "totalSubmissionRaw": 62010}, "1029": {"acRate": 66.13447548409374, "difficulty": "Medium", "likes": 4545, "dislikes": 341, "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": 227908, "totalSubmissionRaw": 344613}, "1030": {"acRate": 70.15957864947724, "difficulty": "Easy", "likes": 702, "dislikes": 304, "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": 53550, "totalSubmissionRaw": 76326}, "1031": {"acRate": 59.696101743767116, "difficulty": "Medium", "likes": 2451, "dislikes": 80, "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": 66277, "totalSubmissionRaw": 111024}, "1032": {"acRate": 51.73089125341663, "difficulty": "Hard", "likes": 1766, "dislikes": 179, "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": 84788, "totalSubmissionRaw": 163903}, "1033": {"acRate": 47.0730722648365, "difficulty": "Medium", "likes": 204, "dislikes": 640, "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": 23320, "totalSubmissionRaw": 49540}, "1034": {"acRate": 49.092819831236675, "difficulty": "Medium", "likes": 668, "dislikes": 849, "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": 31766, "totalSubmissionRaw": 64706}, "1035": {"acRate": 62.46703228591824, "difficulty": "Medium", "likes": 3677, "dislikes": 52, "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": 146136, "totalSubmissionRaw": 233941}, "1036": {"acRate": 34.386836275280494, "difficulty": "Hard", "likes": 631, "dislikes": 164, "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": 19247, "totalSubmissionRaw": 55972}, "1037": {"acRate": 36.83206871409456, "difficulty": "Easy", "likes": 381, "dislikes": 506, "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": 45969, "totalSubmissionRaw": 124807}, "1038": {"acRate": 85.64739884393063, "difficulty": "Medium", "likes": 3608, "dislikes": 151, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 162986, "totalSubmissionRaw": 190299}, "1039": {"acRate": 57.84941247116946, "difficulty": "Medium", "likes": 1719, "dislikes": 159, "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": 42388, "totalSubmissionRaw": 73273}, "1040": {"acRate": 56.59088160599831, "difficulty": "Medium", "likes": 355, "dislikes": 584, "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": 9359, "totalSubmissionRaw": 16538}, "1041": {"acRate": 55.460109006890924, "difficulty": "Medium", "likes": 3600, "dislikes": 675, "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": 218672, "totalSubmissionRaw": 394287}, "1042": {"acRate": 50.891154595796486, "difficulty": "Medium", "likes": 1352, "dislikes": 705, "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": 72326, "totalSubmissionRaw": 142119}, "1043": {"acRate": 72.19107253772935, "difficulty": "Medium", "likes": 3648, "dislikes": 245, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 86007, "totalSubmissionRaw": 119138}, "1044": {"acRate": 30.428074306521523, "difficulty": "Hard", "likes": 2137, "dislikes": 374, "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": 64094, "totalSubmissionRaw": 210641}, "1045": {"acRate": 61.839810877311486, "difficulty": "Medium", "likes": 538, "dislikes": 55, "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": 89723, "totalSubmissionRaw": 145089}, "1046": {"acRate": 65.16181809511116, "difficulty": "Easy", "likes": 5675, "dislikes": 95, "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": 532893, "totalSubmissionRaw": 817800}, "1047": {"acRate": 69.05892060472986, "difficulty": "Easy", "likes": 6263, "dislikes": 236, "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": 493792, "totalSubmissionRaw": 715030}, "1048": {"acRate": 60.84841744643862, "difficulty": "Medium", "likes": 6992, "dislikes": 251, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380804, "totalSubmissionRaw": 625824}, "1049": {"acRate": 54.46382886261206, "difficulty": "Medium", "likes": 2944, "dislikes": 102, "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": 77703, "totalSubmissionRaw": 142669}, "1050": {"acRate": 69.64450879648237, "difficulty": "Easy", "likes": 588, "dislikes": 45, "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": 143818, "totalSubmissionRaw": 206503}, "1051": {"acRate": 76.06541154723274, "difficulty": "Easy", "likes": 1060, "dislikes": 73, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 302858, "totalSubmissionRaw": 398155}, "1052": {"acRate": 57.12342884173537, "difficulty": "Medium", "likes": 1612, "dislikes": 127, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 67625, "totalSubmissionRaw": 118384}, "1053": {"acRate": 50.06887234775238, "difficulty": "Medium", "likes": 416, "dislikes": 36, "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": 37803, "totalSubmissionRaw": 75502}, "1054": {"acRate": 46.11986865629783, "difficulty": "Medium", "likes": 1207, "dislikes": 47, "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": 39468, "totalSubmissionRaw": 85577}, "1055": {"acRate": 59.85367886967645, "difficulty": "Medium", "likes": 1231, "dislikes": 66, "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": 83284, "totalSubmissionRaw": 139146}, "1056": {"acRate": 48.47875223364851, "difficulty": "Easy", "likes": 293, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 40966, "totalSubmissionRaw": 84503}, "1057": {"acRate": 57.6793186024684, "difficulty": "Medium", "likes": 925, "dislikes": 178, "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": 65755, "totalSubmissionRaw": 113999}, "1058": {"acRate": 45.017270711965764, "difficulty": "Medium", "likes": 144, "dislikes": 142, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8732, "totalSubmissionRaw": 19397}, "1059": {"acRate": 38.36142224083185, "difficulty": "Medium", "likes": 674, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 54970, "totalSubmissionRaw": 143295}, "1060": {"acRate": 55.52781624741199, "difficulty": "Medium", "likes": 1575, "dislikes": 57, "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": 119884, "totalSubmissionRaw": 215899}, "1061": {"acRate": 76.53981953707336, "difficulty": "Medium", "likes": 2241, "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": 74138, "totalSubmissionRaw": 96862}, "1062": {"acRate": 59.73461758663659, "difficulty": "Medium", "likes": 628, "dislikes": 49, "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": 35474, "totalSubmissionRaw": 59386}, "1063": {"acRate": 77.89983377899834, "difficulty": "Hard", "likes": 281, "dislikes": 13, "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": 10779, "totalSubmissionRaw": 13837}, "1064": {"acRate": 64.1330599225336, "difficulty": "Easy", "likes": 425, "dislikes": 64, "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": 42221, "totalSubmissionRaw": 65832}, "1065": {"acRate": 66.96961234799828, "difficulty": "Easy", "likes": 364, "dislikes": 105, "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": 26380, "totalSubmissionRaw": 39391}, "1066": {"acRate": 54.900384061449834, "difficulty": "Medium", "likes": 866, "dislikes": 81, "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": 45743, "totalSubmissionRaw": 83320}, "1067": {"acRate": 46.01726863675058, "difficulty": "Hard", "likes": 88, "dislikes": 24, "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": 3784, "totalSubmissionRaw": 8223}, "1068": {"acRate": 80.37805055957318, "difficulty": "Easy", "likes": 538, "dislikes": 184, "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": 192832, "totalSubmissionRaw": 239906}, "1069": {"acRate": 81.83523348175694, "difficulty": "Easy", "likes": 75, "dislikes": 176, "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": 50174, "totalSubmissionRaw": 61311}, "1070": {"acRate": 43.42613616100617, "difficulty": "Medium", "likes": 241, "dislikes": 669, "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": 73061, "totalSubmissionRaw": 168242}, "1071": {"acRate": 52.17443426497061, "difficulty": "Easy", "likes": 4396, "dislikes": 945, "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": 278537, "totalSubmissionRaw": 533860}, "1072": {"acRate": 63.77583061694428, "difficulty": "Medium", "likes": 714, "dislikes": 49, "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": 21326, "totalSubmissionRaw": 33439}, "1073": {"acRate": 36.54475435745609, "difficulty": "Medium", "likes": 300, "dislikes": 123, "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": 16417, "totalSubmissionRaw": 44923}, "1074": {"acRate": 69.60029165600106, "difficulty": "Hard", "likes": 3028, "dislikes": 64, "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": 89727, "totalSubmissionRaw": 128918}, "1075": {"acRate": 64.82258026412153, "difficulty": "Easy", "likes": 396, "dislikes": 102, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109755, "totalSubmissionRaw": 169316}, "1076": {"acRate": 49.88901688629148, "difficulty": "Easy", "likes": 197, "dislikes": 59, "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": 53268, "totalSubmissionRaw": 106773}, "1077": {"acRate": 76.65960929170984, "difficulty": "Medium", "likes": 254, "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": 51053, "totalSubmissionRaw": 66597}, "1078": {"acRate": 63.367957493657556, "difficulty": "Easy", "likes": 461, "dislikes": 349, "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": 66191, "totalSubmissionRaw": 104455}, "1079": {"acRate": 76.11797575293942, "difficulty": "Medium", "likes": 2386, "dislikes": 65, "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": 91541, "totalSubmissionRaw": 120262}, "1080": {"acRate": 54.39400048383195, "difficulty": "Medium", "likes": 632, "dislikes": 677, "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": 33727, "totalSubmissionRaw": 62005}, "1081": {"acRate": 60.3581313017711, "difficulty": "Medium", "likes": 2498, "dislikes": 178, "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": 61718, "totalSubmissionRaw": 102253}, "1082": {"acRate": 74.29841131783157, "difficulty": "Easy", "likes": 189, "dislikes": 72, "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": 54671, "totalSubmissionRaw": 73583}, "1083": {"acRate": 49.69549774933119, "difficulty": "Easy", "likes": 255, "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": 54428, "totalSubmissionRaw": 109523}, "1084": {"acRate": 47.26333311358692, "difficulty": "Easy", "likes": 648, "dislikes": 137, "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": 114710, "totalSubmissionRaw": 242704}, "1085": {"acRate": 76.37261356155365, "difficulty": "Easy", "likes": 113, "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": 23202, "totalSubmissionRaw": 30380}, "1086": {"acRate": 74.81917799714411, "difficulty": "Easy", "likes": 772, "dislikes": 124, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96409, "totalSubmissionRaw": 128856}, "1087": {"acRate": 66.25658113962012, "difficulty": "Medium", "likes": 623, "dislikes": 50, "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": 49709, "totalSubmissionRaw": 75025}, "1088": {"acRate": 47.16174234053893, "difficulty": "Hard", "likes": 482, "dislikes": 140, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 36282, "totalSubmissionRaw": 76931}, "1089": {"acRate": 51.599610470572735, "difficulty": "Easy", "likes": 2469, "dislikes": 705, "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": 379914, "totalSubmissionRaw": 736273}, "1090": {"acRate": 61.53013478594874, "difficulty": "Medium", "likes": 413, "dislikes": 618, "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": 35242, "totalSubmissionRaw": 57276}, "1091": {"acRate": 46.6765962728514, "difficulty": "Medium", "likes": 6088, "dislikes": 211, "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": 394859, "totalSubmissionRaw": 845947}, "1092": {"acRate": 58.85039969547011, "difficulty": "Hard", "likes": 4484, "dislikes": 63, "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": 94306, "totalSubmissionRaw": 160247}, "1093": {"acRate": 42.67988874108114, "difficulty": "Medium", "likes": 124, "dislikes": 98, "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": 17646, "totalSubmissionRaw": 41345}, "1094": {"acRate": 56.34130256478465, "difficulty": "Medium", "likes": 4264, "dislikes": 87, "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": 203327, "totalSubmissionRaw": 360884}, "1095": {"acRate": 40.7417161857418, "difficulty": "Hard", "likes": 3009, "dislikes": 125, "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": 123752, "totalSubmissionRaw": 303749}, "1096": {"acRate": 63.735188607457324, "difficulty": "Hard", "likes": 463, "dislikes": 278, "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": 23452, "totalSubmissionRaw": 36796}, "1097": {"acRate": 51.797783184644494, "difficulty": "Hard", "likes": 172, "dislikes": 31, "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": 21076, "totalSubmissionRaw": 40689}, "1098": {"acRate": 43.45879192100116, "difficulty": "Medium", "likes": 195, "dislikes": 578, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36880, "totalSubmissionRaw": 84862}, "1099": {"acRate": 61.158890398299135, "difficulty": "Easy", "likes": 1067, "dislikes": 125, "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": 121105, "totalSubmissionRaw": 198017}, "1100": {"acRate": 74.70102645940462, "difficulty": "Medium", "likes": 537, "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": 37914, "totalSubmissionRaw": 50753}, "1101": {"acRate": 64.38291963200832, "difficulty": "Medium", "likes": 903, "dislikes": 27, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74182, "totalSubmissionRaw": 115220}, "1102": {"acRate": 53.48436279395523, "difficulty": "Medium", "likes": 1268, "dislikes": 122, "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": "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": 59565, "totalSubmissionRaw": 111369}, "1103": {"acRate": 64.65828625984565, "difficulty": "Easy", "likes": 924, "dislikes": 185, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81269, "totalSubmissionRaw": 125690}, "1104": {"acRate": 75.1282280403896, "difficulty": "Medium", "likes": 1432, "dislikes": 304, "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": 42038, "totalSubmissionRaw": 55955}, "1105": {"acRate": 59.49894867628787, "difficulty": "Medium", "likes": 1759, "dislikes": 119, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49803, "totalSubmissionRaw": 83704}, "1106": {"acRate": 58.668692044346706, "difficulty": "Hard", "likes": 1071, "dislikes": 54, "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": 25877, "totalSubmissionRaw": 44107}, "1107": {"acRate": 44.76387160304717, "difficulty": "Medium", "likes": 141, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32729, "totalSubmissionRaw": 73116}, "1108": {"acRate": 88.88161495782848, "difficulty": "Easy", "likes": 1912, "dislikes": 1723, "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": 571585, "totalSubmissionRaw": 643086}, "1109": {"acRate": 60.926823476073785, "difficulty": "Medium", "likes": 1528, "dislikes": 156, "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": 56442, "totalSubmissionRaw": 92639}, "1110": {"acRate": 69.18630627587979, "difficulty": "Medium", "likes": 3660, "dislikes": 103, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 196660, "totalSubmissionRaw": 284247}, "1111": {"acRate": 72.64396729853561, "difficulty": "Medium", "likes": 391, "dislikes": 1586, "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": 24258, "totalSubmissionRaw": 33393}, "1112": {"acRate": 71.09270955576946, "difficulty": "Medium", "likes": 279, "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": 53916, "totalSubmissionRaw": 75839}, "1113": {"acRate": 64.90958233159616, "difficulty": "Easy", "likes": 102, "dislikes": 384, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43468, "totalSubmissionRaw": 66967}, "1114": {"acRate": 68.97585361805169, "difficulty": "Easy", "likes": 1381, "dislikes": 194, "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": 141286, "totalSubmissionRaw": 204834}, "1115": {"acRate": 64.22067582190395, "difficulty": "Medium", "likes": 646, "dislikes": 50, "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": 72999, "totalSubmissionRaw": 113669}, "1116": {"acRate": 60.62625562868029, "difficulty": "Medium", "likes": 454, "dislikes": 308, "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": 43757, "totalSubmissionRaw": 72175}, "1117": {"acRate": 55.96104865059559, "difficulty": "Medium", "likes": 482, "dislikes": 126, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43503, "totalSubmissionRaw": 77738}, "1118": {"acRate": 57.7776161733692, "difficulty": "Easy", "likes": 39, "dislikes": 167, "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": 7945, "totalSubmissionRaw": 13751}, "1119": {"acRate": 90.79386441990376, "difficulty": "Easy", "likes": 341, "dislikes": 111, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 98495, "totalSubmissionRaw": 108482}, "1120": {"acRate": 65.642719574784, "difficulty": "Medium", "likes": 777, "dislikes": 33, "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": 61009, "totalSubmissionRaw": 92941}, "1121": {"acRate": 61.111849980050536, "difficulty": "Hard", "likes": 119, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4595, "totalSubmissionRaw": 7519}, "1122": {"acRate": 68.66647734188, "difficulty": "Easy", "likes": 2426, "dislikes": 138, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 169256, "totalSubmissionRaw": 246490}, "1123": {"acRate": 71.25980220037454, "difficulty": "Medium", "likes": 1835, "dislikes": 803, "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": 97415, "totalSubmissionRaw": 136704}, "1124": {"acRate": 34.69923100879189, "difficulty": "Medium", "likes": 1339, "dislikes": 107, "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": 28969, "totalSubmissionRaw": 83486}, "1125": {"acRate": 56.34219711139822, "difficulty": "Hard", "likes": 2074, "dislikes": 52, "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": 58437, "totalSubmissionRaw": 103718}, "1126": {"acRate": 66.0208620225715, "difficulty": "Medium", "likes": 260, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41710, "totalSubmissionRaw": 63177}, "1127": {"acRate": 48.24112021857923, "difficulty": "Hard", "likes": 175, "dislikes": 129, "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": 14124, "totalSubmissionRaw": 29277}, "1128": {"acRate": 47.68901787078051, "difficulty": "Easy", "likes": 640, "dislikes": 322, "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": 62440, "totalSubmissionRaw": 130935}, "1129": {"acRate": 47.58503938785184, "difficulty": "Medium", "likes": 3333, "dislikes": 173, "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": 105408, "totalSubmissionRaw": 221515}, "1130": {"acRate": 67.95749599857727, "difficulty": "Medium", "likes": 4112, "dislikes": 262, "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": 91710, "totalSubmissionRaw": 134952}, "1131": {"acRate": 48.54290959155576, "difficulty": "Medium", "likes": 608, "dislikes": 397, "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": 21155, "totalSubmissionRaw": 43580}, "1132": {"acRate": 32.66564960259163, "difficulty": "Medium", "likes": 144, "dislikes": 547, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34687, "totalSubmissionRaw": 106188}, "1133": {"acRate": 68.19479405436572, "difficulty": "Easy", "likes": 297, "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": 48494, "totalSubmissionRaw": 71111}, "1134": {"acRate": 77.83339046966061, "difficulty": "Easy", "likes": 197, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34056, "totalSubmissionRaw": 43755}, "1135": {"acRate": 61.66394635063691, "difficulty": "Medium", "likes": 1080, "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": 69515, "totalSubmissionRaw": 112729}, "1136": {"acRate": 61.38057239383089, "difficulty": "Medium", "likes": 1066, "dislikes": 23, "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": 69767, "totalSubmissionRaw": 113663}, "1137": {"acRate": 63.516792850197945, "difficulty": "Easy", "likes": 3889, "dislikes": 170, "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": 554628, "totalSubmissionRaw": 873199}, "1138": {"acRate": 51.874029482461545, "difficulty": "Medium", "likes": 859, "dislikes": 171, "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": 48773, "totalSubmissionRaw": 94022}, "1139": {"acRate": 50.195455131234155, "difficulty": "Medium", "likes": 686, "dislikes": 105, "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": 23370, "totalSubmissionRaw": 46558}, "1140": {"acRate": 68.30895540849774, "difficulty": "Medium", "likes": 2710, "dislikes": 593, "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": 88359, "totalSubmissionRaw": 129352}, "1141": {"acRate": 47.87339959127351, "difficulty": "Easy", "likes": 501, "dislikes": 669, "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": 137040, "totalSubmissionRaw": 286255}, "1142": {"acRate": 35.593465898801114, "difficulty": "Easy", "likes": 98, "dislikes": 360, "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": 39308, "totalSubmissionRaw": 110436}, "1143": {"acRate": 57.628340734024285, "difficulty": "Medium", "likes": 12290, "dislikes": 155, "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": 822421, "totalSubmissionRaw": 1427115}, "1144": {"acRate": 47.55086855002181, "difficulty": "Medium", "likes": 406, "dislikes": 165, "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": 18532, "totalSubmissionRaw": 38973}, "1145": {"acRate": 51.81688229005249, "difficulty": "Medium", "likes": 1306, "dislikes": 205, "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": 43136, "totalSubmissionRaw": 83247}, "1146": {"acRate": 37.310131494334435, "difficulty": "Medium", "likes": 3565, "dislikes": 467, "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": 201909, "totalSubmissionRaw": 541163}, "1147": {"acRate": 58.79398334676337, "difficulty": "Hard", "likes": 623, "dislikes": 29, "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": 21889, "totalSubmissionRaw": 37230}, "1148": {"acRate": 74.14785001846096, "difficulty": "Easy", "likes": 994, "dislikes": 49, "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": 283158, "totalSubmissionRaw": 381883}, "1149": {"acRate": 46.882296387858815, "difficulty": "Medium", "likes": 125, "dislikes": 28, "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": 34133, "totalSubmissionRaw": 72805}, "1150": {"acRate": 58.65026724193445, "difficulty": "Easy", "likes": 440, "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": 45539, "totalSubmissionRaw": 77645}, "1151": {"acRate": 60.65736847502821, "difficulty": "Medium", "likes": 1152, "dislikes": 14, "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": 59147, "totalSubmissionRaw": 97510}, "1152": {"acRate": 42.98386668405067, "difficulty": "Medium", "likes": 470, "dislikes": 3555, "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": 89014, "totalSubmissionRaw": 207087}, "1153": {"acRate": 35.11926404105125, "difficulty": "Hard", "likes": 861, "dislikes": 331, "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": 51193, "totalSubmissionRaw": 145769}, "1154": {"acRate": 48.82087597613619, "difficulty": "Easy", "likes": 400, "dislikes": 450, "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": 50327, "totalSubmissionRaw": 103086}, "1155": {"acRate": 54.59745649225981, "difficulty": "Medium", "likes": 4062, "dislikes": 126, "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": 193660, "totalSubmissionRaw": 354706}, "1156": {"acRate": 44.37087114897821, "difficulty": "Medium", "likes": 964, "dislikes": 86, "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": 28747, "totalSubmissionRaw": 64788}, "1157": {"acRate": 41.5641803758718, "difficulty": "Hard", "likes": 605, "dislikes": 58, "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": 15614, "totalSubmissionRaw": 37566}, "1158": {"acRate": 57.5425228461254, "difficulty": "Medium", "likes": 589, "dislikes": 63, "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": 87146, "totalSubmissionRaw": 151447}, "1159": {"acRate": 57.132459970887915, "difficulty": "Hard", "likes": 116, "dislikes": 48, "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": 17269, "totalSubmissionRaw": 30227}, "1160": {"acRate": 67.12645473039503, "difficulty": "Easy", "likes": 1409, "dislikes": 151, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 154754, "totalSubmissionRaw": 230541}, "1161": {"acRate": 67.3771845702859, "difficulty": "Medium", "likes": 3292, "dislikes": 96, "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": 222713, "totalSubmissionRaw": 330548}, "1162": {"acRate": 51.69393430358126, "difficulty": "Medium", "likes": 4046, "dislikes": 107, "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": 146482, "totalSubmissionRaw": 283364}, "1163": {"acRate": 34.6203156854915, "difficulty": "Hard", "likes": 567, "dislikes": 442, "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": 32944, "totalSubmissionRaw": 95158}, "1164": {"acRate": 57.487885349005055, "difficulty": "Medium", "likes": 640, "dislikes": 162, "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": 66909, "totalSubmissionRaw": 116388}, "1165": {"acRate": 86.73419000700497, "difficulty": "Easy", "likes": 497, "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": 75528, "totalSubmissionRaw": 87080}, "1166": {"acRate": 62.13442124546884, "difficulty": "Medium", "likes": 527, "dislikes": 57, "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": 47822, "totalSubmissionRaw": 76965}, "1167": {"acRate": 68.98751751208492, "difficulty": "Medium", "likes": 1251, "dislikes": 152, "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": 109319, "totalSubmissionRaw": 158462}, "1168": {"acRate": 64.66328637357299, "difficulty": "Hard", "likes": 1077, "dislikes": 39, "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": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42595, "totalSubmissionRaw": 65872}, "1169": {"acRate": 31.096066300922143, "difficulty": "Medium", "likes": 489, "dislikes": 2194, "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": 66600, "totalSubmissionRaw": 214174}, "1170": {"acRate": 61.78474446738972, "difficulty": "Medium", "likes": 665, "dislikes": 966, "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": 75994, "totalSubmissionRaw": 122998}, "1171": {"acRate": 43.328044667551005, "difficulty": "Medium", "likes": 2096, "dislikes": 89, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49975, "totalSubmissionRaw": 115341}, "1172": {"acRate": 32.76070981863665, "difficulty": "Hard", "likes": 456, "dislikes": 60, "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": 16763, "totalSubmissionRaw": 51168}, "1173": {"acRate": 81.10665789316265, "difficulty": "Easy", "likes": 275, "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": 67790, "totalSubmissionRaw": 83582}, "1174": {"acRate": 51.77952482984624, "difficulty": "Medium", "likes": 438, "dislikes": 81, "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": 65730, "totalSubmissionRaw": 126943}, "1175": {"acRate": 55.672637156730396, "difficulty": "Easy", "likes": 371, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27632, "totalSubmissionRaw": 49633}, "1176": {"acRate": 53.00249263539543, "difficulty": "Easy", "likes": 150, "dislikes": 283, "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": 30407, "totalSubmissionRaw": 57369}, "1177": {"acRate": 38.566563233179444, "difficulty": "Medium", "likes": 754, "dislikes": 269, "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": 25479, "totalSubmissionRaw": 66065}, "1178": {"acRate": 46.60960132216973, "difficulty": "Hard", "likes": 1235, "dislikes": 82, "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": 29894, "totalSubmissionRaw": 64136}, "1179": {"acRate": 78.70875860431997, "difficulty": "Easy", "likes": 681, "dislikes": 565, "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": 102796, "totalSubmissionRaw": 130603}, "1180": {"acRate": 79.34019066733568, "difficulty": "Easy", "likes": 341, "dislikes": 49, "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": 25300, "totalSubmissionRaw": 31888}, "1181": {"acRate": 45.388631090487245, "difficulty": "Medium", "likes": 72, "dislikes": 150, "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": 9390, "totalSubmissionRaw": 20688}, "1182": {"acRate": 55.35017130109154, "difficulty": "Medium", "likes": 502, "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": 34735, "totalSubmissionRaw": 62755}, "1183": {"acRate": 68.01829268292683, "difficulty": "Hard", "likes": 157, "dislikes": 25, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 4462, "totalSubmissionRaw": 6560}, "1184": {"acRate": 53.79548399220627, "difficulty": "Easy", "likes": 714, "dislikes": 79, "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": 54391, "totalSubmissionRaw": 101107}, "1185": {"acRate": 57.241473184770356, "difficulty": "Easy", "likes": 359, "dislikes": 2350, "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": 58874, "totalSubmissionRaw": 102852}, "1186": {"acRate": 42.45137593727401, "difficulty": "Medium", "likes": 1700, "dislikes": 58, "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": 44611, "totalSubmissionRaw": 105087}, "1187": {"acRate": 58.79875362630278, "difficulty": "Hard", "likes": 2142, "dislikes": 47, "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": 54723, "totalSubmissionRaw": 93069}, "1188": {"acRate": 72.6827868721807, "difficulty": "Medium", "likes": 504, "dislikes": 40, "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": 45599, "totalSubmissionRaw": 62737}, "1189": {"acRate": 60.28152056516581, "difficulty": "Easy", "likes": 1583, "dislikes": 90, "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": 170232, "totalSubmissionRaw": 282395}, "1190": {"acRate": 65.99758890898131, "difficulty": "Medium", "likes": 1780, "dislikes": 50, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 65694, "totalSubmissionRaw": 99540}, "1191": {"acRate": 23.570204542968607, "difficulty": "Medium", "likes": 1365, "dislikes": 109, "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": 32323, "totalSubmissionRaw": 137135}, "1192": {"acRate": 55.29471983038605, "difficulty": "Hard", "likes": 5914, "dislikes": 174, "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": 212815, "totalSubmissionRaw": 384872}, "1193": {"acRate": 59.75738991229059, "difficulty": "Medium", "likes": 536, "dislikes": 44, "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": 79509, "totalSubmissionRaw": 133053}, "1194": {"acRate": 49.284351145038165, "difficulty": "Hard", "likes": 145, "dislikes": 54, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18594, "totalSubmissionRaw": 37728}, "1195": {"acRate": 72.85289336238802, "difficulty": "Medium", "likes": 555, "dislikes": 382, "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": 42125, "totalSubmissionRaw": 57822}, "1196": {"acRate": 66.7504512944725, "difficulty": "Easy", "likes": 205, "dislikes": 16, "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": 29212, "totalSubmissionRaw": 43763}, "1197": {"acRate": 39.90966739127986, "difficulty": "Medium", "likes": 1439, "dislikes": 394, "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": 141732, "totalSubmissionRaw": 355132}, "1198": {"acRate": 76.51093329400052, "difficulty": "Medium", "likes": 553, "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": 41498, "totalSubmissionRaw": 54238}, "1199": {"acRate": 46.05348518705399, "difficulty": "Hard", "likes": 227, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"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": 6389, "totalSubmissionRaw": 13873}, "1200": {"acRate": 69.44519522850953, "difficulty": "Easy", "likes": 2247, "dislikes": 72, "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": 172147, "totalSubmissionRaw": 247889}, "1201": {"acRate": 29.234771560807882, "difficulty": "Medium", "likes": 1154, "dislikes": 488, "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": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28993, "totalSubmissionRaw": 99173}, "1202": {"acRate": 57.95247099597295, "difficulty": "Medium", "likes": 3535, "dislikes": 131, "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": 106348, "totalSubmissionRaw": 183509}, "1203": {"acRate": 67.32428775957862, "difficulty": "Hard", "likes": 1662, "dislikes": 277, "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": 51256, "totalSubmissionRaw": 76133}, "1204": {"acRate": 66.9497477121217, "difficulty": "Medium", "likes": 505, "dislikes": 24, "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": 61958, "totalSubmissionRaw": 92546}, "1205": {"acRate": 42.14060902511878, "difficulty": "Medium", "likes": 144, "dislikes": 527, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21021, "totalSubmissionRaw": 49883}, "1206": {"acRate": 60.5187229505112, "difficulty": "Hard", "likes": 626, "dislikes": 72, "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": 19297, "totalSubmissionRaw": 31886}, "1207": {"acRate": 74.23360810301169, "difficulty": "Easy", "likes": 4247, "dislikes": 101, "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": 358232, "totalSubmissionRaw": 482577}, "1208": {"acRate": 49.80823633334451, "difficulty": "Medium", "likes": 1067, "dislikes": 61, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44545, "totalSubmissionRaw": 89433}, "1209": {"acRate": 56.73406333045177, "difficulty": "Medium", "likes": 5490, "dislikes": 107, "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": 283516, "totalSubmissionRaw": 499728}, "1210": {"acRate": 49.28543624534282, "difficulty": "Hard", "likes": 264, "dislikes": 68, "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": 8863, "totalSubmissionRaw": 17983}, "1211": {"acRate": 64.16715111831839, "difficulty": "Easy", "likes": 387, "dislikes": 291, "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": 83887, "totalSubmissionRaw": 130732}, "1212": {"acRate": 56.19147589056617, "difficulty": "Medium", "likes": 288, "dislikes": 24, "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": 33724, "totalSubmissionRaw": 60017}, "1213": {"acRate": 79.85189878430286, "difficulty": "Easy", "likes": 566, "dislikes": 24, "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": 80660, "totalSubmissionRaw": 101012}, "1214": {"acRate": 67.0155666899597, "difficulty": "Medium", "likes": 529, "dislikes": 45, "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": 45074, "totalSubmissionRaw": 67259}, "1215": {"acRate": 46.5490918662806, "difficulty": "Medium", "likes": 177, "dislikes": 20, "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": 8842, "totalSubmissionRaw": 18995}, "1216": {"acRate": 50.18489684702219, "difficulty": "Hard", "likes": 667, "dislikes": 8, "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": 46411, "totalSubmissionRaw": 92482}, "1217": {"acRate": 71.76464254952627, "difficulty": "Easy", "likes": 2193, "dislikes": 286, "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": 119979, "totalSubmissionRaw": 167184}, "1218": {"acRate": 55.03344706455787, "difficulty": "Medium", "likes": 3062, "dislikes": 84, "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": 130973, "totalSubmissionRaw": 237988}, "1219": {"acRate": 63.65559576655435, "difficulty": "Medium", "likes": 2610, "dislikes": 64, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 107119, "totalSubmissionRaw": 168279}, "1220": {"acRate": 59.7665655629357, "difficulty": "Hard", "likes": 2594, "dislikes": 176, "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": 108967, "totalSubmissionRaw": 182321}, "1221": {"acRate": 85.57731139099927, "difficulty": "Easy", "likes": 2611, "dislikes": 905, "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": 271239, "totalSubmissionRaw": 316952}, "1222": {"acRate": 71.76315742026216, "difficulty": "Medium", "likes": 897, "dislikes": 144, "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": 39802, "totalSubmissionRaw": 55463}, "1223": {"acRate": 48.77538989227719, "difficulty": "Hard", "likes": 892, "dislikes": 187, "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": 27303, "totalSubmissionRaw": 55977}, "1224": {"acRate": 36.95629110969658, "difficulty": "Hard", "likes": 520, "dislikes": 56, "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": 13934, "totalSubmissionRaw": 37704}, "1225": {"acRate": 59.53833018235043, "difficulty": "Hard", "likes": 303, "dislikes": 22, "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": 19524, "totalSubmissionRaw": 32791}, "1226": {"acRate": 54.91242022772681, "difficulty": "Medium", "likes": 318, "dislikes": 307, "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": 28309, "totalSubmissionRaw": 51553}, "1227": {"acRate": 65.84454274623093, "difficulty": "Medium", "likes": 571, "dislikes": 932, "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": 36468, "totalSubmissionRaw": 55385}, "1228": {"acRate": 51.709961137246886, "difficulty": "Easy", "likes": 303, "dislikes": 42, "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": 25281, "totalSubmissionRaw": 48890}, "1229": {"acRate": 55.14336877943094, "difficulty": "Medium", "likes": 862, "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": 74829, "totalSubmissionRaw": 135699}, "1230": {"acRate": 56.08465608465608, "difficulty": "Medium", "likes": 376, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "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": 17066, "totalSubmissionRaw": 30429}, "1231": {"acRate": 58.03647762895412, "difficulty": "Hard", "likes": 935, "dislikes": 53, "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": 48876, "totalSubmissionRaw": 84216}, "1232": {"acRate": 39.75290362153, "difficulty": "Easy", "likes": 2502, "dislikes": 265, "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": 241095, "totalSubmissionRaw": 606484}, "1233": {"acRate": 65.73225869864359, "difficulty": "Medium", "likes": 768, "dislikes": 102, "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": 50157, "totalSubmissionRaw": 76305}, "1234": {"acRate": 37.69054314044694, "difficulty": "Medium", "likes": 1125, "dislikes": 198, "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": 30560, "totalSubmissionRaw": 81083}, "1235": {"acRate": 53.38729567688648, "difficulty": "Hard", "likes": 5469, "dislikes": 64, "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": 200441, "totalSubmissionRaw": 375446}, "1236": {"acRate": 67.61850043091066, "difficulty": "Medium", "likes": 275, "dislikes": 311, "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": 35307, "totalSubmissionRaw": 52215}, "1237": {"acRate": 69.38704733350487, "difficulty": "Medium", "likes": 484, "dislikes": 1390, "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": 62023, "totalSubmissionRaw": 89387}, "1238": {"acRate": 69.34523809523809, "difficulty": "Medium", "likes": 392, "dislikes": 182, "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": 16077, "totalSubmissionRaw": 23184}, "1239": {"acRate": 52.162626521349985, "difficulty": "Medium", "likes": 3569, "dislikes": 243, "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": 181249, "totalSubmissionRaw": 347469}, "1240": {"acRate": 54.10730670787657, "difficulty": "Hard", "likes": 651, "dislikes": 556, "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": 22408, "totalSubmissionRaw": 41414}, "1241": {"acRate": 65.47928513403737, "difficulty": "Easy", "likes": 165, "dislikes": 519, "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": 32241, "totalSubmissionRaw": 49239}, "1242": {"acRate": 48.66772378198551, "difficulty": "Medium", "likes": 501, "dislikes": 84, "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": 46959, "totalSubmissionRaw": 96489}, "1243": {"acRate": 51.61477791614778, "difficulty": "Easy", "likes": 144, "dislikes": 66, "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": 12434, "totalSubmissionRaw": 24090}, "1244": {"acRate": 68.12332742056209, "difficulty": "Medium", "likes": 737, "dislikes": 93, "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": 66440, "totalSubmissionRaw": 97529}, "1245": {"acRate": 61.14404834761322, "difficulty": "Medium", "likes": 756, "dislikes": 17, "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": 31971, "totalSubmissionRaw": 52288}, "1246": {"acRate": 46.60635520748942, "difficulty": "Hard", "likes": 306, "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": 10355, "totalSubmissionRaw": 22218}, "1247": {"acRate": 64.32793442740049, "difficulty": "Medium", "likes": 1285, "dislikes": 234, "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": 36023, "totalSubmissionRaw": 55999}, "1248": {"acRate": 63.45054835119487, "difficulty": "Medium", "likes": 3474, "dislikes": 72, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 101479, "totalSubmissionRaw": 159934}, "1249": {"acRate": 66.29374289626364, "difficulty": "Medium", "likes": 5916, "dislikes": 109, "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": 524351, "totalSubmissionRaw": 790952}, "1250": {"acRate": 58.97239940037036, "difficulty": "Hard", "likes": 463, "dislikes": 361, "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": 20063, "totalSubmissionRaw": 34021}, "1251": {"acRate": 60.39384251672353, "difficulty": "Easy", "likes": 757, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112396, "totalSubmissionRaw": 186089}, "1252": {"acRate": 78.46293651823964, "difficulty": "Easy", "likes": 1119, "dislikes": 1460, "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": 102748, "totalSubmissionRaw": 130951}, "1253": {"acRate": 45.10915158181242, "difficulty": "Medium", "likes": 424, "dislikes": 28, "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": 24196, "totalSubmissionRaw": 53640}, "1254": {"acRate": 66.56908797235127, "difficulty": "Medium", "likes": 4370, "dislikes": 150, "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": 206482, "totalSubmissionRaw": 310177}, "1255": {"acRate": 72.43484386006105, "difficulty": "Hard", "likes": 1161, "dislikes": 53, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 33935, "totalSubmissionRaw": 46849}, "1256": {"acRate": 69.54050213169114, "difficulty": "Medium", "likes": 74, "dislikes": 243, "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": 7340, "totalSubmissionRaw": 10555}, "1257": {"acRate": 64.64335664335664, "difficulty": "Medium", "likes": 417, "dislikes": 33, "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": 20799, "totalSubmissionRaw": 32175}, "1258": {"acRate": 56.371863430686965, "difficulty": "Medium", "likes": 332, "dislikes": 155, "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": 20556, "totalSubmissionRaw": 36465}, "1259": {"acRate": 60.692008944333296, "difficulty": "Hard", "likes": 217, "dislikes": 16, "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": 10314, "totalSubmissionRaw": 16994}, "1260": {"acRate": 67.44631488075969, "difficulty": "Easy", "likes": 1681, "dislikes": 334, "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": 100004, "totalSubmissionRaw": 148272}, "1261": {"acRate": 76.69493176122272, "difficulty": "Medium", "likes": 937, "dislikes": 92, "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": 59062, "totalSubmissionRaw": 77009}, "1262": {"acRate": 50.720537081545935, "difficulty": "Medium", "likes": 1708, "dislikes": 41, "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": 50014, "totalSubmissionRaw": 98607}, "1263": {"acRate": 49.09234411996843, "difficulty": "Hard", "likes": 820, "dislikes": 56, "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": 26746, "totalSubmissionRaw": 54481}, "1264": {"acRate": 65.78816243727088, "difficulty": "Medium", "likes": 234, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36966, "totalSubmissionRaw": 56187}, "1265": {"acRate": 94.2005710206995, "difficulty": "Medium", "likes": 555, "dislikes": 100, "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": 52790, "totalSubmissionRaw": 56040}, "1266": {"acRate": 79.05263274434259, "difficulty": "Easy", "likes": 1542, "dislikes": 182, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 142807, "totalSubmissionRaw": 180648}, "1267": {"acRate": 59.98147441835122, "difficulty": "Medium", "likes": 1238, "dislikes": 80, "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": 55042, "totalSubmissionRaw": 91765}, "1268": {"acRate": 65.78634113299266, "difficulty": "Medium", "likes": 4409, "dislikes": 212, "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": 264169, "totalSubmissionRaw": 401556}, "1269": {"acRate": 50.58896160019756, "difficulty": "Hard", "likes": 1419, "dislikes": 61, "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": 81711, "totalSubmissionRaw": 161571}, "1270": {"acRate": 85.76276996914638, "difficulty": "Medium", "likes": 402, "dislikes": 26, "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": 50034, "totalSubmissionRaw": 58340}, "1271": {"acRate": 57.287844036697244, "difficulty": "Easy", "likes": 70, "dislikes": 123, "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": 9991, "totalSubmissionRaw": 17440}, "1272": {"acRate": 64.18521698923311, "difficulty": "Medium", "likes": 417, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 29150, "totalSubmissionRaw": 45415}, "1273": {"acRate": 61.224999999999994, "difficulty": "Medium", "likes": 218, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9796, "totalSubmissionRaw": 16000}, "1274": {"acRate": 68.8019222412515, "difficulty": "Hard", "likes": 513, "dislikes": 55, "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": 26915, "totalSubmissionRaw": 39120}, "1275": {"acRate": 54.09168147061095, "difficulty": "Easy", "likes": 1385, "dislikes": 318, "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": 112052, "totalSubmissionRaw": 207152}, "1276": {"acRate": 50.902755090928885, "difficulty": "Medium", "likes": 307, "dislikes": 224, "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": 23372, "totalSubmissionRaw": 45915}, "1277": {"acRate": 74.83078628154428, "difficulty": "Medium", "likes": 4663, "dislikes": 73, "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": 207957, "totalSubmissionRaw": 277903}, "1278": {"acRate": 60.71133753154555, "difficulty": "Hard", "likes": 1083, "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": 25741, "totalSubmissionRaw": 42398}, "1279": {"acRate": 73.2922664064406, "difficulty": "Easy", "likes": 69, "dislikes": 334, "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": 12017, "totalSubmissionRaw": 16396}, "1280": {"acRate": 57.1914181920861, "difficulty": "Easy", "likes": 1095, "dislikes": 131, "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": 105322, "totalSubmissionRaw": 184157}, "1281": {"acRate": 86.36933759000732, "difficulty": "Easy", "likes": 2414, "dislikes": 222, "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": 433129, "totalSubmissionRaw": 501485}, "1282": {"acRate": 87.7788650627123, "difficulty": "Medium", "likes": 2819, "dislikes": 665, "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": 186580, "totalSubmissionRaw": 212557}, "1283": {"acRate": 58.14376860189925, "difficulty": "Medium", "likes": 2615, "dislikes": 180, "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": 137335, "totalSubmissionRaw": 236199}, "1284": {"acRate": 71.99701276575883, "difficulty": "Hard", "likes": 924, "dislikes": 88, "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": "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": 30850, "totalSubmissionRaw": 42849}, "1285": {"acRate": 83.76965919964668, "difficulty": "Medium", "likes": 530, "dislikes": 31, "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": 34142, "totalSubmissionRaw": 40757}, "1286": {"acRate": 73.25492335617085, "difficulty": "Medium", "likes": 1339, "dislikes": 102, "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": 69820, "totalSubmissionRaw": 95311}, "1287": {"acRate": 59.07229326157547, "difficulty": "Easy", "likes": 902, "dislikes": 45, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 84956, "totalSubmissionRaw": 143817}, "1288": {"acRate": 56.65821513744195, "difficulty": "Medium", "likes": 2166, "dislikes": 57, "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": 112849, "totalSubmissionRaw": 199171}, "1289": {"acRate": 58.04509949903467, "difficulty": "Hard", "likes": 1550, "dislikes": 79, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 45998, "totalSubmissionRaw": 79246}, "1290": {"acRate": 81.45410355050197, "difficulty": "Easy", "likes": 3974, "dislikes": 148, "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": 420932, "totalSubmissionRaw": 516772}, "1291": {"acRate": 61.33404518001936, "difficulty": "Medium", "likes": 1940, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91905, "totalSubmissionRaw": 149844}, "1292": {"acRate": 53.34809730698359, "difficulty": "Medium", "likes": 1046, "dislikes": 87, "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": 31557, "totalSubmissionRaw": 59153}, "1293": {"acRate": 45.165215785523706, "difficulty": "Hard", "likes": 4335, "dislikes": 78, "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": 190772, "totalSubmissionRaw": 422387}, "1294": {"acRate": 66.64692049473136, "difficulty": "Easy", "likes": 132, "dislikes": 27, "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": 37127, "totalSubmissionRaw": 55707}, "1295": {"acRate": 77.02194740568319, "difficulty": "Easy", "likes": 2203, "dislikes": 116, "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": 604878, "totalSubmissionRaw": 785332}, "1296": {"acRate": 56.61563916159687, "difficulty": "Medium", "likes": 1649, "dislikes": 105, "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": 77332, "totalSubmissionRaw": 136592}, "1297": {"acRate": 51.81796618210159, "difficulty": "Medium", "likes": 982, "dislikes": 390, "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": 45871, "totalSubmissionRaw": 88527}, "1298": {"acRate": 58.35785400459511, "difficulty": "Hard", "likes": 314, "dislikes": 141, "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": 14478, "totalSubmissionRaw": 24809}, "1299": {"acRate": 71.72989128791642, "difficulty": "Easy", "likes": 2371, "dislikes": 231, "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": 332151, "totalSubmissionRaw": 463058}, "1300": {"acRate": 43.99642466977853, "difficulty": "Medium", "likes": 1087, "dislikes": 141, "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": 35440, "totalSubmissionRaw": 80552}, "1301": {"acRate": 38.933350406556116, "difficulty": "Hard", "likes": 482, "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": 12162, "totalSubmissionRaw": 31238}, "1302": {"acRate": 86.35639802178359, "difficulty": "Medium", "likes": 4522, "dislikes": 116, "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": 297717, "totalSubmissionRaw": 344753}, "1303": {"acRate": 89.60129534037281, "difficulty": "Easy", "likes": 317, "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": 64745, "totalSubmissionRaw": 72259}, "1304": {"acRate": 76.51384597670268, "difficulty": "Easy", "likes": 1885, "dislikes": 576, "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": 199353, "totalSubmissionRaw": 260545}, "1305": {"acRate": 79.83562493538716, "difficulty": "Medium", "likes": 2960, "dislikes": 87, "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": 200785, "totalSubmissionRaw": 251498}, "1306": {"acRate": 64.230408040151, "difficulty": "Medium", "likes": 3966, "dislikes": 94, "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": 206556, "totalSubmissionRaw": 321586}, "1307": {"acRate": 34.10884195869111, "difficulty": "Hard", "likes": 474, "dislikes": 120, "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": 11758, "totalSubmissionRaw": 34472}, "1308": {"acRate": 86.59914296844565, "difficulty": "Medium", "likes": 204, "dislikes": 59, "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": 37791, "totalSubmissionRaw": 43639}, "1309": {"acRate": 79.58827561852137, "difficulty": "Easy", "likes": 1471, "dislikes": 104, "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": 114939, "totalSubmissionRaw": 144417}, "1310": {"acRate": 72.25668538854892, "difficulty": "Medium", "likes": 1415, "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": 51717, "totalSubmissionRaw": 71574}, "1311": {"acRate": 46.49508973924822, "difficulty": "Medium", "likes": 335, "dislikes": 400, "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": 20595, "totalSubmissionRaw": 44295}, "1312": {"acRate": 69.89783993299702, "difficulty": "Hard", "likes": 4701, "dislikes": 60, "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": 143545, "totalSubmissionRaw": 205364}, "1313": {"acRate": 85.58748243943144, "difficulty": "Easy", "likes": 1180, "dislikes": 1297, "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": 243083, "totalSubmissionRaw": 284017}, "1314": {"acRate": 75.56000627613132, "difficulty": "Medium", "likes": 2309, "dislikes": 353, "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": 81867, "totalSubmissionRaw": 108347}, "1315": {"acRate": 85.48347432618533, "difficulty": "Medium", "likes": 2626, "dislikes": 74, "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": 139043, "totalSubmissionRaw": 162655}, "1316": {"acRate": 49.79925009124996, "difficulty": "Hard", "likes": 300, "dislikes": 199, "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": 15008, "totalSubmissionRaw": 30137}, "1317": {"acRate": 54.487877158704975, "difficulty": "Easy", "likes": 391, "dislikes": 298, "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": 41553, "totalSubmissionRaw": 76261}, "1318": {"acRate": 71.28082234975089, "difficulty": "Medium", "likes": 1826, "dislikes": 94, "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": 101727, "totalSubmissionRaw": 142713}, "1319": {"acRate": 62.42121959019651, "difficulty": "Medium", "likes": 4719, "dislikes": 65, "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": 193233, "totalSubmissionRaw": 309563}, "1320": {"acRate": 59.23321142949002, "difficulty": "Hard", "likes": 963, "dislikes": 34, "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": 29478, "totalSubmissionRaw": 49766}, "1321": {"acRate": 48.366759839226326, "difficulty": "Medium", "likes": 579, "dislikes": 200, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47410, "totalSubmissionRaw": 98024}, "1322": {"acRate": 59.91168193055836, "difficulty": "Easy", "likes": 243, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38531, "totalSubmissionRaw": 64313}, "1323": {"acRate": 82.02358041588795, "difficulty": "Easy", "likes": 2670, "dislikes": 209, "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": 236118, "totalSubmissionRaw": 287866}, "1324": {"acRate": 62.562528029806465, "difficulty": "Medium", "likes": 727, "dislikes": 111, "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": 36270, "totalSubmissionRaw": 57974}, "1325": {"acRate": 74.36234427506749, "difficulty": "Medium", "likes": 2122, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 94490, "totalSubmissionRaw": 127067}, "1326": {"acRate": 51.498195022599425, "difficulty": "Hard", "likes": 3205, "dislikes": 176, "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": 121114, "totalSubmissionRaw": 235182}, "1327": {"acRate": 70.71851111834498, "difficulty": "Easy", "likes": 258, "dislikes": 33, "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": 63000, "totalSubmissionRaw": 89086}, "1328": {"acRate": 52.022822442068026, "difficulty": "Medium", "likes": 2230, "dislikes": 727, "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": 155915, "totalSubmissionRaw": 299705}, "1329": {"acRate": 83.01893941444246, "difficulty": "Medium", "likes": 3262, "dislikes": 221, "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": 153375, "totalSubmissionRaw": 184747}, "1330": {"acRate": 41.37446310035143, "difficulty": "Hard", "likes": 457, "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": 5298, "totalSubmissionRaw": 12805}, "1331": {"acRate": 59.92118533113827, "difficulty": "Easy", "likes": 1557, "dislikes": 73, "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": 92450, "totalSubmissionRaw": 154286}, "1332": {"acRate": 76.28014096511536, "difficulty": "Easy", "likes": 1597, "dislikes": 1718, "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": 126191, "totalSubmissionRaw": 165431}, "1333": {"acRate": 60.68292043518154, "difficulty": "Medium", "likes": 281, "dislikes": 209, "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": 27777, "totalSubmissionRaw": 45774}, "1334": {"acRate": 58.036338734118196, "difficulty": "Medium", "likes": 2415, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 79662, "totalSubmissionRaw": 137263}, "1335": {"acRate": 58.31789517873276, "difficulty": "Hard", "likes": 2649, "dislikes": 239, "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": 127806, "totalSubmissionRaw": 219154}, "1336": {"acRate": 47.93433537660593, "difficulty": "Hard", "likes": 88, "dislikes": 304, "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": 11417, "totalSubmissionRaw": 23818}, "1337": {"acRate": 73.44380088105346, "difficulty": "Easy", "likes": 4019, "dislikes": 226, "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": 338936, "totalSubmissionRaw": 461491}, "1338": {"acRate": 69.1082400229687, "difficulty": "Medium", "likes": 3159, "dislikes": 146, "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": 180528, "totalSubmissionRaw": 261225}, "1339": {"acRate": 47.72496864443794, "difficulty": "Medium", "likes": 2931, "dislikes": 101, "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": 119101, "totalSubmissionRaw": 249557}, "1340": {"acRate": 62.80834091992891, "difficulty": "Hard", "likes": 1059, "dislikes": 37, "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": 28976, "totalSubmissionRaw": 46134}, "1341": {"acRate": 42.08975959762939, "difficulty": "Medium", "likes": 367, "dislikes": 136, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47867, "totalSubmissionRaw": 113726}, "1342": {"acRate": 84.84492872675959, "difficulty": "Easy", "likes": 3732, "dislikes": 164, "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": 585621, "totalSubmissionRaw": 690226}, "1343": {"acRate": 68.16056910569105, "difficulty": "Medium", "likes": 1441, "dislikes": 94, "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": 73777, "totalSubmissionRaw": 108240}, "1344": {"acRate": 63.38680664758522, "difficulty": "Medium", "likes": 1258, "dislikes": 233, "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": 112059, "totalSubmissionRaw": 176786}, "1345": {"acRate": 46.56566073850688, "difficulty": "Hard", "likes": 3618, "dislikes": 125, "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": 135263, "totalSubmissionRaw": 290478}, "1346": {"acRate": 36.76679049472257, "difficulty": "Easy", "likes": 1815, "dislikes": 187, "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": 311764, "totalSubmissionRaw": 847943}, "1347": {"acRate": 78.12758397210986, "difficulty": "Medium", "likes": 1957, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 139836, "totalSubmissionRaw": 178984}, "1348": {"acRate": 44.119856557667504, "difficulty": "Medium", "likes": 178, "dislikes": 275, "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": 31127, "totalSubmissionRaw": 70551}, "1349": {"acRate": 49.83263884145092, "difficulty": "Hard", "likes": 785, "dislikes": 15, "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": 14590, "totalSubmissionRaw": 29278}, "1350": {"acRate": 89.70140051087819, "difficulty": "Easy", "likes": 171, "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": 50919, "totalSubmissionRaw": 56765}, "1351": {"acRate": 77.27821401984329, "difficulty": "Easy", "likes": 4744, "dislikes": 124, "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": 367478, "totalSubmissionRaw": 475526}, "1352": {"acRate": 50.2592227316345, "difficulty": "Medium", "likes": 1383, "dislikes": 66, "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": 75421, "totalSubmissionRaw": 150064}, "1353": {"acRate": 32.17496420924083, "difficulty": "Medium", "likes": 2837, "dislikes": 376, "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": 77986, "totalSubmissionRaw": 242381}, "1354": {"acRate": 36.217641418983696, "difficulty": "Hard", "likes": 2015, "dislikes": 161, "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": 64973, "totalSubmissionRaw": 179396}, "1355": {"acRate": 73.07995970705943, "difficulty": "Medium", "likes": 135, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26843, "totalSubmissionRaw": 36731}, "1356": {"acRate": 73.7070821302074, "difficulty": "Easy", "likes": 1830, "dislikes": 92, "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": 128396, "totalSubmissionRaw": 174198}, "1357": {"acRate": 70.18644805571678, "difficulty": "Medium", "likes": 173, "dislikes": 216, "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": 19349, "totalSubmissionRaw": 27568}, "1358": {"acRate": 64.60046709862688, "difficulty": "Medium", "likes": 2826, "dislikes": 45, "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": 71087, "totalSubmissionRaw": 110041}, "1359": {"acRate": 65.43719705785983, "difficulty": "Hard", "likes": 2940, "dislikes": 217, "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": 115833, "totalSubmissionRaw": 177014}, "1360": {"acRate": 48.959886790398954, "difficulty": "Easy", "likes": 336, "dislikes": 1224, "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": 44977, "totalSubmissionRaw": 91865}, "1361": {"acRate": 39.258460657311794, "difficulty": "Medium", "likes": 1232, "dislikes": 329, "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": 46610, "totalSubmissionRaw": 118726}, "1362": {"acRate": 60.315241635687734, "difficulty": "Medium", "likes": 297, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20281, "totalSubmissionRaw": 33625}, "1363": {"acRate": 32.88318465498396, "difficulty": "Hard", "likes": 569, "dislikes": 78, "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": 18652, "totalSubmissionRaw": 56722}, "1364": {"acRate": 76.25781545046368, "difficulty": "Medium", "likes": 86, "dislikes": 371, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 18173, "totalSubmissionRaw": 23831}, "1365": {"acRate": 86.52942109776251, "difficulty": "Easy", "likes": 5124, "dislikes": 110, "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": 485379, "totalSubmissionRaw": 560941}, "1366": {"acRate": 57.91270285394516, "difficulty": "Medium", "likes": 1317, "dislikes": 147, "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": 62092, "totalSubmissionRaw": 107217}, "1367": {"acRate": 43.78346965938275, "difficulty": "Medium", "likes": 2119, "dislikes": 65, "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": 70068, "totalSubmissionRaw": 160033}, "1368": {"acRate": 61.80004275636001, "difficulty": "Hard", "likes": 1642, "dislikes": 18, "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": 43362, "totalSubmissionRaw": 70165}, "1369": {"acRate": 68.00911854103343, "difficulty": "Hard", "likes": 157, "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": 19690, "totalSubmissionRaw": 28952}, "1370": {"acRate": 76.42075078206464, "difficulty": "Easy", "likes": 727, "dislikes": 825, "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": 70356, "totalSubmissionRaw": 92064}, "1371": {"acRate": 63.66014087424902, "difficulty": "Medium", "likes": 1548, "dislikes": 58, "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": 24583, "totalSubmissionRaw": 38616}, "1372": {"acRate": 66.52832604288915, "difficulty": "Medium", "likes": 3148, "dislikes": 64, "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": 124711, "totalSubmissionRaw": 187456}, "1373": {"acRate": 40.30689044647653, "difficulty": "Hard", "likes": 2412, "dislikes": 166, "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": 60784, "totalSubmissionRaw": 150803}, "1374": {"acRate": 77.5821831640746, "difficulty": "Easy", "likes": 453, "dislikes": 1241, "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": 85103, "totalSubmissionRaw": 109694}, "1375": {"acRate": 65.83435812436508, "difficulty": "Medium", "likes": 909, "dislikes": 127, "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": 49252, "totalSubmissionRaw": 74812}, "1376": {"acRate": 60.14875679638341, "difficulty": "Medium", "likes": 3900, "dislikes": 269, "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": 196915, "totalSubmissionRaw": 327380}, "1377": {"acRate": 35.52979830245505, "difficulty": "Hard", "likes": 746, "dislikes": 137, "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": 27251, "totalSubmissionRaw": 76699}, "1378": {"acRate": 83.24311199348693, "difficulty": "Easy", "likes": 719, "dislikes": 69, "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": 174841, "totalSubmissionRaw": 210031}, "1379": {"acRate": 86.08756506507544, "difficulty": "Easy", "likes": 1662, "dislikes": 1942, "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": 207892, "totalSubmissionRaw": 241489}, "1380": {"acRate": 70.920420126279, "difficulty": "Easy", "likes": 1586, "dislikes": 80, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 94127, "totalSubmissionRaw": 132722}, "1381": {"acRate": 77.09417095086269, "difficulty": "Medium", "likes": 1718, "dislikes": 91, "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": 101072, "totalSubmissionRaw": 131102}, "1382": {"acRate": 81.05186824453155, "difficulty": "Medium", "likes": 2882, "dislikes": 68, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 129653, "totalSubmissionRaw": 159963}, "1383": {"acRate": 48.04816500301431, "difficulty": "Hard", "likes": 2989, "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": 90061, "totalSubmissionRaw": 187439}, "1384": {"acRate": 62.35903814262023, "difficulty": "Hard", "likes": 213, "dislikes": 125, "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": 15041, "totalSubmissionRaw": 24120}, "1385": {"acRate": 67.37851966258762, "difficulty": "Easy", "likes": 833, "dislikes": 2915, "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": 90740, "totalSubmissionRaw": 134672}, "1386": {"acRate": 41.37053082411455, "difficulty": "Medium", "likes": 808, "dislikes": 374, "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": 41922, "totalSubmissionRaw": 101333}, "1387": {"acRate": 69.91867214396194, "difficulty": "Medium", "likes": 1369, "dislikes": 109, "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": 84076, "totalSubmissionRaw": 120250}, "1388": {"acRate": 51.156667774341145, "difficulty": "Hard", "likes": 996, "dislikes": 16, "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": 20013, "totalSubmissionRaw": 39121}, "1389": {"acRate": 85.74331042234039, "difficulty": "Easy", "likes": 1852, "dislikes": 1783, "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": 218185, "totalSubmissionRaw": 254463}, "1390": {"acRate": 41.60633418904497, "difficulty": "Medium", "likes": 373, "dislikes": 182, "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": 28849, "totalSubmissionRaw": 69338}, "1391": {"acRate": 47.63972570518736, "difficulty": "Medium", "likes": 778, "dislikes": 305, "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": 26330, "totalSubmissionRaw": 55269}, "1392": {"acRate": 44.991620471831894, "difficulty": "Hard", "likes": 1232, "dislikes": 34, "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": 34900, "totalSubmissionRaw": 77570}, "1393": {"acRate": 85.73965837524354, "difficulty": "Medium", "likes": 754, "dislikes": 43, "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": 94617, "totalSubmissionRaw": 110354}, "1394": {"acRate": 65.61282663269975, "difficulty": "Easy", "likes": 1069, "dislikes": 29, "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": 106113, "totalSubmissionRaw": 161726}, "1395": {"acRate": 66.28792647614252, "difficulty": "Medium", "likes": 2594, "dislikes": 182, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105305, "totalSubmissionRaw": 158860}, "1396": {"acRate": 74.7660753050378, "difficulty": "Medium", "likes": 3407, "dislikes": 165, "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": 219735, "totalSubmissionRaw": 293897}, "1397": {"acRate": 42.00228506141103, "difficulty": "Hard", "likes": 459, "dislikes": 124, "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": 5882, "totalSubmissionRaw": 14004}, "1398": {"acRate": 73.97504456327985, "difficulty": "Medium", "likes": 281, "dislikes": 15, "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": 44820, "totalSubmissionRaw": 60588}, "1399": {"acRate": 66.64997253546157, "difficulty": "Easy", "likes": 412, "dislikes": 924, "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": 41255, "totalSubmissionRaw": 61898}, "1400": {"acRate": 62.36886982584879, "difficulty": "Medium", "likes": 1005, "dislikes": 88, "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": 48276, "totalSubmissionRaw": 77404}, "1401": {"acRate": 44.81810561609388, "difficulty": "Medium", "likes": 315, "dislikes": 70, "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": 13367, "totalSubmissionRaw": 29825}, "1402": {"acRate": 76.38028466954762, "difficulty": "Hard", "likes": 3114, "dislikes": 291, "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": 126375, "totalSubmissionRaw": 165455}, "1403": {"acRate": 72.40103307578782, "difficulty": "Easy", "likes": 547, "dislikes": 483, "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": 66719, "totalSubmissionRaw": 92152}, "1404": {"acRate": 52.755565782661215, "difficulty": "Medium", "likes": 747, "dislikes": 57, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 36680, "totalSubmissionRaw": 69530}, "1405": {"acRate": 57.271508255774286, "difficulty": "Medium", "likes": 1899, "dislikes": 237, "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": 72181, "totalSubmissionRaw": 126033}, "1406": {"acRate": 64.634998524776, "difficulty": "Hard", "likes": 2096, "dislikes": 68, "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": 83246, "totalSubmissionRaw": 128794}, "1407": {"acRate": 58.744405224352725, "difficulty": "Easy", "likes": 574, "dislikes": 60, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99355, "totalSubmissionRaw": 169131}, "1408": {"acRate": 63.74744916775257, "difficulty": "Easy", "likes": 848, "dislikes": 85, "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": 77784, "totalSubmissionRaw": 122019}, "1409": {"acRate": 83.8138557164344, "difficulty": "Medium", "likes": 459, "dislikes": 610, "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": 46250, "totalSubmissionRaw": 55179}, "1410": {"acRate": 51.117052612498306, "difficulty": "Medium", "likes": 176, "dislikes": 316, "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": 22560, "totalSubmissionRaw": 44134}, "1411": {"acRate": 63.254524108335694, "difficulty": "Hard", "likes": 1038, "dislikes": 48, "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": 31249, "totalSubmissionRaw": 49402}, "1412": {"acRate": 60.109390202214094, "difficulty": "Hard", "likes": 198, "dislikes": 18, "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": 22859, "totalSubmissionRaw": 38029}, "1413": {"acRate": 66.45508088492974, "difficulty": "Easy", "likes": 1484, "dislikes": 305, "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": 117571, "totalSubmissionRaw": 176918}, "1414": {"acRate": 65.20886222017079, "difficulty": "Medium", "likes": 975, "dislikes": 62, "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": 39557, "totalSubmissionRaw": 60662}, "1415": {"acRate": 73.44202668696737, "difficulty": "Medium", "likes": 918, "dislikes": 24, "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": 34730, "totalSubmissionRaw": 47289}, "1416": {"acRate": 48.3410190079856, "difficulty": "Hard", "likes": 1529, "dislikes": 51, "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": 55874, "totalSubmissionRaw": 115583}, "1417": {"acRate": 53.50860525815775, "difficulty": "Easy", "likes": 558, "dislikes": 99, "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": 53507, "totalSubmissionRaw": 99997}, "1418": {"acRate": 74.40603800182079, "difficulty": "Medium", "likes": 351, "dislikes": 460, "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": 25336, "totalSubmissionRaw": 34051}, "1419": {"acRate": 50.17896074522285, "difficulty": "Medium", "likes": 979, "dislikes": 76, "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": 43039, "totalSubmissionRaw": 85772}, "1420": {"acRate": 69.95253183194149, "difficulty": "Hard", "likes": 1266, "dislikes": 83, "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": 59388, "totalSubmissionRaw": 84897}, "1421": {"acRate": 82.7006068779501, "difficulty": "Easy", "likes": 52, "dislikes": 291, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24529, "totalSubmissionRaw": 29660}, "1422": {"acRate": 57.920359651063926, "difficulty": "Easy", "likes": 641, "dislikes": 37, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49731, "totalSubmissionRaw": 85861}, "1423": {"acRate": 52.25972339230553, "difficulty": "Medium", "likes": 5751, "dislikes": 206, "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": 238204, "totalSubmissionRaw": 455808}, "1424": {"acRate": 50.60325908860709, "difficulty": "Medium", "likes": 1097, "dislikes": 88, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 50959, "totalSubmissionRaw": 100703}, "1425": {"acRate": 47.80124403298134, "difficulty": "Hard", "likes": 1209, "dislikes": 54, "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": 26436, "totalSubmissionRaw": 55304}, "1426": {"acRate": 59.86399345955809, "difficulty": "Easy", "likes": 141, "dislikes": 40, "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": 110567, "totalSubmissionRaw": 184697}, "1427": {"acRate": 54.483829967518716, "difficulty": "Easy", "likes": 222, "dislikes": 6, "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": 77160, "totalSubmissionRaw": 141620}, "1428": {"acRate": 53.636282656554215, "difficulty": "Medium", "likes": 1163, "dislikes": 133, "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": 168596, "totalSubmissionRaw": 314332}, "1429": {"acRate": 53.29826220593451, "difficulty": "Medium", "likes": 528, "dislikes": 30, "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": 81153, "totalSubmissionRaw": 152262}, "1430": {"acRate": 46.620256972197154, "difficulty": "Medium", "likes": 206, "dislikes": 13, "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": 43396, "totalSubmissionRaw": 93084}, "1431": {"acRate": 87.29352369786388, "difficulty": "Easy", "likes": 3965, "dislikes": 476, "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": 637330, "totalSubmissionRaw": 730101}, "1432": {"acRate": 41.03137323855216, "difficulty": "Medium", "likes": 216, "dislikes": 274, "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": 16335, "totalSubmissionRaw": 39811}, "1433": {"acRate": 69.24958783172897, "difficulty": "Medium", "likes": 720, "dislikes": 135, "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": 39063, "totalSubmissionRaw": 56409}, "1434": {"acRate": 43.90458787443713, "difficulty": "Hard", "likes": 857, "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": 13455, "totalSubmissionRaw": 30646}, "1435": {"acRate": 75.72922595332953, "difficulty": "Easy", "likes": 144, "dislikes": 256, "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": 21289, "totalSubmissionRaw": 28112}, "1436": {"acRate": 77.08488668971283, "difficulty": "Easy", "likes": 1421, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 136468, "totalSubmissionRaw": 177036}, "1437": {"acRate": 58.08383233532935, "difficulty": "Easy", "likes": 601, "dislikes": 219, "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": 71683, "totalSubmissionRaw": 123413}, "1438": {"acRate": 48.811592275141955, "difficulty": "Medium", "likes": 3147, "dislikes": 133, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 117428, "totalSubmissionRaw": 240574}, "1439": {"acRate": 61.38690784493406, "difficulty": "Hard", "likes": 1179, "dislikes": 15, "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": 30815, "totalSubmissionRaw": 50198}, "1440": {"acRate": 73.41510845175767, "difficulty": "Medium", "likes": 198, "dislikes": 15, "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": 24539, "totalSubmissionRaw": 33425}, "1441": {"acRate": 72.50792484035466, "difficulty": "Medium", "likes": 290, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 78914, "totalSubmissionRaw": 108835}, "1442": {"acRate": 76.64574386080828, "difficulty": "Medium", "likes": 1307, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 34801, "totalSubmissionRaw": 45405}, "1443": {"acRate": 62.35083954343929, "difficulty": "Medium", "likes": 3474, "dislikes": 300, "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": 105757, "totalSubmissionRaw": 169616}, "1444": {"acRate": 62.92893050572231, "difficulty": "Hard", "likes": 1745, "dislikes": 92, "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": 64717, "totalSubmissionRaw": 102842}, "1445": {"acRate": 88.51458885941645, "difficulty": "Medium", "likes": 229, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46716, "totalSubmissionRaw": 52778}, "1446": {"acRate": 60.56268728347711, "difficulty": "Easy", "likes": 1650, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150166, "totalSubmissionRaw": 247951}, "1447": {"acRate": 65.83930745299608, "difficulty": "Medium", "likes": 390, "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": 29204, "totalSubmissionRaw": 44357}, "1448": {"acRate": 73.43291589763159, "difficulty": "Medium", "likes": 5403, "dislikes": 140, "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": 388710, "totalSubmissionRaw": 529340}, "1449": {"acRate": 47.76584381675765, "difficulty": "Hard", "likes": 662, "dislikes": 15, "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": 16099, "totalSubmissionRaw": 33704}, "1450": {"acRate": 75.56642305113218, "difficulty": "Easy", "likes": 833, "dislikes": 150, "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": 111564, "totalSubmissionRaw": 147637}, "1451": {"acRate": 63.776283831837155, "difficulty": "Medium", "likes": 700, "dislikes": 73, "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": 47528, "totalSubmissionRaw": 74523}, "1452": {"acRate": 57.15744593939085, "difficulty": "Medium", "likes": 324, "dislikes": 220, "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": 22388, "totalSubmissionRaw": 39169}, "1453": {"acRate": 37.151287553648075, "difficulty": "Hard", "likes": 139, "dislikes": 266, "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": 5540, "totalSubmissionRaw": 14912}, "1454": {"acRate": 37.24597786868166, "difficulty": "Medium", "likes": 385, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33962, "totalSubmissionRaw": 91183}, "1455": {"acRate": 64.13810092973604, "difficulty": "Easy", "likes": 786, "dislikes": 38, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70296, "totalSubmissionRaw": 109601}, "1456": {"acRate": 57.8656933977927, "difficulty": "Medium", "likes": 3147, "dislikes": 104, "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": 205632, "totalSubmissionRaw": 355355}, "1457": {"acRate": 67.44570932724963, "difficulty": "Medium", "likes": 2486, "dislikes": 81, "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": 117367, "totalSubmissionRaw": 174017}, "1458": {"acRate": 62.65298975940144, "difficulty": "Hard", "likes": 1580, "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": 73354, "totalSubmissionRaw": 117081}, "1459": {"acRate": 68.74810417298609, "difficulty": "Medium", "likes": 90, "dislikes": 157, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15865, "totalSubmissionRaw": 23077}, "1460": {"acRate": 71.88834216028746, "difficulty": "Easy", "likes": 996, "dislikes": 140, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 114833, "totalSubmissionRaw": 159738}, "1461": {"acRate": 56.50613132911393, "difficulty": "Medium", "likes": 2173, "dislikes": 92, "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": 114278, "totalSubmissionRaw": 202240}, "1462": {"acRate": 49.4642436611979, "difficulty": "Medium", "likes": 1329, "dislikes": 60, "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": 50405, "totalSubmissionRaw": 101907}, "1463": {"acRate": 69.50550288100973, "difficulty": "Hard", "likes": 3297, "dislikes": 32, "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": 91194, "totalSubmissionRaw": 131204}, "1464": {"acRate": 80.5319315163285, "difficulty": "Easy", "likes": 1782, "dislikes": 195, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 216465, "totalSubmissionRaw": 268794}, "1465": {"acRate": 40.92651212256508, "difficulty": "Medium", "likes": 2589, "dislikes": 346, "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": 163165, "totalSubmissionRaw": 398678}, "1466": {"acRate": 65.50944487531713, "difficulty": "Medium", "likes": 3758, "dislikes": 91, "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": 149505, "totalSubmissionRaw": 228219}, "1467": {"acRate": 60.59426392309526, "difficulty": "Hard", "likes": 273, "dislikes": 167, "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": 7627, "totalSubmissionRaw": 12587}, "1468": {"acRate": 79.46428571428571, "difficulty": "Medium", "likes": 119, "dislikes": 21, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22161, "totalSubmissionRaw": 27888}, "1469": {"acRate": 82.54893198677273, "difficulty": "Easy", "likes": 477, "dislikes": 9, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 46181, "totalSubmissionRaw": 55944}, "1470": {"acRate": 88.4399195867006, "difficulty": "Easy", "likes": 5391, "dislikes": 272, "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": 595219, "totalSubmissionRaw": 673021}, "1471": {"acRate": 60.78030496635147, "difficulty": "Medium", "likes": 654, "dislikes": 143, "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": 35675, "totalSubmissionRaw": 58695}, "1472": {"acRate": 77.6960431164401, "difficulty": "Medium", "likes": 3588, "dislikes": 209, "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": 199518, "totalSubmissionRaw": 256792}, "1473": {"acRate": 61.23062832401828, "difficulty": "Hard", "likes": 2007, "dislikes": 144, "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": 58831, "totalSubmissionRaw": 96081}, "1474": {"acRate": 73.16634050880626, "difficulty": "Easy", "likes": 382, "dislikes": 13, "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": 28041, "totalSubmissionRaw": 38325}, "1475": {"acRate": 76.81690920838076, "difficulty": "Easy", "likes": 1936, "dislikes": 102, "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": 124839, "totalSubmissionRaw": 162515}, "1476": {"acRate": 88.16016725752205, "difficulty": "Medium", "likes": 587, "dislikes": 1389, "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": 96985, "totalSubmissionRaw": 110010}, "1477": {"acRate": 36.564911374422884, "difficulty": "Medium", "likes": 1636, "dislikes": 81, "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": 45301, "totalSubmissionRaw": 123892}, "1478": {"acRate": 55.28101749447014, "difficulty": "Hard", "likes": 1046, "dislikes": 17, "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": 21993, "totalSubmissionRaw": 39784}, "1479": {"acRate": 79.082774049217, "difficulty": "Hard", "likes": 146, "dislikes": 36, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 16261, "totalSubmissionRaw": 20562}, "1480": {"acRate": 86.64601511735844, "difficulty": "Easy", "likes": 7358, "dislikes": 327, "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": 1633480, "totalSubmissionRaw": 1885236}, "1481": {"acRate": 55.94724385685317, "difficulty": "Medium", "likes": 1409, "dislikes": 140, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 105667, "totalSubmissionRaw": 188865}, "1482": {"acRate": 52.207681091307855, "difficulty": "Medium", "likes": 3355, "dislikes": 83, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 86647, "totalSubmissionRaw": 165966}, "1483": {"acRate": 34.28540598867008, "difficulty": "Hard", "likes": 1820, "dislikes": 112, "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": 31774, "totalSubmissionRaw": 92675}, "1484": {"acRate": 76.89871372244845, "difficulty": "Easy", "likes": 1244, "dislikes": 89, "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": 154660, "totalSubmissionRaw": 201110}, "1485": {"acRate": 80.58791261979285, "difficulty": "Medium", "likes": 406, "dislikes": 81, "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": 24975, "totalSubmissionRaw": 30991}, "1486": {"acRate": 85.20654360254848, "difficulty": "Easy", "likes": 1307, "dislikes": 323, "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": 171984, "totalSubmissionRaw": 201844}, "1487": {"acRate": 36.62912747474513, "difficulty": "Medium", "likes": 419, "dislikes": 687, "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": 31582, "totalSubmissionRaw": 86221}, "1488": {"acRate": 26.784928426830533, "difficulty": "Medium", "likes": 1450, "dislikes": 275, "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": 33475, "totalSubmissionRaw": 124977}, "1489": {"acRate": 69.26390031083172, "difficulty": "Hard", "likes": 1732, "dislikes": 147, "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": 49692, "totalSubmissionRaw": 71743}, "1490": {"acRate": 83.26189588768791, "difficulty": "Medium", "likes": 390, "dislikes": 14, "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": 26807, "totalSubmissionRaw": 32196}, "1491": {"acRate": 63.44348290955261, "difficulty": "Easy", "likes": 2180, "dislikes": 184, "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": 322796, "totalSubmissionRaw": 508793}, "1492": {"acRate": 65.654, "difficulty": "Medium", "likes": 1520, "dislikes": 277, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 164133, "totalSubmissionRaw": 249998}, "1493": {"acRate": 66.57962982699208, "difficulty": "Medium", "likes": 3528, "dislikes": 60, "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": 187415, "totalSubmissionRaw": 281490}, "1494": {"acRate": 30.010807531142753, "difficulty": "Hard", "likes": 923, "dislikes": 64, "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": 15828, "totalSubmissionRaw": 52740}, "1495": {"acRate": 49.05052468635815, "difficulty": "Easy", "likes": 78, "dislikes": 35, "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": 27251, "totalSubmissionRaw": 55557}, "1496": {"acRate": 56.24090997894371, "difficulty": "Easy", "likes": 685, "dislikes": 18, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51815, "totalSubmissionRaw": 92132}, "1497": {"acRate": 38.57777085442792, "difficulty": "Medium", "likes": 1601, "dislikes": 87, "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": 44577, "totalSubmissionRaw": 115551}, "1498": {"acRate": 44.032099170839835, "difficulty": "Medium", "likes": 3690, "dislikes": 330, "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": 107271, "totalSubmissionRaw": 243620}, "1499": {"acRate": 44.693642652005316, "difficulty": "Hard", "likes": 1265, "dislikes": 52, "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": 39995, "totalSubmissionRaw": 89487}, "1500": {"acRate": 44.249942035706, "difficulty": "Medium", "likes": 45, "dislikes": 113, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3817, "totalSubmissionRaw": 8626}, "1501": {"acRate": 49.63276304162019, "difficulty": "Medium", "likes": 285, "dislikes": 136, "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": 34261, "totalSubmissionRaw": 69029}, "1502": {"acRate": 69.85119249847116, "difficulty": "Easy", "likes": 2086, "dislikes": 105, "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": 226160, "totalSubmissionRaw": 323774}, "1503": {"acRate": 57.29155372438469, "difficulty": "Medium", "likes": 547, "dislikes": 209, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21136, "totalSubmissionRaw": 36892}, "1504": {"acRate": 57.28347876252975, "difficulty": "Medium", "likes": 1991, "dislikes": 157, "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": 47661, "totalSubmissionRaw": 83202}, "1505": {"acRate": 38.72865904193602, "difficulty": "Hard", "likes": 467, "dislikes": 24, "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": 9346, "totalSubmissionRaw": 24132}, "1506": {"acRate": 78.4664175435146, "difficulty": "Medium", "likes": 447, "dislikes": 184, "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": 31917, "totalSubmissionRaw": 40676}, "1507": {"acRate": 64.11577654874222, "difficulty": "Easy", "likes": 422, "dislikes": 415, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61094, "totalSubmissionRaw": 95287}, "1508": {"acRate": 58.61652293380564, "difficulty": "Medium", "likes": 881, "dislikes": 145, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 35412, "totalSubmissionRaw": 60413}, "1509": {"acRate": 54.78771423723061, "difficulty": "Medium", "likes": 1591, "dislikes": 170, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 80716, "totalSubmissionRaw": 147325}, "1510": {"acRate": 59.83937142309602, "difficulty": "Hard", "likes": 1551, "dislikes": 67, "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": 68695, "totalSubmissionRaw": 114799}, "1511": {"acRate": 69.42204793667082, "difficulty": "Easy", "likes": 296, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37885, "totalSubmissionRaw": 54572}, "1512": {"acRate": 88.96610061060129, "difficulty": "Easy", "likes": 4991, "dislikes": 217, "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": 625789, "totalSubmissionRaw": 703402}, "1513": {"acRate": 45.773877364941875, "difficulty": "Medium", "likes": 797, "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": 40162, "totalSubmissionRaw": 87740}, "1514": {"acRate": 54.61686158142782, "difficulty": "Medium", "likes": 2972, "dislikes": 67, "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": 122031, "totalSubmissionRaw": 223431}, "1515": {"acRate": 36.70389800868731, "difficulty": "Hard", "likes": 220, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13013, "totalSubmissionRaw": 35454}, "1516": {"acRate": 62.64061574896388, "difficulty": "Hard", "likes": 33, "dislikes": 57, "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": 2116, "totalSubmissionRaw": 3378}, "1517": {"acRate": 47.24959909127355, "difficulty": "Easy", "likes": 314, "dislikes": 206, "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": 56571, "totalSubmissionRaw": 119728}, "1518": {"acRate": 60.547279993619796, "difficulty": "Easy", "likes": 961, "dislikes": 76, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 68327, "totalSubmissionRaw": 112849}, "1519": {"acRate": 55.11983160630529, "difficulty": "Medium", "likes": 2179, "dislikes": 794, "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": 81439, "totalSubmissionRaw": 147749}, "1520": {"acRate": 38.50933319232193, "difficulty": "Hard", "likes": 773, "dislikes": 72, "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": 14565, "totalSubmissionRaw": 37822}, "1521": {"acRate": 43.83606404331793, "difficulty": "Hard", "likes": 352, "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": 9391, "totalSubmissionRaw": 21423}, "1522": {"acRate": 73.7559198542805, "difficulty": "Medium", "likes": 554, "dislikes": 8, "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": 40492, "totalSubmissionRaw": 54900}, "1523": {"acRate": 49.700533424837005, "difficulty": "Easy", "likes": 2673, "dislikes": 154, "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": 318650, "totalSubmissionRaw": 641140}, "1524": {"acRate": 43.33897530299848, "difficulty": "Medium", "likes": 1278, "dislikes": 56, "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": 35079, "totalSubmissionRaw": 80941}, "1525": {"acRate": 68.62838846148274, "difficulty": "Medium", "likes": 1959, "dislikes": 47, "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": "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": 94736, "totalSubmissionRaw": 138042}, "1526": {"acRate": 69.54110936661566, "difficulty": "Hard", "likes": 1368, "dislikes": 63, "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": 34991, "totalSubmissionRaw": 50317}, "1527": {"acRate": 40.389601289328006, "difficulty": "Easy", "likes": 532, "dislikes": 502, "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": 149864, "totalSubmissionRaw": 371046}, "1528": {"acRate": 84.66506210272429, "difficulty": "Easy", "likes": 2566, "dislikes": 462, "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": 333123, "totalSubmissionRaw": 393460}, "1529": {"acRate": 72.59750149877668, "difficulty": "Medium", "likes": 952, "dislikes": 39, "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": 44805, "totalSubmissionRaw": 61717}, "1530": {"acRate": 61.60195658819932, "difficulty": "Medium", "likes": 1640, "dislikes": 44, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38285, "totalSubmissionRaw": 62149}, "1531": {"acRate": 49.1380266690333, "difficulty": "Hard", "likes": 1663, "dislikes": 122, "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": 44294, "totalSubmissionRaw": 90142}, "1532": {"acRate": 68.6714142650495, "difficulty": "Medium", "likes": 144, "dislikes": 10, "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": 24686, "totalSubmissionRaw": 35948}, "1533": {"acRate": 55.95839953777264, "difficulty": "Medium", "likes": 232, "dislikes": 29, "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": 11622, "totalSubmissionRaw": 20769}, "1534": {"acRate": 81.00114803579439, "difficulty": "Easy", "likes": 704, "dislikes": 1160, "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": 106540, "totalSubmissionRaw": 131529}, "1535": {"acRate": 48.48711184565998, "difficulty": "Medium", "likes": 606, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30511, "totalSubmissionRaw": 62926}, "1536": {"acRate": 46.60187622325707, "difficulty": "Medium", "likes": 544, "dislikes": 68, "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": 13810, "totalSubmissionRaw": 29634}, "1537": {"acRate": 39.098079334697374, "difficulty": "Hard", "likes": 934, "dislikes": 47, "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": 23695, "totalSubmissionRaw": 60604}, "1538": {"acRate": 70.77634367173955, "difficulty": "Medium", "likes": 127, "dislikes": 99, "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": 3674, "totalSubmissionRaw": 5191}, "1539": {"acRate": 59.05364878373875, "difficulty": "Easy", "likes": 6020, "dislikes": 378, "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": 345578, "totalSubmissionRaw": 585194}, "1540": {"acRate": 34.041968474569615, "difficulty": "Medium", "likes": 353, "dislikes": 299, "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": 17342, "totalSubmissionRaw": 50943}, "1541": {"acRate": 49.804232366126875, "difficulty": "Medium", "likes": 975, "dislikes": 216, "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": 42104, "totalSubmissionRaw": 84539}, "1542": {"acRate": 42.63584047109208, "difficulty": "Hard", "likes": 744, "dislikes": 11, "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": 12743, "totalSubmissionRaw": 29888}, "1543": {"acRate": 59.87154784842647, "difficulty": "Easy", "likes": 83, "dislikes": 43, "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": 18644, "totalSubmissionRaw": 31140}, "1544": {"acRate": 63.10530488893317, "difficulty": "Easy", "likes": 2363, "dislikes": 109, "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": 152014, "totalSubmissionRaw": 240889}, "1545": {"acRate": 58.77714847778148, "difficulty": "Medium", "likes": 860, "dislikes": 54, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37049, "totalSubmissionRaw": 63033}, "1546": {"acRate": 47.49538528357885, "difficulty": "Medium", "likes": 1006, "dislikes": 25, "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": 26245, "totalSubmissionRaw": 55258}, "1547": {"acRate": 62.05131001720837, "difficulty": "Hard", "likes": 3928, "dislikes": 88, "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": 102407, "totalSubmissionRaw": 165036}, "1548": {"acRate": 58.92220591318935, "difficulty": "Hard", "likes": 369, "dislikes": 182, "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": 16860, "totalSubmissionRaw": 28614}, "1549": {"acRate": 65.436908434869, "difficulty": "Medium", "likes": 126, "dislikes": 11, "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": 25027, "totalSubmissionRaw": 38246}, "1550": {"acRate": 63.11141650124701, "difficulty": "Easy", "likes": 606, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74397, "totalSubmissionRaw": 117882}, "1551": {"acRate": 81.95882444809878, "difficulty": "Medium", "likes": 1376, "dislikes": 173, "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": 89213, "totalSubmissionRaw": 108851}, "1552": {"acRate": 59.76402359764024, "difficulty": "Medium", "likes": 2000, "dislikes": 107, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 47816, "totalSubmissionRaw": 80008}, "1553": {"acRate": 34.94459386767079, "difficulty": "Hard", "likes": 948, "dislikes": 55, "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": 32481, "totalSubmissionRaw": 92950}, "1554": {"acRate": 41.960827104588354, "difficulty": "Medium", "likes": 358, "dislikes": 89, "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": 23073, "totalSubmissionRaw": 54987}, "1555": {"acRate": 51.56334413830363, "difficulty": "Medium", "likes": 129, "dislikes": 27, "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": 15271, "totalSubmissionRaw": 29616}, "1556": {"acRate": 53.97347160813908, "difficulty": "Easy", "likes": 459, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46632, "totalSubmissionRaw": 86396}, "1557": {"acRate": 81.24913089254852, "difficulty": "Medium", "likes": 3531, "dislikes": 117, "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": 163600, "totalSubmissionRaw": 201356}, "1558": {"acRate": 63.83317414836039, "difficulty": "Medium", "likes": 605, "dislikes": 34, "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": 20050, "totalSubmissionRaw": 31410}, "1559": {"acRate": 48.44821269691736, "difficulty": "Medium", "likes": 1084, "dislikes": 24, "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": 37028, "totalSubmissionRaw": 76428}, "1560": {"acRate": 58.3398574726488, "difficulty": "Easy", "likes": 298, "dislikes": 593, "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": 29062, "totalSubmissionRaw": 49815}, "1561": {"acRate": 79.64582704985135, "difficulty": "Medium", "likes": 1172, "dislikes": 129, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 73940, "totalSubmissionRaw": 92836}, "1562": {"acRate": 42.90971479722505, "difficulty": "Medium", "likes": 621, "dislikes": 130, "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": 17257, "totalSubmissionRaw": 40217}, "1563": {"acRate": 40.56522527422718, "difficulty": "Hard", "likes": 617, "dislikes": 79, "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": 17899, "totalSubmissionRaw": 44124}, "1564": {"acRate": 67.06100988124378, "difficulty": "Medium", "likes": 317, "dislikes": 27, "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": 14795, "totalSubmissionRaw": 22062}, "1565": {"acRate": 82.2745648048841, "difficulty": "Easy", "likes": 74, "dislikes": 43, "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": 19945, "totalSubmissionRaw": 24242}, "1566": {"acRate": 43.25282547272332, "difficulty": "Easy", "likes": 629, "dislikes": 125, "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": 31841, "totalSubmissionRaw": 73616}, "1567": {"acRate": 44.124603896006064, "difficulty": "Medium", "likes": 2309, "dislikes": 61, "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": 87864, "totalSubmissionRaw": 199127}, "1568": {"acRate": 45.39520310343541, "difficulty": "Hard", "likes": 642, "dislikes": 145, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12170, "totalSubmissionRaw": 26809}, "1569": {"acRate": 53.616112921181916, "difficulty": "Hard", "likes": 1731, "dislikes": 197, "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": 52495, "totalSubmissionRaw": 97909}, "1570": {"acRate": 90.17574303286652, "difficulty": "Medium", "likes": 1121, "dislikes": 142, "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": 199549, "totalSubmissionRaw": 221289}, "1571": {"acRate": 87.98708892735183, "difficulty": "Easy", "likes": 151, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37618, "totalSubmissionRaw": 42754}, "1572": {"acRate": 82.67337491578466, "difficulty": "Easy", "likes": 3258, "dislikes": 45, "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": 304319, "totalSubmissionRaw": 368099}, "1573": {"acRate": 32.479725785819845, "difficulty": "Medium", "likes": 696, "dislikes": 75, "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": 26153, "totalSubmissionRaw": 80521}, "1574": {"acRate": 37.53656554712892, "difficulty": "Medium", "likes": 1522, "dislikes": 56, "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": 27717, "totalSubmissionRaw": 73840}, "1575": {"acRate": 65.87564804061255, "difficulty": "Hard", "likes": 1570, "dislikes": 57, "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": 55020, "totalSubmissionRaw": 83521}, "1576": {"acRate": 47.2007420837374, "difficulty": "Easy", "likes": 538, "dislikes": 169, "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": 55971, "totalSubmissionRaw": 118583}, "1577": {"acRate": 40.56271981242673, "difficulty": "Medium", "likes": 352, "dislikes": 52, "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": 19376, "totalSubmissionRaw": 47768}, "1578": {"acRate": 63.01743677022903, "difficulty": "Medium", "likes": 2920, "dislikes": 87, "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": 154031, "totalSubmissionRaw": 244426}, "1579": {"acRate": 64.56860961444265, "difficulty": "Hard", "likes": 1943, "dislikes": 28, "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": 55365, "totalSubmissionRaw": 85746}, "1580": {"acRate": 63.69532428355957, "difficulty": "Medium", "likes": 163, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 4223, "totalSubmissionRaw": 6630}, "1581": {"acRate": 75.54932086734073, "difficulty": "Easy", "likes": 1320, "dislikes": 177, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 198453, "totalSubmissionRaw": 262675}, "1582": {"acRate": 65.09289047329217, "difficulty": "Easy", "likes": 702, "dislikes": 25, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44918, "totalSubmissionRaw": 69006}, "1583": {"acRate": 61.42499763995091, "difficulty": "Medium", "likes": 265, "dislikes": 815, "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": 26027, "totalSubmissionRaw": 42372}, "1584": {"acRate": 66.5054773990014, "difficulty": "Medium", "likes": 4712, "dislikes": 111, "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": 240953, "totalSubmissionRaw": 362305}, "1585": {"acRate": 48.06883365200765, "difficulty": "Hard", "likes": 426, "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": 7542, "totalSubmissionRaw": 15690}, "1586": {"acRate": 70.5228445295463, "difficulty": "Medium", "likes": 253, "dislikes": 32, "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": 13259, "totalSubmissionRaw": 18801}, "1587": {"acRate": 84.1837140019861, "difficulty": "Easy", "likes": 427, "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": 84773, "totalSubmissionRaw": 100700}, "1588": {"acRate": 83.19160877418868, "difficulty": "Easy", "likes": 3517, "dislikes": 272, "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": 176392, "totalSubmissionRaw": 212031}, "1589": {"acRate": 37.45272997663055, "difficulty": "Medium", "likes": 722, "dislikes": 35, "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": 17629, "totalSubmissionRaw": 47070}, "1590": {"acRate": 28.596468973788298, "difficulty": "Medium", "likes": 1432, "dislikes": 55, "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": 24798, "totalSubmissionRaw": 86717}, "1591": {"acRate": 58.868374032161995, "difficulty": "Hard", "likes": 590, "dislikes": 18, "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": 9884, "totalSubmissionRaw": 16790}, "1592": {"acRate": 43.32358920081313, "difficulty": "Easy", "likes": 427, "dislikes": 334, "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": 51575, "totalSubmissionRaw": 119046}, "1593": {"acRate": 55.78143593811979, "difficulty": "Medium", "likes": 798, "dislikes": 30, "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": 28125, "totalSubmissionRaw": 50420}, "1594": {"acRate": 33.287410712948684, "difficulty": "Medium", "likes": 789, "dislikes": 39, "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": 22229, "totalSubmissionRaw": 66779}, "1595": {"acRate": 47.547191462505026, "difficulty": "Hard", "likes": 447, "dislikes": 13, "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": 8287, "totalSubmissionRaw": 17429}, "1596": {"acRate": 79.81504485852312, "difficulty": "Medium", "likes": 230, "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": 28913, "totalSubmissionRaw": 36225}, "1597": {"acRate": 62.62880120633325, "difficulty": "Hard", "likes": 261, "dislikes": 44, "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": 12460, "totalSubmissionRaw": 19895}, "1598": {"acRate": 64.64618096243426, "difficulty": "Easy", "likes": 874, "dislikes": 60, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 66753, "totalSubmissionRaw": 103259}, "1599": {"acRate": 43.649189704480456, "difficulty": "Medium", "likes": 102, "dislikes": 238, "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": 11447, "totalSubmissionRaw": 26225}, "1600": {"acRate": 63.98927340058741, "difficulty": "Medium", "likes": 248, "dislikes": 289, "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": 15033, "totalSubmissionRaw": 23493}, "1601": {"acRate": 64.95713790198701, "difficulty": "Hard", "likes": 1357, "dislikes": 70, "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": 52436, "totalSubmissionRaw": 80724}, "1602": {"acRate": 75.47169811320755, "difficulty": "Medium", "likes": 319, "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": 22039, "totalSubmissionRaw": 29202}, "1603": {"acRate": 88.19546689339111, "difficulty": "Easy", "likes": 1852, "dislikes": 435, "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": 255181, "totalSubmissionRaw": 289336}, "1604": {"acRate": 45.86522439065722, "difficulty": "Medium", "likes": 289, "dislikes": 401, "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": 32479, "totalSubmissionRaw": 70814}, "1605": {"acRate": 77.60026765923634, "difficulty": "Medium", "likes": 1357, "dislikes": 38, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 37110, "totalSubmissionRaw": 47822}, "1606": {"acRate": 43.26624934183584, "difficulty": "Hard", "likes": 563, "dislikes": 24, "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": 14791, "totalSubmissionRaw": 34186}, "1607": {"acRate": 54.18341803838277, "difficulty": "Easy", "likes": 120, "dislikes": 13, "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": 28572, "totalSubmissionRaw": 52732}, "1608": {"acRate": 59.98586101540661, "difficulty": "Easy", "likes": 1517, "dislikes": 251, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 73821, "totalSubmissionRaw": 123064}, "1609": {"acRate": 55.255874410317894, "difficulty": "Medium", "likes": 1133, "dislikes": 58, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49312, "totalSubmissionRaw": 89243}, "1610": {"acRate": 37.345384420593334, "difficulty": "Hard", "likes": 543, "dislikes": 724, "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": 38344, "totalSubmissionRaw": 102674}, "1611": {"acRate": 63.54543424871623, "difficulty": "Hard", "likes": 434, "dislikes": 358, "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": 14231, "totalSubmissionRaw": 22395}, "1612": {"acRate": 70.35871617369415, "difficulty": "Medium", "likes": 133, "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": "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": 6708, "totalSubmissionRaw": 9534}, "1613": {"acRate": 73.727069743006, "difficulty": "Medium", "likes": 217, "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": 16840, "totalSubmissionRaw": 22841}, "1614": {"acRate": 81.56562641150909, "difficulty": "Easy", "likes": 1739, "dislikes": 265, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 157106, "totalSubmissionRaw": 192613}, "1615": {"acRate": 65.22997555525562, "difficulty": "Medium", "likes": 2246, "dislikes": 342, "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": 130487, "totalSubmissionRaw": 200042}, "1616": {"acRate": 30.995506684156176, "difficulty": "Medium", "likes": 695, "dislikes": 237, "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": 22212, "totalSubmissionRaw": 71662}, "1617": {"acRate": 65.58206796818511, "difficulty": "Hard", "likes": 503, "dislikes": 37, "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": 9070, "totalSubmissionRaw": 13830}, "1618": {"acRate": 60.458664693915296, "difficulty": "Medium", "likes": 106, "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": 6538, "totalSubmissionRaw": 10814}, "1619": {"acRate": 66.94380733944955, "difficulty": "Easy", "likes": 450, "dislikes": 121, "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": 51370, "totalSubmissionRaw": 76736}, "1620": {"acRate": 37.541606113168626, "difficulty": "Medium", "likes": 76, "dislikes": 256, "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": 8008, "totalSubmissionRaw": 21331}, "1621": {"acRate": 42.8300724809323, "difficulty": "Medium", "likes": 438, "dislikes": 45, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9041, "totalSubmissionRaw": 21109}, "1622": {"acRate": 16.66279771577139, "difficulty": "Hard", "likes": 357, "dislikes": 131, "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": 10767, "totalSubmissionRaw": 64617}, "1623": {"acRate": 84.48469006721434, "difficulty": "Easy", "likes": 69, "dislikes": 130, "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": 18100, "totalSubmissionRaw": 21424}, "1624": {"acRate": 59.05720406119681, "difficulty": "Easy", "likes": 603, "dislikes": 35, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 46592, "totalSubmissionRaw": 78893}, "1625": {"acRate": 65.94825470077078, "difficulty": "Medium", "likes": 329, "dislikes": 265, "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": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13433, "totalSubmissionRaw": 20369}, "1626": {"acRate": 50.59847376123771, "difficulty": "Medium", "likes": 2840, "dislikes": 89, "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": 77443, "totalSubmissionRaw": 153055}, "1627": {"acRate": 46.69586461685139, "difficulty": "Hard", "likes": 548, "dislikes": 30, "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": 15673, "totalSubmissionRaw": 33564}, "1628": {"acRate": 82.86496470743452, "difficulty": "Medium", "likes": 516, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"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": 25123, "totalSubmissionRaw": 30318}, "1629": {"acRate": 59.09271836992577, "difficulty": "Easy", "likes": 734, "dislikes": 101, "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": 93529, "totalSubmissionRaw": 158275}, "1630": {"acRate": 80.93948488867174, "difficulty": "Medium", "likes": 1141, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57981, "totalSubmissionRaw": 71635}, "1631": {"acRate": 59.36797445772597, "difficulty": "Medium", "likes": 5445, "dislikes": 184, "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": 219969, "totalSubmissionRaw": 370519}, "1632": {"acRate": 40.925093851510375, "difficulty": "Hard", "likes": 832, "dislikes": 53, "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": 21040, "totalSubmissionRaw": 51411}, "1633": {"acRate": 57.030287717525184, "difficulty": "Easy", "likes": 416, "dislikes": 41, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 72230, "totalSubmissionRaw": 126649}, "1634": {"acRate": 55.017962683972655, "difficulty": "Medium", "likes": 135, "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": 9495, "totalSubmissionRaw": 17258}, "1635": {"acRate": 48.484848484848484, "difficulty": "Hard", "likes": 99, "dislikes": 34, "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": 7344, "totalSubmissionRaw": 15147}, "1636": {"acRate": 70.50841277282909, "difficulty": "Easy", "likes": 2659, "dislikes": 99, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 108284, "totalSubmissionRaw": 153576}, "1637": {"acRate": 84.48349184257327, "difficulty": "Medium", "likes": 318, "dislikes": 718, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43705, "totalSubmissionRaw": 51732}, "1638": {"acRate": 71.16288899455803, "difficulty": "Medium", "likes": 1085, "dislikes": 330, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26937, "totalSubmissionRaw": 37853}, "1639": {"acRate": 52.52782352647601, "difficulty": "Hard", "likes": 1489, "dislikes": 79, "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": 52625, "totalSubmissionRaw": 100184}, "1640": {"acRate": 56.36087396903488, "difficulty": "Easy", "likes": 863, "dislikes": 133, "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": 77902, "totalSubmissionRaw": 138220}, "1641": {"acRate": 77.93254795375871, "difficulty": "Medium", "likes": 3712, "dislikes": 78, "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": 169748, "totalSubmissionRaw": 217814}, "1642": {"acRate": 48.41224597942945, "difficulty": "Medium", "likes": 4455, "dislikes": 91, "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": 120592, "totalSubmissionRaw": 249094}, "1643": {"acRate": 47.44872225958305, "difficulty": "Hard", "likes": 511, "dislikes": 10, "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": 11289, "totalSubmissionRaw": 23792}, "1644": {"acRate": 61.72443590974556, "difficulty": "Medium", "likes": 584, "dislikes": 31, "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": 64286, "totalSubmissionRaw": 104150}, "1645": {"acRate": 38.54542975938927, "difficulty": "Hard", "likes": 58, "dislikes": 15, "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": 5655, "totalSubmissionRaw": 14671}, "1646": {"acRate": 50.188946622579124, "difficulty": "Easy", "likes": 716, "dislikes": 903, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99875, "totalSubmissionRaw": 198998}, "1647": {"acRate": 61.20003755251484, "difficulty": "Medium", "likes": 4795, "dislikes": 72, "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": 260755, "totalSubmissionRaw": 426070}, "1648": {"acRate": 30.12520341403474, "difficulty": "Medium", "likes": 1044, "dislikes": 373, "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": 36284, "totalSubmissionRaw": 120444}, "1649": {"acRate": 38.07053448193803, "difficulty": "Hard", "likes": 617, "dislikes": 74, "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": 23997, "totalSubmissionRaw": 63033}, "1650": {"acRate": 77.93163796447483, "difficulty": "Medium", "likes": 1212, "dislikes": 42, "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": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 172766, "totalSubmissionRaw": 221691}, "1651": {"acRate": 66.7427788560338, "difficulty": "Hard", "likes": 30, "dislikes": 60, "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": 5846, "totalSubmissionRaw": 8759}, "1652": {"acRate": 63.38182016785304, "difficulty": "Easy", "likes": 686, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34815, "totalSubmissionRaw": 54929}, "1653": {"acRate": 58.86356956111446, "difficulty": "Medium", "likes": 1245, "dislikes": 35, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38050, "totalSubmissionRaw": 64641}, "1654": {"acRate": 29.293809938971226, "difficulty": "Medium", "likes": 1419, "dislikes": 256, "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": 39312, "totalSubmissionRaw": 134199}, "1655": {"acRate": 39.295503954125834, "difficulty": "Hard", "likes": 383, "dislikes": 20, "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": 12472, "totalSubmissionRaw": 31739}, "1656": {"acRate": 84.54288197152343, "difficulty": "Easy", "likes": 477, "dislikes": 3243, "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": 75883, "totalSubmissionRaw": 89757}, "1657": {"acRate": 53.97481320628027, "difficulty": "Medium", "likes": 2655, "dislikes": 145, "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"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151122, "totalSubmissionRaw": 279987}, "1658": {"acRate": 39.75873865299489, "difficulty": "Medium", "likes": 5245, "dislikes": 110, "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": 177122, "totalSubmissionRaw": 445492}, "1659": {"acRate": 39.261188728392135, "difficulty": "Hard", "likes": 320, "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": 4974, "totalSubmissionRaw": 12669}, "1660": {"acRate": 72.39213806327899, "difficulty": "Medium", "likes": 227, "dislikes": 36, "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": 15101, "totalSubmissionRaw": 20860}, "1661": {"acRate": 68.10560114163397, "difficulty": "Easy", "likes": 787, "dislikes": 67, "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": 93531, "totalSubmissionRaw": 137335}, "1662": {"acRate": 83.83210143621177, "difficulty": "Easy", "likes": 2331, "dislikes": 178, "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": 306911, "totalSubmissionRaw": 366102}, "1663": {"acRate": 66.73255934028649, "difficulty": "Medium", "likes": 1825, "dislikes": 58, "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": 90472, "totalSubmissionRaw": 135574}, "1664": {"acRate": 63.297439488276154, "difficulty": "Medium", "likes": 1241, "dislikes": 35, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33447, "totalSubmissionRaw": 52841}, "1665": {"acRate": 56.9986198881383, "difficulty": "Hard", "likes": 546, "dislikes": 34, "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": 15694, "totalSubmissionRaw": 27534}, "1666": {"acRate": 73.0622105898933, "difficulty": "Medium", "likes": 57, "dislikes": 158, "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": 3629, "totalSubmissionRaw": 4967}, "1667": {"acRate": 63.162092327724764, "difficulty": "Easy", "likes": 757, "dislikes": 90, "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": 155223, "totalSubmissionRaw": 245754}, "1668": {"acRate": 38.7229509158082, "difficulty": "Easy", "likes": 626, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39619, "totalSubmissionRaw": 102313}, "1669": {"acRate": 72.96496838433025, "difficulty": "Medium", "likes": 1442, "dislikes": 181, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 80313, "totalSubmissionRaw": 110071}, "1670": {"acRate": 56.52700872169015, "difficulty": "Medium", "likes": 703, "dislikes": 95, "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": 23786, "totalSubmissionRaw": 42079}, "1671": {"acRate": 41.66733210891959, "difficulty": "Hard", "likes": 1491, "dislikes": 20, "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": 26090, "totalSubmissionRaw": 62615}, "1672": {"acRate": 87.52729993610782, "difficulty": "Easy", "likes": 3983, "dislikes": 348, "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": 720579, "totalSubmissionRaw": 823262}, "1673": {"acRate": 49.648738513094855, "difficulty": "Medium", "likes": 1926, "dislikes": 91, "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": 56891, "totalSubmissionRaw": 114587}, "1674": {"acRate": 38.88052818097966, "difficulty": "Medium", "likes": 614, "dislikes": 71, "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": 8009, "totalSubmissionRaw": 20599}, "1675": {"acRate": 54.289105492213075, "difficulty": "Hard", "likes": 2971, "dislikes": 165, "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": 90564, "totalSubmissionRaw": 166818}, "1676": {"acRate": 78.8656519795808, "difficulty": "Medium", "likes": 420, "dislikes": 13, "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": "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": 33525, "totalSubmissionRaw": 42509}, "1677": {"acRate": 38.02329319255212, "difficulty": "Easy", "likes": 35, "dislikes": 131, "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": 15377, "totalSubmissionRaw": 40441}, "1678": {"acRate": 86.79623783214943, "difficulty": "Easy", "likes": 1463, "dislikes": 85, "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": 211142, "totalSubmissionRaw": 243262}, "1679": {"acRate": 55.56419116855786, "difficulty": "Medium", "likes": 2735, "dislikes": 61, "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": 185880, "totalSubmissionRaw": 334529}, "1680": {"acRate": 57.023740590619575, "difficulty": "Medium", "likes": 1398, "dislikes": 434, "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": 88632, "totalSubmissionRaw": 155430}, "1681": {"acRate": 38.7221247807567, "difficulty": "Hard", "likes": 263, "dislikes": 92, "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": 7727, "totalSubmissionRaw": 19955}, "1682": {"acRate": 49.99501445807159, "difficulty": "Medium", "likes": 144, "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": 5014, "totalSubmissionRaw": 10029}, "1683": {"acRate": 84.7421295700013, "difficulty": "Easy", "likes": 616, "dislikes": 198, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184226, "totalSubmissionRaw": 217395}, "1684": {"acRate": 82.56861896358451, "difficulty": "Easy", "likes": 1601, "dislikes": 62, "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": 148787, "totalSubmissionRaw": 180198}, "1685": {"acRate": 62.600920935802925, "difficulty": "Medium", "likes": 1131, "dislikes": 32, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30317, "totalSubmissionRaw": 48429}, "1686": {"acRate": 56.10237537638007, "difficulty": "Medium", "likes": 768, "dislikes": 63, "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": 16769, "totalSubmissionRaw": 29890}, "1687": {"acRate": 38.77537026878771, "difficulty": "Hard", "likes": 354, "dislikes": 27, "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": 5655, "totalSubmissionRaw": 14584}, "1688": {"acRate": 83.01633994266425, "difficulty": "Easy", "likes": 1023, "dislikes": 164, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 110909, "totalSubmissionRaw": 133599}, "1689": {"acRate": 88.84624699592004, "difficulty": "Medium", "likes": 2301, "dislikes": 1429, "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": 190760, "totalSubmissionRaw": 214708}, "1690": {"acRate": 57.967187720039426, "difficulty": "Medium", "likes": 944, "dislikes": 159, "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": 32929, "totalSubmissionRaw": 56807}, "1691": {"acRate": 55.93061184145498, "difficulty": "Hard", "likes": 1049, "dislikes": 28, "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": 22634, "totalSubmissionRaw": 40468}, "1692": {"acRate": 62.618853572398805, "difficulty": "Hard", "likes": 71, "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": 2305, "totalSubmissionRaw": 3681}, "1693": {"acRate": 86.88250533907502, "difficulty": "Easy", "likes": 492, "dislikes": 29, "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": 99264, "totalSubmissionRaw": 114251}, "1694": {"acRate": 65.20807183547359, "difficulty": "Easy", "likes": 321, "dislikes": 194, "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": 33768, "totalSubmissionRaw": 51785}, "1695": {"acRate": 57.68497755072743, "difficulty": "Medium", "likes": 2693, "dislikes": 44, "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": 116530, "totalSubmissionRaw": 202011}, "1696": {"acRate": 45.77485242927553, "difficulty": "Medium", "likes": 3310, "dislikes": 108, "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": 102440, "totalSubmissionRaw": 223791}, "1697": {"acRate": 62.62867431210615, "difficulty": "Hard", "likes": 1873, "dislikes": 44, "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": 48003, "totalSubmissionRaw": 76647}, "1698": {"acRate": 63.20096783376032, "difficulty": "Medium", "likes": 180, "dislikes": 42, "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": 8881, "totalSubmissionRaw": 14052}, "1699": {"acRate": 81.47730538789769, "difficulty": "Medium", "likes": 274, "dislikes": 13, "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": 36853, "totalSubmissionRaw": 45231}, "1700": {"acRate": 70.07959789340057, "difficulty": "Easy", "likes": 1540, "dislikes": 104, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81703, "totalSubmissionRaw": 116586}, "1701": {"acRate": 62.99507295812015, "difficulty": "Medium", "likes": 484, "dislikes": 50, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 26594, "totalSubmissionRaw": 42216}, "1702": {"acRate": 46.42730040729171, "difficulty": "Medium", "likes": 469, "dislikes": 49, "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": 11741, "totalSubmissionRaw": 25289}, "1703": {"acRate": 42.54197927831368, "difficulty": "Hard", "likes": 671, "dislikes": 23, "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": 9526, "totalSubmissionRaw": 22392}, "1704": {"acRate": 77.45930685132042, "difficulty": "Easy", "likes": 1768, "dislikes": 82, "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": 200010, "totalSubmissionRaw": 258213}, "1705": {"acRate": 38.47534302912476, "difficulty": "Medium", "likes": 774, "dislikes": 176, "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": 20582, "totalSubmissionRaw": 53494}, "1706": {"acRate": 71.61953862745614, "difficulty": "Medium", "likes": 3013, "dislikes": 175, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136138, "totalSubmissionRaw": 190085}, "1707": {"acRate": 48.03130929791271, "difficulty": "Hard", "likes": 1113, "dislikes": 35, "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": 18225, "totalSubmissionRaw": 37944}, "1708": {"acRate": 64.09041801711959, "difficulty": "Easy", "likes": 91, "dislikes": 110, "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": 7712, "totalSubmissionRaw": 12033}, "1709": {"acRate": 72.4951702716012, "difficulty": "Medium", "likes": 188, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19137, "totalSubmissionRaw": 26398}, "1710": {"acRate": 73.63388157290817, "difficulty": "Easy", "likes": 3668, "dislikes": 206, "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": 280750, "totalSubmissionRaw": 381277}, "1711": {"acRate": 29.705847467678804, "difficulty": "Medium", "likes": 969, "dislikes": 230, "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": 35063, "totalSubmissionRaw": 118034}, "1712": {"acRate": 32.76000259948443, "difficulty": "Medium", "likes": 1326, "dislikes": 98, "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": 30246, "totalSubmissionRaw": 92326}, "1713": {"acRate": 48.23848238482385, "difficulty": "Hard", "likes": 648, "dislikes": 10, "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": 10324, "totalSubmissionRaw": 21402}, "1714": {"acRate": 49.047619047619044, "difficulty": "Hard", "likes": 28, "dislikes": 23, "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": 1236, "totalSubmissionRaw": 2520}, "1715": {"acRate": 75.68740139734055, "difficulty": "Medium", "likes": 76, "dislikes": 19, "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": 13433, "totalSubmissionRaw": 17748}, "1716": {"acRate": 66.94838922748971, "difficulty": "Easy", "likes": 635, "dislikes": 17, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44597, "totalSubmissionRaw": 66614}, "1717": {"acRate": 46.67336962174531, "difficulty": "Medium", "likes": 598, "dislikes": 34, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 13462, "totalSubmissionRaw": 28843}, "1718": {"acRate": 52.918776234367556, "difficulty": "Medium", "likes": 529, "dislikes": 48, "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": 12229, "totalSubmissionRaw": 23109}, "1719": {"acRate": 43.918690005646525, "difficulty": "Hard", "likes": 202, "dislikes": 143, "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": 3889, "totalSubmissionRaw": 8855}, "1720": {"acRate": 85.8587733135381, "difficulty": "Easy", "likes": 1483, "dislikes": 206, "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": 129542, "totalSubmissionRaw": 150878}, "1721": {"acRate": 68.30504990521436, "difficulty": "Medium", "likes": 5068, "dislikes": 164, "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": 299060, "totalSubmissionRaw": 437830}, "1722": {"acRate": 48.72661046323767, "difficulty": "Medium", "likes": 797, "dislikes": 25, "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": 16588, "totalSubmissionRaw": 34043}, "1723": {"acRate": 42.30067268081556, "difficulty": "Hard", "likes": 990, "dislikes": 29, "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": 24336, "totalSubmissionRaw": 57531}, "1724": {"acRate": 52.30282664558214, "difficulty": "Hard", "likes": 96, "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": 2646, "totalSubmissionRaw": 5059}, "1725": {"acRate": 78.57097962313485, "difficulty": "Easy", "likes": 542, "dislikes": 62, "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": 62504, "totalSubmissionRaw": 79551}, "1726": {"acRate": 60.88845968131338, "difficulty": "Medium", "likes": 599, "dislikes": 26, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25220, "totalSubmissionRaw": 41420}, "1727": {"acRate": 61.87868576242629, "difficulty": "Medium", "likes": 973, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 16159, "totalSubmissionRaw": 26114}, "1728": {"acRate": 39.275817476445596, "difficulty": "Hard", "likes": 255, "dislikes": 39, "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": 6378, "totalSubmissionRaw": 16239}, "1729": {"acRate": 69.12214994414876, "difficulty": "Easy", "likes": 444, "dislikes": 27, "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": 105197, "totalSubmissionRaw": 152190}, "1730": {"acRate": 54.348754043312056, "difficulty": "Medium", "likes": 639, "dislikes": 39, "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": 57293, "totalSubmissionRaw": 105418}, "1731": {"acRate": 44.83530984668276, "difficulty": "Easy", "likes": 316, "dislikes": 49, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 51643, "totalSubmissionRaw": 115184}, "1732": {"acRate": 82.46023575355711, "difficulty": "Easy", "likes": 2571, "dislikes": 236, "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": 263516, "totalSubmissionRaw": 319568}, "1733": {"acRate": 41.85604164581039, "difficulty": "Medium", "likes": 194, "dislikes": 381, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8362, "totalSubmissionRaw": 19978}, "1734": {"acRate": 63.79367094559646, "difficulty": "Medium", "likes": 724, "dislikes": 24, "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": 13567, "totalSubmissionRaw": 21267}, "1735": {"acRate": 50.58730628763202, "difficulty": "Hard", "likes": 265, "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": 5125, "totalSubmissionRaw": 10131}, "1736": {"acRate": 42.373488224061106, "difficulty": "Easy", "likes": 330, "dislikes": 175, "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": 31953, "totalSubmissionRaw": 75408}, "1737": {"acRate": 35.76049432856604, "difficulty": "Medium", "likes": 306, "dislikes": 321, "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": 12327, "totalSubmissionRaw": 34471}, "1738": {"acRate": 61.32063994160228, "difficulty": "Medium", "likes": 481, "dislikes": 73, "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": "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": 20161, "totalSubmissionRaw": 32878}, "1739": {"acRate": 52.21295702373317, "difficulty": "Hard", "likes": 286, "dislikes": 43, "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": 6512, "totalSubmissionRaw": 12472}, "1740": {"acRate": 69.715220721348, "difficulty": "Medium", "likes": 386, "dislikes": 14, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 20023, "totalSubmissionRaw": 28722}, "1741": {"acRate": 87.49717459394878, "difficulty": "Easy", "likes": 646, "dislikes": 16, "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": 108388, "totalSubmissionRaw": 123876}, "1742": {"acRate": 73.40180444547408, "difficulty": "Easy", "likes": 573, "dislikes": 146, "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": 57031, "totalSubmissionRaw": 77697}, "1743": {"acRate": 69.05352585268344, "difficulty": "Medium", "likes": 1001, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38690, "totalSubmissionRaw": 56029}, "1744": {"acRate": 33.54073766808393, "difficulty": "Medium", "likes": 120, "dislikes": 313, "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": 9703, "totalSubmissionRaw": 28929}, "1745": {"acRate": 44.403666044963195, "difficulty": "Hard", "likes": 864, "dislikes": 25, "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": 22141, "totalSubmissionRaw": 49863}, "1746": {"acRate": 62.24754760530872, "difficulty": "Medium", "likes": 266, "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": 8630, "totalSubmissionRaw": 13864}, "1747": {"acRate": 65.9882083442863, "difficulty": "Medium", "likes": 168, "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": 17572, "totalSubmissionRaw": 26629}, "1748": {"acRate": 76.70542069105097, "difficulty": "Easy", "likes": 1400, "dislikes": 34, "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": 136439, "totalSubmissionRaw": 177874}, "1749": {"acRate": 59.08095156597638, "difficulty": "Medium", "likes": 1188, "dislikes": 18, "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": 34521, "totalSubmissionRaw": 58430}, "1750": {"acRate": 44.51978587173297, "difficulty": "Medium", "likes": 449, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21207, "totalSubmissionRaw": 47635}, "1751": {"acRate": 62.9161467657643, "difficulty": "Hard", "likes": 1957, "dislikes": 36, "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": 69584, "totalSubmissionRaw": 110598}, "1752": {"acRate": 50.69021342410905, "difficulty": "Easy", "likes": 2561, "dislikes": 105, "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": 140271, "totalSubmissionRaw": 276724}, "1753": {"acRate": 67.49167697136879, "difficulty": "Medium", "likes": 886, "dislikes": 53, "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": 35477, "totalSubmissionRaw": 52565}, "1754": {"acRate": 46.86661220679193, "difficulty": "Medium", "likes": 511, "dislikes": 70, "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": 20080, "totalSubmissionRaw": 42845}, "1755": {"acRate": 37.98095734968045, "difficulty": "Hard", "likes": 820, "dislikes": 62, "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": 14560, "totalSubmissionRaw": 38335}, "1756": {"acRate": 76.94085316345013, "difficulty": "Medium", "likes": 255, "dislikes": 20, "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": 12319, "totalSubmissionRaw": 16011}, "1757": {"acRate": 89.71215585554546, "difficulty": "Easy", "likes": 1634, "dislikes": 91, "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": 572847, "totalSubmissionRaw": 638539}, "1758": {"acRate": 58.04340862986746, "difficulty": "Easy", "likes": 573, "dislikes": 21, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38055, "totalSubmissionRaw": 65563}, "1759": {"acRate": 49.02826855123675, "difficulty": "Medium", "likes": 669, "dislikes": 43, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 27749, "totalSubmissionRaw": 56597}, "1760": {"acRate": 60.433646273943395, "difficulty": "Medium", "likes": 1908, "dislikes": 44, "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": 35147, "totalSubmissionRaw": 58158}, "1761": {"acRate": 41.936447258392064, "difficulty": "Hard", "likes": 307, "dislikes": 277, "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": 21063, "totalSubmissionRaw": 50226}, "1762": {"acRate": 79.07511958363835, "difficulty": "Medium", "likes": 1090, "dislikes": 137, "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": 157706, "totalSubmissionRaw": 199438}, "1763": {"acRate": 60.60163312122785, "difficulty": "Easy", "likes": 1206, "dislikes": 809, "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": 44381, "totalSubmissionRaw": 73234}, "1764": {"acRate": 53.21969696969697, "difficulty": "Medium", "likes": 308, "dislikes": 35, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13769, "totalSubmissionRaw": 25872}, "1765": {"acRate": 61.02332979851538, "difficulty": "Medium", "likes": 755, "dislikes": 45, "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": 23018, "totalSubmissionRaw": 37720}, "1766": {"acRate": 39.768339768339764, "difficulty": "Hard", "likes": 382, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"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": 8240, "totalSubmissionRaw": 20720}, "1767": {"acRate": 78.56623879874061, "difficulty": "Hard", "likes": 155, "dislikes": 12, "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": 9732, "totalSubmissionRaw": 12387}, "1768": {"acRate": 79.1513554365563, "difficulty": "Easy", "likes": 3070, "dislikes": 55, "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": false, "totalAcceptedRaw": 440910, "totalSubmissionRaw": 557024}, "1769": {"acRate": 85.48621853734369, "difficulty": "Medium", "likes": 2133, "dislikes": 82, "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": 112181, "totalSubmissionRaw": 131227}, "1770": {"acRate": 38.79321919463551, "difficulty": "Hard", "likes": 2451, "dislikes": 507, "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": 101125, "totalSubmissionRaw": 260677}, "1771": {"acRate": 35.455027389998236, "difficulty": "Hard", "likes": 523, "dislikes": 12, "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": 10032, "totalSubmissionRaw": 28295}, "1772": {"acRate": 65.21687178874419, "difficulty": "Medium", "likes": 79, "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": 5458, "totalSubmissionRaw": 8369}, "1773": {"acRate": 84.5198664087946, "difficulty": "Easy", "likes": 1741, "dislikes": 181, "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": 183982, "totalSubmissionRaw": 217679}, "1774": {"acRate": 47.412097581173875, "difficulty": "Medium", "likes": 665, "dislikes": 80, "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": 27481, "totalSubmissionRaw": 57962}, "1775": {"acRate": 53.28461275190756, "difficulty": "Medium", "likes": 857, "dislikes": 37, "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": 26467, "totalSubmissionRaw": 49671}, "1776": {"acRate": 54.09801973334566, "difficulty": "Hard", "likes": 829, "dislikes": 27, "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": 23412, "totalSubmissionRaw": 43277}, "1777": {"acRate": 82.59238931577022, "difficulty": "Easy", "likes": 123, "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": 18058, "totalSubmissionRaw": 21864}, "1778": {"acRate": 39.1013916500994, "difficulty": "Medium", "likes": 149, "dislikes": 60, "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": 4917, "totalSubmissionRaw": 12575}, "1779": {"acRate": 67.63255320250609, "difficulty": "Easy", "likes": 793, "dislikes": 170, "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": 104495, "totalSubmissionRaw": 154504}, "1780": {"acRate": 66.7162206805418, "difficulty": "Medium", "likes": 915, "dislikes": 30, "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": 36352, "totalSubmissionRaw": 54487}, "1781": {"acRate": 63.63725145513497, "difficulty": "Medium", "likes": 899, "dislikes": 150, "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": 32581, "totalSubmissionRaw": 51198}, "1782": {"acRate": 39.66020361844239, "difficulty": "Hard", "likes": 299, "dislikes": 158, "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": 6116, "totalSubmissionRaw": 15421}, "1783": {"acRate": 84.95002225729432, "difficulty": "Medium", "likes": 216, "dislikes": 6, "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": 20992, "totalSubmissionRaw": 24711}, "1784": {"acRate": 39.50208617166213, "difficulty": "Easy", "likes": 303, "dislikes": 906, "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": 37111, "totalSubmissionRaw": 93945}, "1785": {"acRate": 42.880003556108726, "difficulty": "Medium", "likes": 246, "dislikes": 189, "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": 19293, "totalSubmissionRaw": 44993}, "1786": {"acRate": 38.96553006358532, "difficulty": "Medium", "likes": 992, "dislikes": 185, "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": 20958, "totalSubmissionRaw": 53786}, "1787": {"acRate": 39.54541711273985, "difficulty": "Hard", "likes": 378, "dislikes": 21, "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": 4802, "totalSubmissionRaw": 12143}, "1788": {"acRate": 67.06161137440758, "difficulty": "Hard", "likes": 72, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1981, "totalSubmissionRaw": 2954}, "1789": {"acRate": 65.75048344898191, "difficulty": "Easy", "likes": 292, "dislikes": 120, "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": 46232, "totalSubmissionRaw": 70315}, "1790": {"acRate": 45.35448647705123, "difficulty": "Easy", "likes": 1009, "dislikes": 54, "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": 93540, "totalSubmissionRaw": 206242}, "1791": {"acRate": 83.49014715832206, "difficulty": "Easy", "likes": 1281, "dislikes": 144, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 157950, "totalSubmissionRaw": 189184}, "1792": {"acRate": 52.94736842105263, "difficulty": "Medium", "likes": 695, "dislikes": 78, "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": 20120, "totalSubmissionRaw": 38000}, "1793": {"acRate": 53.97221489070711, "difficulty": "Hard", "likes": 1030, "dislikes": 33, "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": 22494, "totalSubmissionRaw": 41677}, "1794": {"acRate": 64.75225225225225, "difficulty": "Medium", "likes": 38, "dislikes": 50, "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": 1725, "totalSubmissionRaw": 2664}, "1795": {"acRate": 85.56916855001784, "difficulty": "Easy", "likes": 773, "dislikes": 52, "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": 107907, "totalSubmissionRaw": 126105}, "1796": {"acRate": 49.68925559926232, "difficulty": "Easy", "likes": 485, "dislikes": 122, "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": 46612, "totalSubmissionRaw": 93807}, "1797": {"acRate": 56.85864773573024, "difficulty": "Medium", "likes": 323, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19863, "totalSubmissionRaw": 34934}, "1798": {"acRate": 57.03556100551809, "difficulty": "Medium", "likes": 714, "dislikes": 52, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14884, "totalSubmissionRaw": 26096}, "1799": {"acRate": 58.24331539820101, "difficulty": "Hard", "likes": 1569, "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": 56721, "totalSubmissionRaw": 97387}, "1800": {"acRate": 62.53791444409581, "difficulty": "Easy", "likes": 677, "dislikes": 23, "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": 47834, "totalSubmissionRaw": 76488}, "1801": {"acRate": 48.966639544345, "difficulty": "Medium", "likes": 273, "dislikes": 226, "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": 18054, "totalSubmissionRaw": 36870}, "1802": {"acRate": 39.730884951525866, "difficulty": "Medium", "likes": 2446, "dislikes": 403, "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": 66554, "totalSubmissionRaw": 167512}, "1803": {"acRate": 47.49644995986911, "difficulty": "Hard", "likes": 487, "dislikes": 19, "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": 7692, "totalSubmissionRaw": 16196}, "1804": {"acRate": 61.54346744248363, "difficulty": "Medium", "likes": 291, "dislikes": 16, "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": 16077, "totalSubmissionRaw": 26123}, "1805": {"acRate": 37.01601386730854, "difficulty": "Easy", "likes": 575, "dislikes": 89, "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": 41214, "totalSubmissionRaw": 111341}, "1806": {"acRate": 72.21989616479651, "difficulty": "Medium", "likes": 303, "dislikes": 157, "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": 17249, "totalSubmissionRaw": 23884}, "1807": {"acRate": 66.68056918547596, "difficulty": "Medium", "likes": 459, "dislikes": 40, "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": 27179, "totalSubmissionRaw": 40760}, "1808": {"acRate": 32.014295333298804, "difficulty": "Hard", "likes": 214, "dislikes": 164, "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": 6181, "totalSubmissionRaw": 19307}, "1809": {"acRate": 58.43260188087774, "difficulty": "Easy", "likes": 81, "dislikes": 56, "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": 13980, "totalSubmissionRaw": 23925}, "1810": {"acRate": 54.83122362869198, "difficulty": "Medium", "likes": 75, "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": 2599, "totalSubmissionRaw": 4740}, "1811": {"acRate": 62.26127167630058, "difficulty": "Medium", "likes": 183, "dislikes": 23, "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": 13464, "totalSubmissionRaw": 21625}, "1812": {"acRate": 78.00009188642838, "difficulty": "Easy", "likes": 740, "dislikes": 15, "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": 67909, "totalSubmissionRaw": 87063}, "1813": {"acRate": 33.27535577140275, "difficulty": "Medium", "likes": 373, "dislikes": 59, "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": 14731, "totalSubmissionRaw": 44270}, "1814": {"acRate": 41.906774616025714, "difficulty": "Medium", "likes": 835, "dislikes": 34, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28153, "totalSubmissionRaw": 67187}, "1815": {"acRate": 40.048348106365836, "difficulty": "Hard", "likes": 327, "dislikes": 22, "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": 5964, "totalSubmissionRaw": 14892}, "1816": {"acRate": 83.97169215544574, "difficulty": "Easy", "likes": 1015, "dislikes": 28, "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": 128974, "totalSubmissionRaw": 153593}, "1817": {"acRate": 80.32061826872342, "difficulty": "Medium", "likes": 770, "dislikes": 287, "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": 51757, "totalSubmissionRaw": 64438}, "1818": {"acRate": 30.549225007663296, "difficulty": "Medium", "likes": 966, "dislikes": 69, "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": 22922, "totalSubmissionRaw": 75033}, "1819": {"acRate": 39.85330073349633, "difficulty": "Hard", "likes": 387, "dislikes": 40, "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": 8150, "totalSubmissionRaw": 20450}, "1820": {"acRate": 49.2861469239422, "difficulty": "Medium", "likes": 176, "dislikes": 53, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5696, "totalSubmissionRaw": 11557}, "1821": {"acRate": 88.55506479638888, "difficulty": "Easy", "likes": 55, "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": 18244, "totalSubmissionRaw": 20601}, "1822": {"acRate": 65.29958871320449, "difficulty": "Easy", "likes": 2050, "dislikes": 203, "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": 303090, "totalSubmissionRaw": 464153}, "1823": {"acRate": 78.10630059838086, "difficulty": "Medium", "likes": 2765, "dislikes": 55, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 108730, "totalSubmissionRaw": 139208}, "1824": {"acRate": 49.7850240517645, "difficulty": "Medium", "likes": 1112, "dislikes": 44, "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": 35085, "totalSubmissionRaw": 70473}, "1825": {"acRate": 35.84677662981089, "difficulty": "Hard", "likes": 369, "dislikes": 113, "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": 11866, "totalSubmissionRaw": 33102}, "1826": {"acRate": 49.69875656967056, "difficulty": "Easy", "likes": 58, "dislikes": 63, "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": 3877, "totalSubmissionRaw": 7801}, "1827": {"acRate": 78.72698820879307, "difficulty": "Easy", "likes": 1136, "dislikes": 53, "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": 78986, "totalSubmissionRaw": 100329}, "1828": {"acRate": 86.15733066771267, "difficulty": "Medium", "likes": 1083, "dislikes": 77, "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": 68091, "totalSubmissionRaw": 79031}, "1829": {"acRate": 77.06724458960349, "difficulty": "Medium", "likes": 719, "dislikes": 55, "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": 25248, "totalSubmissionRaw": 32761}, "1830": {"acRate": 49.56003406187908, "difficulty": "Hard", "likes": 170, "dislikes": 123, "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": 3492, "totalSubmissionRaw": 7046}, "1831": {"acRate": 81.51424694708277, "difficulty": "Medium", "likes": 77, "dislikes": 1, "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": 15019, "totalSubmissionRaw": 18425}, "1832": {"acRate": 83.09830263544626, "difficulty": "Easy", "likes": 2570, "dislikes": 50, "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": 271418, "totalSubmissionRaw": 326623}, "1833": {"acRate": 73.78983587344676, "difficulty": "Medium", "likes": 2100, "dislikes": 664, "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": 147331, "totalSubmissionRaw": 199663}, "1834": {"acRate": 45.584334642644905, "difficulty": "Medium", "likes": 2949, "dislikes": 252, "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": 94350, "totalSubmissionRaw": 206979}, "1835": {"acRate": 60.89653431425583, "difficulty": "Hard", "likes": 560, "dislikes": 46, "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": 16886, "totalSubmissionRaw": 27729}, "1836": {"acRate": 71.08083966056276, "difficulty": "Medium", "likes": 353, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25464, "totalSubmissionRaw": 35824}, "1837": {"acRate": 77.15454576190959, "difficulty": "Easy", "likes": 462, "dislikes": 39, "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": 45638, "totalSubmissionRaw": 59152}, "1838": {"acRate": 39.993850540174144, "difficulty": "Medium", "likes": 3011, "dislikes": 82, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 57231, "totalSubmissionRaw": 143100}, "1839": {"acRate": 49.01974826777434, "difficulty": "Medium", "likes": 690, "dislikes": 20, "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": 27379, "totalSubmissionRaw": 55853}, "1840": {"acRate": 36.016624740238434, "difficulty": "Hard", "likes": 348, "dislikes": 12, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6586, "totalSubmissionRaw": 18286}, "1841": {"acRate": 53.921349819220644, "difficulty": "Medium", "likes": 104, "dislikes": 95, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12080, "totalSubmissionRaw": 22403}, "1842": {"acRate": 53.026559604694256, "difficulty": "Hard", "likes": 113, "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": 5151, "totalSubmissionRaw": 9714}, "1843": {"acRate": 45.90314769975787, "difficulty": "Medium", "likes": 84, "dislikes": 55, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9479, "totalSubmissionRaw": 20650}, "1844": {"acRate": 80.54663823100235, "difficulty": "Easy", "likes": 764, "dislikes": 81, "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": 71759, "totalSubmissionRaw": 89090}, "1845": {"acRate": 67.09869500106967, "difficulty": "Medium", "likes": 657, "dislikes": 42, "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": 37638, "totalSubmissionRaw": 56093}, "1846": {"acRate": 59.2341156585109, "difficulty": "Medium", "likes": 344, "dislikes": 73, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21377, "totalSubmissionRaw": 36089}, "1847": {"acRate": 36.501030455690405, "difficulty": "Hard", "likes": 486, "dislikes": 20, "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": 7970, "totalSubmissionRaw": 21835}, "1848": {"acRate": 55.999646299407544, "difficulty": "Easy", "likes": 327, "dislikes": 58, "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": 37998, "totalSubmissionRaw": 67854}, "1849": {"acRate": 34.236700852321064, "difficulty": "Medium", "likes": 486, "dislikes": 107, "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": 22133, "totalSubmissionRaw": 64647}, "1850": {"acRate": 71.24113734376142, "difficulty": "Medium", "likes": 730, "dislikes": 92, "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": 19493, "totalSubmissionRaw": 27362}, "1851": {"acRate": 49.05727128943644, "difficulty": "Hard", "likes": 827, "dislikes": 21, "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": 23573, "totalSubmissionRaw": 48052}, "1852": {"acRate": 70.95702259636685, "difficulty": "Medium", "likes": 127, "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": 6406, "totalSubmissionRaw": 9028}, "1853": {"acRate": 86.19287811488368, "difficulty": "Easy", "likes": 57, "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": 11449, "totalSubmissionRaw": 13283}, "1854": {"acRate": 60.19564868765702, "difficulty": "Easy", "likes": 1164, "dislikes": 184, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56304, "totalSubmissionRaw": 93535}, "1855": {"acRate": 53.3854441745009, "difficulty": "Medium", "likes": 1141, "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"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45486, "totalSubmissionRaw": 85203}, "1856": {"acRate": 37.9820415879017, "difficulty": "Medium", "likes": 1346, "dislikes": 100, "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": 24111, "totalSubmissionRaw": 63480}, "1857": {"acRate": 50.941190423747486, "difficulty": "Hard", "likes": 2000, "dislikes": 65, "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": 60132, "totalSubmissionRaw": 118042}, "1858": {"acRate": 67.52421307506053, "difficulty": "Medium", "likes": 166, "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": 6693, "totalSubmissionRaw": 9912}, "1859": {"acRate": 83.15586329360552, "difficulty": "Easy", "likes": 1993, "dislikes": 66, "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": 134868, "totalSubmissionRaw": 162187}, "1860": {"acRate": 71.87276475785754, "difficulty": "Medium", "likes": 206, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17082, "totalSubmissionRaw": 23767}, "1861": {"acRate": 66.38874709318814, "difficulty": "Medium", "likes": 913, "dislikes": 50, "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": 46820, "totalSubmissionRaw": 70524}, "1862": {"acRate": 28.60909464456924, "difficulty": "Hard", "likes": 423, "dislikes": 35, "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": 8355, "totalSubmissionRaw": 29204}, "1863": {"acRate": 80.73966733870968, "difficulty": "Easy", "likes": 1503, "dislikes": 133, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64075, "totalSubmissionRaw": 79360}, "1864": {"acRate": 42.84101731983492, "difficulty": "Medium", "likes": 552, "dislikes": 34, "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": 24290, "totalSubmissionRaw": 56698}, "1865": {"acRate": 50.471284277776526, "difficulty": "Medium", "likes": 552, "dislikes": 97, "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": 22436, "totalSubmissionRaw": 44453}, "1866": {"acRate": 56.63359224172765, "difficulty": "Hard", "likes": 662, "dislikes": 20, "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": 12614, "totalSubmissionRaw": 22273}, "1867": {"acRate": 71.5707038368714, "difficulty": "Medium", "likes": 70, "dislikes": 253, "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": 14531, "totalSubmissionRaw": 20303}, "1868": {"acRate": 57.61831801157644, "difficulty": "Medium", "likes": 294, "dislikes": 48, "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": 27076, "totalSubmissionRaw": 46992}, "1869": {"acRate": 60.40590247463109, "difficulty": "Easy", "likes": 481, "dislikes": 12, "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": 42205, "totalSubmissionRaw": 69869}, "1870": {"acRate": 46.92352128594751, "difficulty": "Medium", "likes": 2211, "dislikes": 261, "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": 93413, "totalSubmissionRaw": 199075}, "1871": {"acRate": 24.81583735960344, "difficulty": "Medium", "likes": 1549, "dislikes": 86, "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": 39549, "totalSubmissionRaw": 159370}, "1872": {"acRate": 52.513966480446925, "difficulty": "Hard", "likes": 427, "dislikes": 21, "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": 8460, "totalSubmissionRaw": 16110}, "1873": {"acRate": 58.02858786067977, "difficulty": "Easy", "likes": 1014, "dislikes": 73, "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": 206839, "totalSubmissionRaw": 356442}, "1874": {"acRate": 89.4726125025453, "difficulty": "Medium", "likes": 231, "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": 17576, "totalSubmissionRaw": 19644}, "1875": {"acRate": 69.73156219731563, "difficulty": "Medium", "likes": 65, "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": 10079, "totalSubmissionRaw": 14454}, "1876": {"acRate": 72.22724669138707, "difficulty": "Easy", "likes": 1361, "dislikes": 35, "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": 95834, "totalSubmissionRaw": 132684}, "1877": {"acRate": 79.70508003999572, "difficulty": "Medium", "likes": 1232, "dislikes": 279, "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": 82105, "totalSubmissionRaw": 103011}, "1878": {"acRate": 47.28924015529673, "difficulty": "Medium", "likes": 192, "dislikes": 495, "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": 13642, "totalSubmissionRaw": 28848}, "1879": {"acRate": 46.363025962399284, "difficulty": "Hard", "likes": 642, "dislikes": 11, "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": 12429, "totalSubmissionRaw": 26808}, "1880": {"acRate": 73.71433693592174, "difficulty": "Easy", "likes": 520, "dislikes": 34, "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": 57565, "totalSubmissionRaw": 78092}, "1881": {"acRate": 37.44233688523382, "difficulty": "Medium", "likes": 359, "dislikes": 59, "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": 25405, "totalSubmissionRaw": 67851}, "1882": {"acRate": 39.64195444833894, "difficulty": "Medium", "likes": 843, "dislikes": 251, "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": 28388, "totalSubmissionRaw": 71611}, "1883": {"acRate": 37.45930302664898, "difficulty": "Hard", "likes": 321, "dislikes": 49, "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": 6213, "totalSubmissionRaw": 16586}, "1884": {"acRate": 72.08215471651704, "difficulty": "Medium", "likes": 1351, "dislikes": 125, "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": 41027, "totalSubmissionRaw": 56917}, "1885": {"acRate": 59.33125072312855, "difficulty": "Medium", "likes": 163, "dislikes": 12, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5128, "totalSubmissionRaw": 8643}, "1886": {"acRate": 56.262235502393246, "difficulty": "Easy", "likes": 1344, "dislikes": 106, "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": 60065, "totalSubmissionRaw": 106759}, "1887": {"acRate": 62.66735464247889, "difficulty": "Medium", "likes": 503, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 23076, "totalSubmissionRaw": 36823}, "1888": {"acRate": 39.486001942947986, "difficulty": "Medium", "likes": 1107, "dislikes": 51, "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": 22354, "totalSubmissionRaw": 56614}, "1889": {"acRate": 31.46778457184054, "difficulty": "Hard", "likes": 387, "dislikes": 33, "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": 11785, "totalSubmissionRaw": 37451}, "1890": {"acRate": 77.3710482529118, "difficulty": "Easy", "likes": 369, "dislikes": 7, "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": 70213, "totalSubmissionRaw": 90749}, "1891": {"acRate": 48.77888082624761, "difficulty": "Medium", "likes": 522, "dislikes": 35, "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": 54786, "totalSubmissionRaw": 112315}, "1892": {"acRate": 43.152902205827, "difficulty": "Hard", "likes": 76, "dislikes": 20, "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": 5732, "totalSubmissionRaw": 13283}, "1893": {"acRate": 49.909649439826524, "difficulty": "Easy", "likes": 538, "dislikes": 97, "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": 35906, "totalSubmissionRaw": 71942}, "1894": {"acRate": 44.88540613414223, "difficulty": "Medium", "likes": 544, "dislikes": 62, "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": 31962, "totalSubmissionRaw": 71208}, "1895": {"acRate": 51.92579043637314, "difficulty": "Medium", "likes": 275, "dislikes": 246, "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": 9936, "totalSubmissionRaw": 19133}, "1896": {"acRate": 53.84501187648456, "difficulty": "Hard", "likes": 225, "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": 3627, "totalSubmissionRaw": 6736}, "1897": {"acRate": 59.058422518692275, "difficulty": "Easy", "likes": 419, "dislikes": 47, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 32227, "totalSubmissionRaw": 54568}, "1898": {"acRate": 42.337101611680566, "difficulty": "Medium", "likes": 919, "dislikes": 118, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25691, "totalSubmissionRaw": 60682}, "1899": {"acRate": 65.30135757800662, "difficulty": "Medium", "likes": 700, "dislikes": 50, "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": 42233, "totalSubmissionRaw": 64674}, "1900": {"acRate": 50.55022715800101, "difficulty": "Hard", "likes": 222, "dislikes": 17, "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": 5007, "totalSubmissionRaw": 9905}, "1901": {"acRate": 50.591697186527504, "difficulty": "Medium", "likes": 1758, "dislikes": 114, "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": 47796, "totalSubmissionRaw": 94474}, "1902": {"acRate": 44.72601256226987, "difficulty": "Medium", "likes": 89, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "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"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2065, "totalSubmissionRaw": 4617}, "1903": {"acRate": 57.852728646428645, "difficulty": "Easy", "likes": 1194, "dislikes": 75, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 89589, "totalSubmissionRaw": 154857}, "1904": {"acRate": 44.29068027809557, "difficulty": "Medium", "likes": 200, "dislikes": 254, "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": 20131, "totalSubmissionRaw": 45452}, "1905": {"acRate": 67.49426706650203, "difficulty": "Medium", "likes": 1923, "dislikes": 57, "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": 76525, "totalSubmissionRaw": 113380}, "1906": {"acRate": 44.00017328019407, "difficulty": "Medium", "likes": 512, "dislikes": 35, "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": 10157, "totalSubmissionRaw": 23084}, "1907": {"acRate": 57.30129953229025, "difficulty": "Medium", "likes": 267, "dislikes": 57, "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": 37612, "totalSubmissionRaw": 65639}, "1908": {"acRate": 63.75282592313489, "difficulty": "Medium", "likes": 97, "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": 4230, "totalSubmissionRaw": 6635}, "1909": {"acRate": 26.67201962532573, "difficulty": "Easy", "likes": 1142, "dislikes": 314, "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": 54145, "totalSubmissionRaw": 203003}, "1910": {"acRate": 76.2736292611764, "difficulty": "Medium", "likes": 1622, "dislikes": 53, "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": 86791, "totalSubmissionRaw": 113789}, "1911": {"acRate": 59.201729849828396, "difficulty": "Medium", "likes": 1115, "dislikes": 19, "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": 29843, "totalSubmissionRaw": 50409}, "1912": {"acRate": 36.14200724262804, "difficulty": "Hard", "likes": 226, "dislikes": 44, "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": 5589, "totalSubmissionRaw": 15464}, "1913": {"acRate": 81.02903834885083, "difficulty": "Easy", "likes": 822, "dislikes": 47, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 99562, "totalSubmissionRaw": 122872}, "1914": {"acRate": 48.69627688796856, "difficulty": "Medium", "likes": 221, "dislikes": 267, "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": 11523, "totalSubmissionRaw": 23663}, "1915": {"acRate": 46.389872331294924, "difficulty": "Medium", "likes": 925, "dislikes": 60, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12972, "totalSubmissionRaw": 27963}, "1916": {"acRate": 49.26631283172026, "difficulty": "Hard", "likes": 451, "dislikes": 48, "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": 6312, "totalSubmissionRaw": 12812}, "1917": {"acRate": 26.793778223783242, "difficulty": "Hard", "likes": 58, "dislikes": 52, "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": 5340, "totalSubmissionRaw": 19930}, "1918": {"acRate": 52.608386638237384, "difficulty": "Medium", "likes": 187, "dislikes": 10, "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": 3701, "totalSubmissionRaw": 7035}, "1919": {"acRate": 41.34745992936702, "difficulty": "Hard", "likes": 52, "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": 4566, "totalSubmissionRaw": 11043}, "1920": {"acRate": 89.51608127816829, "difficulty": "Easy", "likes": 3016, "dislikes": 336, "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": 408161, "totalSubmissionRaw": 455964}, "1921": {"acRate": 38.30095238095238, "difficulty": "Medium", "likes": 529, "dislikes": 84, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25135, "totalSubmissionRaw": 65625}, "1922": {"acRate": 42.51493039840153, "difficulty": "Medium", "likes": 1146, "dislikes": 376, "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": 38513, "totalSubmissionRaw": 90587}, "1923": {"acRate": 27.655662348516508, "difficulty": "Hard", "likes": 456, "dislikes": 34, "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": 6618, "totalSubmissionRaw": 23930}, "1924": {"acRate": 51.94174757281553, "difficulty": "Hard", "likes": 13, "dislikes": 40, "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": 642, "totalSubmissionRaw": 1236}, "1925": {"acRate": 67.51746372917786, "difficulty": "Easy", "likes": 385, "dislikes": 38, "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": 37695, "totalSubmissionRaw": 55830}, "1926": {"acRate": 47.465546079095425, "difficulty": "Medium", "likes": 2079, "dislikes": 79, "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": 103014, "totalSubmissionRaw": 217028}, "1927": {"acRate": 47.029411764705884, "difficulty": "Medium", "likes": 462, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9585, "totalSubmissionRaw": 20389}, "1928": {"acRate": 37.806316935923036, "difficulty": "Hard", "likes": 736, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16662, "totalSubmissionRaw": 44072}, "1929": {"acRate": 89.55346303476514, "difficulty": "Easy", "likes": 2876, "dislikes": 337, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 548079, "totalSubmissionRaw": 612014}, "1930": {"acRate": 53.778683602351094, "difficulty": "Medium", "likes": 782, "dislikes": 22, "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": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29553, "totalSubmissionRaw": 54953}, "1931": {"acRate": 57.44766776603621, "difficulty": "Hard", "likes": 450, "dislikes": 20, "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": 8535, "totalSubmissionRaw": 14857}, "1932": {"acRate": 35.73290845886443, "difficulty": "Hard", "likes": 531, "dislikes": 39, "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": 7401, "totalSubmissionRaw": 20712}, "1933": {"acRate": 50.56818181818182, "difficulty": "Easy", "likes": 52, "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": 3293, "totalSubmissionRaw": 6512}, "1934": {"acRate": 56.86265745268597, "difficulty": "Medium", "likes": 499, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63606, "totalSubmissionRaw": 111859}, "1935": {"acRate": 72.21467587641975, "difficulty": "Easy", "likes": 542, "dislikes": 25, "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": 49974, "totalSubmissionRaw": 69202}, "1936": {"acRate": 43.17124588393121, "difficulty": "Medium", "likes": 345, "dislikes": 25, "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": 24779, "totalSubmissionRaw": 57397}, "1937": {"acRate": 35.80095097556977, "difficulty": "Medium", "likes": 2238, "dislikes": 134, "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": 56771, "totalSubmissionRaw": 158574}, "1938": {"acRate": 40.84604118204532, "difficulty": "Hard", "likes": 361, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "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": 4741, "totalSubmissionRaw": 11607}, "1939": {"acRate": 57.016717683070404, "difficulty": "Easy", "likes": 55, "dislikes": 46, "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": 9686, "totalSubmissionRaw": 16988}, "1940": {"acRate": 78.83863763260747, "difficulty": "Medium", "likes": 141, "dislikes": 6, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 5648, "totalSubmissionRaw": 7164}, "1941": {"acRate": 77.00490335129878, "difficulty": "Easy", "likes": 787, "dislikes": 20, "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": 76010, "totalSubmissionRaw": 98708}, "1942": {"acRate": 41.21253038077234, "difficulty": "Medium", "likes": 536, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15261, "totalSubmissionRaw": 37030}, "1943": {"acRate": 48.795843789900054, "difficulty": "Medium", "likes": 442, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11083, "totalSubmissionRaw": 22713}, "1944": {"acRate": 68.35759268576187, "difficulty": "Hard", "likes": 1531, "dislikes": 42, "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": 39401, "totalSubmissionRaw": 57640}, "1945": {"acRate": 61.80971659919028, "difficulty": "Easy", "likes": 563, "dislikes": 59, "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": 45801, "totalSubmissionRaw": 74100}, "1946": {"acRate": 35.1648143590132, "difficulty": "Medium", "likes": 205, "dislikes": 218, "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": 18573, "totalSubmissionRaw": 52817}, "1947": {"acRate": 61.70782589084348, "difficulty": "Medium", "likes": 732, "dislikes": 20, "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": 21889, "totalSubmissionRaw": 35472}, "1948": {"acRate": 56.45919384703034, "difficulty": "Hard", "likes": 298, "dislikes": 65, "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": 7928, "totalSubmissionRaw": 14042}, "1949": {"acRate": 55.13516447725546, "difficulty": "Medium", "likes": 135, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10157, "totalSubmissionRaw": 18422}, "1950": {"acRate": 49.63113242345998, "difficulty": "Medium", "likes": 128, "dislikes": 51, "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": 2691, "totalSubmissionRaw": 5422}, "1951": {"acRate": 69.24975997805514, "difficulty": "Medium", "likes": 87, "dislikes": 6, "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": 10098, "totalSubmissionRaw": 14582}, "1952": {"acRate": 59.13918762776642, "difficulty": "Easy", "likes": 476, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53230, "totalSubmissionRaw": 90008}, "1953": {"acRate": 39.901854079547846, "difficulty": "Medium", "likes": 601, "dislikes": 134, "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": 20897, "totalSubmissionRaw": 52371}, "1954": {"acRate": 53.48977349260926, "difficulty": "Medium", "likes": 348, "dislikes": 85, "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": 15090, "totalSubmissionRaw": 28211}, "1955": {"acRate": 51.12431264728987, "difficulty": "Hard", "likes": 486, "dislikes": 8, "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": 10413, "totalSubmissionRaw": 20368}, "1956": {"acRate": 49.55647545830869, "difficulty": "Hard", "likes": 29, "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": 838, "totalSubmissionRaw": 1691}, "1957": {"acRate": 57.17738834258089, "difficulty": "Easy", "likes": 400, "dislikes": 21, "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": 31224, "totalSubmissionRaw": 54609}, "1958": {"acRate": 46.4968702784373, "difficulty": "Medium", "likes": 132, "dislikes": 250, "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": 10771, "totalSubmissionRaw": 23165}, "1959": {"acRate": 42.406601480811624, "difficulty": "Medium", "likes": 538, "dislikes": 46, "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": 7503, "totalSubmissionRaw": 17693}, "1960": {"acRate": 30.20772094846169, "difficulty": "Hard", "likes": 226, "dislikes": 39, "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": 3083, "totalSubmissionRaw": 10206}, "1961": {"acRate": 52.91290630273681, "difficulty": "Easy", "likes": 445, "dislikes": 80, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43269, "totalSubmissionRaw": 81774}, "1962": {"acRate": 61.05770584095708, "difficulty": "Medium", "likes": 1728, "dislikes": 144, "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": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86763, "totalSubmissionRaw": 142100}, "1963": {"acRate": 70.26125901965663, "difficulty": "Medium", "likes": 1625, "dislikes": 56, "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": 56473, "totalSubmissionRaw": 80377}, "1964": {"acRate": 63.34993861554443, "difficulty": "Hard", "likes": 1703, "dislikes": 68, "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": 53665, "totalSubmissionRaw": 84712}, "1965": {"acRate": 72.32183782230645, "difficulty": "Easy", "likes": 641, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105715, "totalSubmissionRaw": 146173}, "1966": {"acRate": 65.14479519958257, "difficulty": "Medium", "likes": 66, "dislikes": 9, "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": 2497, "totalSubmissionRaw": 3833}, "1967": {"acRate": 80.13495652173913, "difficulty": "Easy", "likes": 632, "dislikes": 34, "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": 57597, "totalSubmissionRaw": 71875}, "1968": {"acRate": 49.43346290629394, "difficulty": "Medium", "likes": 547, "dislikes": 38, "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": 29885, "totalSubmissionRaw": 60455}, "1969": {"acRate": 34.64244460779166, "difficulty": "Medium", "likes": 207, "dislikes": 355, "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": 9897, "totalSubmissionRaw": 28569}, "1970": {"acRate": 62.52484137435652, "difficulty": "Hard", "likes": 1804, "dislikes": 31, "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": 52224, "totalSubmissionRaw": 83527}, "1971": {"acRate": 51.515875453625014, "difficulty": "Easy", "likes": 3259, "dislikes": 160, "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": 271703, "totalSubmissionRaw": 527417}, "1972": {"acRate": 50.1338199513382, "difficulty": "Hard", "likes": 127, "dislikes": 39, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 8242, "totalSubmissionRaw": 16440}, "1973": {"acRate": 75.15923566878982, "difficulty": "Medium", "likes": 151, "dislikes": 7, "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 Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8614, "totalSubmissionRaw": 11461}, "1974": {"acRate": 73.67261694478502, "difficulty": "Easy", "likes": 634, "dislikes": 24, "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": 35452, "totalSubmissionRaw": 48121}, "1975": {"acRate": 48.882981900722775, "difficulty": "Medium", "likes": 520, "dislikes": 19, "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": 16367, "totalSubmissionRaw": 33482}, "1976": {"acRate": 28.540858889435395, "difficulty": "Medium", "likes": 2462, "dislikes": 98, "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": 44681, "totalSubmissionRaw": 156548}, "1977": {"acRate": 20.34745089133644, "difficulty": "Hard", "likes": 482, "dislikes": 55, "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": 5376, "totalSubmissionRaw": 26419}, "1978": {"acRate": 47.253261022020666, "difficulty": "Easy", "likes": 232, "dislikes": 20, "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": 40418, "totalSubmissionRaw": 85538}, "1979": {"acRate": 77.3467465430843, "difficulty": "Easy", "likes": 1009, "dislikes": 40, "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": 102643, "totalSubmissionRaw": 132705}, "1980": {"acRate": 66.39659434221367, "difficulty": "Medium", "likes": 1055, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43515, "totalSubmissionRaw": 65538}, "1981": {"acRate": 33.157147475997014, "difficulty": "Medium", "likes": 874, "dislikes": 133, "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": 23587, "totalSubmissionRaw": 71137}, "1982": {"acRate": 48.21537213546948, "difficulty": "Hard", "likes": 540, "dislikes": 34, "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": 4755, "totalSubmissionRaw": 9862}, "1983": {"acRate": 53.94088669950739, "difficulty": "Medium", "likes": 83, "dislikes": 0, "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": 2190, "totalSubmissionRaw": 4060}, "1984": {"acRate": 55.46482954490938, "difficulty": "Easy", "likes": 894, "dislikes": 216, "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": 57806, "totalSubmissionRaw": 104221}, "1985": {"acRate": 44.75698305749984, "difficulty": "Medium", "likes": 1131, "dislikes": 131, "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": 54736, "totalSubmissionRaw": 122296}, "1986": {"acRate": 33.08161235930767, "difficulty": "Medium", "likes": 1031, "dislikes": 65, "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": 22955, "totalSubmissionRaw": 69389}, "1987": {"acRate": 52.09234507897934, "difficulty": "Hard", "likes": 643, "dislikes": 13, "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": 10718, "totalSubmissionRaw": 20575}, "1988": {"acRate": 67.33310273261847, "difficulty": "Medium", "likes": 75, "dislikes": 149, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 9732, "totalSubmissionRaw": 14454}, "1989": {"acRate": 51.18392070484582, "difficulty": "Medium", "likes": 66, "dislikes": 10, "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": 1859, "totalSubmissionRaw": 3632}, "1990": {"acRate": 49.76903336184773, "difficulty": "Medium", "likes": 19, "dislikes": 183, "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": 5816, "totalSubmissionRaw": 11688}, "1991": {"acRate": 67.42619535277915, "difficulty": "Easy", "likes": 1243, "dislikes": 55, "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": 76375, "totalSubmissionRaw": 113272}, "1992": {"acRate": 68.26864175530434, "difficulty": "Medium", "likes": 754, "dislikes": 23, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24518, "totalSubmissionRaw": 35914}, "1993": {"acRate": 44.982379306805356, "difficulty": "Medium", "likes": 416, "dislikes": 67, "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": 13146, "totalSubmissionRaw": 29224}, "1994": {"acRate": 34.49136675681298, "difficulty": "Hard", "likes": 430, "dislikes": 12, "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": 6632, "totalSubmissionRaw": 19228}, "1995": {"acRate": 60.22534050117652, "difficulty": "Easy", "likes": 578, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35065, "totalSubmissionRaw": 58223}, "1996": {"acRate": 43.94546555531809, "difficulty": "Medium", "likes": 2934, "dislikes": 89, "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": 98698, "totalSubmissionRaw": 224592}, "1997": {"acRate": 36.770376862401406, "difficulty": "Medium", "likes": 462, "dislikes": 89, "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": 8391, "totalSubmissionRaw": 22820}, "1998": {"acRate": 45.383555351401014, "difficulty": "Hard", "likes": 455, "dislikes": 13, "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": 7904, "totalSubmissionRaw": 17416}, "1999": {"acRate": 50.17006802721088, "difficulty": "Medium", "likes": 25, "dislikes": 9, "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": 1475, "totalSubmissionRaw": 2940}, "2000": {"acRate": 79.8235737573307, "difficulty": "Easy", "likes": 780, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 81531, "totalSubmissionRaw": 102139}, "2001": {"acRate": 47.8574028022078, "difficulty": "Medium", "likes": 468, "dislikes": 37, "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": 31561, "totalSubmissionRaw": 65948}, "2002": {"acRate": 56.74098611288062, "difficulty": "Medium", "likes": 838, "dislikes": 61, "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": 22268, "totalSubmissionRaw": 39245}, "2003": {"acRate": 46.109939198411716, "difficulty": "Hard", "likes": 426, "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": 7432, "totalSubmissionRaw": 16118}, "2004": {"acRate": 40.69106881405563, "difficulty": "Hard", "likes": 106, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 6948, "totalSubmissionRaw": 17075}, "2005": {"acRate": 60.83150984682714, "difficulty": "Hard", "likes": 15, "dislikes": 43, "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": 556, "totalSubmissionRaw": 914}, "2006": {"acRate": 83.0604578637749, "difficulty": "Easy", "likes": 1472, "dislikes": 31, "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": 117190, "totalSubmissionRaw": 141090}, "2007": {"acRate": 40.47575724098492, "difficulty": "Medium", "likes": 2342, "dislikes": 112, "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": 124567, "totalSubmissionRaw": 307759}, "2008": {"acRate": 43.50000844922858, "difficulty": "Medium", "likes": 1149, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 25741, "totalSubmissionRaw": 59176}, "2009": {"acRate": 53.68473467065016, "difficulty": "Hard", "likes": 1736, "dislikes": 45, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67922, "totalSubmissionRaw": 126521}, "2010": {"acRate": 60.163233579479204, "difficulty": "Hard", "likes": 33, "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": 4644, "totalSubmissionRaw": 7719}, "2011": {"acRate": 88.52500015437911, "difficulty": "Easy", "likes": 1418, "dislikes": 160, "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": 286713, "totalSubmissionRaw": 323878}, "2012": {"acRate": 47.471801298849265, "difficulty": "Medium", "likes": 566, "dislikes": 57, "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": 20833, "totalSubmissionRaw": 43885}, "2013": {"acRate": 50.45860164714425, "difficulty": "Medium", "likes": 757, "dislikes": 198, "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": 52813, "totalSubmissionRaw": 104666}, "2014": {"acRate": 54.802494802494806, "difficulty": "Hard", "likes": 419, "dislikes": 74, "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": 6590, "totalSubmissionRaw": 12025}, "2015": {"acRate": 58.89732585011554, "difficulty": "Medium", "likes": 47, "dislikes": 26, "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": 1784, "totalSubmissionRaw": 3029}, "2016": {"acRate": 54.9785318337659, "difficulty": "Easy", "likes": 918, "dislikes": 28, "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": 68633, "totalSubmissionRaw": 124836}, "2017": {"acRate": 44.78897308479302, "difficulty": "Medium", "likes": 843, "dislikes": 26, "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": 19919, "totalSubmissionRaw": 44473}, "2018": {"acRate": 49.17015791169836, "difficulty": "Medium", "likes": 269, "dislikes": 285, "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": 18309, "totalSubmissionRaw": 37236}, "2019": {"acRate": 33.39929181420537, "difficulty": "Hard", "likes": 251, "dislikes": 77, "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": 6414, "totalSubmissionRaw": 19204}, "2020": {"acRate": 71.997666472206, "difficulty": "Medium", "likes": 26, "dislikes": 200, "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": 8638, "totalSubmissionRaw": 11998}, "2021": {"acRate": 62.48591813743898, "difficulty": "Medium", "likes": 144, "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": 4992, "totalSubmissionRaw": 7989}, "2022": {"acRate": 60.195289559721964, "difficulty": "Easy", "likes": 712, "dislikes": 52, "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": 68675, "totalSubmissionRaw": 114087}, "2023": {"acRate": 73.95014419468258, "difficulty": "Medium", "likes": 648, "dislikes": 48, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37438, "totalSubmissionRaw": 50626}, "2024": {"acRate": 67.22315932125197, "difficulty": "Medium", "likes": 2691, "dislikes": 37, "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": 93256, "totalSubmissionRaw": 138726}, "2025": {"acRate": 33.54735826094255, "difficulty": "Hard", "likes": 432, "dislikes": 46, "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": 7994, "totalSubmissionRaw": 23829}, "2026": {"acRate": 84.14523199073692, "difficulty": "Easy", "likes": 48, "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": 10174, "totalSubmissionRaw": 12091}, "2027": {"acRate": 54.31396829272547, "difficulty": "Easy", "likes": 436, "dislikes": 68, "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": 31142, "totalSubmissionRaw": 57337}, "2028": {"acRate": 45.28760565487321, "difficulty": "Medium", "likes": 442, "dislikes": 29, "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": 24218, "totalSubmissionRaw": 53476}, "2029": {"acRate": 27.514591071022508, "difficulty": "Medium", "likes": 216, "dislikes": 264, "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": 7260, "totalSubmissionRaw": 26386}, "2030": {"acRate": 38.61679082791779, "difficulty": "Hard", "likes": 446, "dislikes": 11, "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": 7309, "totalSubmissionRaw": 18927}, "2031": {"acRate": 52.32558139534884, "difficulty": "Medium", "likes": 152, "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": 3420, "totalSubmissionRaw": 6536}, "2032": {"acRate": 74.31236673773988, "difficulty": "Easy", "likes": 685, "dislikes": 44, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55764, "totalSubmissionRaw": 75040}, "2033": {"acRate": 52.681806583312074, "difficulty": "Medium", "likes": 512, "dislikes": 39, "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": 20646, "totalSubmissionRaw": 39190}, "2034": {"acRate": 48.74902800157123, "difficulty": "Medium", "likes": 1086, "dislikes": 57, "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": 60811, "totalSubmissionRaw": 124743}, "2035": {"acRate": 19.370886506195347, "difficulty": "Hard", "likes": 2629, "dislikes": 143, "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": 18807, "totalSubmissionRaw": 97089}, "2036": {"acRate": 40.98625707356508, "difficulty": "Medium", "likes": 87, "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": 2535, "totalSubmissionRaw": 6185}, "2037": {"acRate": 81.61175170694393, "difficulty": "Easy", "likes": 716, "dislikes": 136, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57613, "totalSubmissionRaw": 70594}, "2038": {"acRate": 62.9764001936292, "difficulty": "Medium", "likes": 1462, "dislikes": 109, "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": 126194, "totalSubmissionRaw": 200383}, "2039": {"acRate": 51.27085478887745, "difficulty": "Medium", "likes": 606, "dislikes": 49, "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": 12446, "totalSubmissionRaw": 24275}, "2040": {"acRate": 28.54684458487319, "difficulty": "Hard", "likes": 651, "dislikes": 36, "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": 10119, "totalSubmissionRaw": 35447}, "2041": {"acRate": 78.17019492768812, "difficulty": "Medium", "likes": 44, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7459, "totalSubmissionRaw": 9542}, "2042": {"acRate": 68.13989293331637, "difficulty": "Easy", "likes": 564, "dislikes": 19, "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": 48241, "totalSubmissionRaw": 70797}, "2043": {"acRate": 64.6230794573063, "difficulty": "Medium", "likes": 214, "dislikes": 196, "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": 21577, "totalSubmissionRaw": 33389}, "2044": {"acRate": 76.53090378083236, "difficulty": "Medium", "likes": 571, "dislikes": 20, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24108, "totalSubmissionRaw": 31501}, "2045": {"acRate": 39.87379687687208, "difficulty": "Hard", "likes": 653, "dislikes": 10, "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": 9984, "totalSubmissionRaw": 25039}, "2046": {"acRate": 67.93901384083046, "difficulty": "Medium", "likes": 150, "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": 6283, "totalSubmissionRaw": 9246}, "2047": {"acRate": 28.879823415885635, "difficulty": "Easy", "likes": 268, "dislikes": 756, "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": 24989, "totalSubmissionRaw": 86530}, "2048": {"acRate": 47.344065182138195, "difficulty": "Medium", "likes": 178, "dislikes": 269, "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": 11970, "totalSubmissionRaw": 25283}, "2049": {"acRate": 47.56925242572018, "difficulty": "Medium", "likes": 920, "dislikes": 54, "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": 18924, "totalSubmissionRaw": 39782}, "2050": {"acRate": 59.463387367244266, "difficulty": "Hard", "likes": 749, "dislikes": 21, "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": 21276, "totalSubmissionRaw": 35780}, "2051": {"acRate": 69.63243243243244, "difficulty": "Medium", "likes": 50, "dislikes": 6, "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": 6441, "totalSubmissionRaw": 9250}, "2052": {"acRate": 49.76392823418319, "difficulty": "Medium", "likes": 37, "dislikes": 12, "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": 1581, "totalSubmissionRaw": 3177}, "2053": {"acRate": 72.17066343064384, "difficulty": "Easy", "likes": 700, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 52336, "totalSubmissionRaw": 72517}, "2054": {"acRate": 45.95563972339388, "difficulty": "Medium", "likes": 769, "dislikes": 18, "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": 16015, "totalSubmissionRaw": 34850}, "2055": {"acRate": 44.43990918135667, "difficulty": "Medium", "likes": 1057, "dislikes": 43, "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": 34840, "totalSubmissionRaw": 78398}, "2056": {"acRate": 53.58067299396031, "difficulty": "Hard", "likes": 56, "dislikes": 279, "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": 3726, "totalSubmissionRaw": 6954}, "2057": {"acRate": 72.25120298252966, "difficulty": "Easy", "likes": 359, "dislikes": 126, "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": 50000, "totalSubmissionRaw": 69203}, "2058": {"acRate": 57.52107373762174, "difficulty": "Medium", "likes": 589, "dislikes": 22, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28113, "totalSubmissionRaw": 48873}, "2059": {"acRate": 48.388364779874216, "difficulty": "Medium", "likes": 612, "dislikes": 31, "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": 14772, "totalSubmissionRaw": 30528}, "2060": {"acRate": 40.772962354167504, "difficulty": "Hard", "likes": 275, "dislikes": 131, "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": 10170, "totalSubmissionRaw": 24943}, "2061": {"acRate": 54.09836065573771, "difficulty": "Medium", "likes": 79, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 3795, "totalSubmissionRaw": 7015}, "2062": {"acRate": 66.80666243264838, "difficulty": "Easy", "likes": 849, "dislikes": 197, "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": 32608, "totalSubmissionRaw": 48810}, "2063": {"acRate": 54.37945791726106, "difficulty": "Medium", "likes": 768, "dislikes": 24, "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": 24778, "totalSubmissionRaw": 45565}, "2064": {"acRate": 51.48625669945544, "difficulty": "Medium", "likes": 938, "dislikes": 33, "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": 23920, "totalSubmissionRaw": 46459}, "2065": {"acRate": 57.641707029715924, "difficulty": "Hard", "likes": 580, "dislikes": 41, "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": 17613, "totalSubmissionRaw": 30556}, "2066": {"acRate": 83.22336398053002, "difficulty": "Medium", "likes": 64, "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": 7694, "totalSubmissionRaw": 9245}, "2067": {"acRate": 47.707612456747405, "difficulty": "Medium", "likes": 94, "dislikes": 6, "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": 2206, "totalSubmissionRaw": 4624}, "2068": {"acRate": 63.47520306891992, "difficulty": "Easy", "likes": 482, "dislikes": 19, "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": 43683, "totalSubmissionRaw": 68819}, "2069": {"acRate": 24.130911368618854, "difficulty": "Medium", "likes": 152, "dislikes": 297, "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": 9246, "totalSubmissionRaw": 38316}, "2070": {"acRate": 49.363963655066, "difficulty": "Medium", "likes": 551, "dislikes": 13, "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": 14397, "totalSubmissionRaw": 29165}, "2071": {"acRate": 33.79961531736318, "difficulty": "Hard", "likes": 478, "dislikes": 19, "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": 7732, "totalSubmissionRaw": 22876}, "2072": {"acRate": 72.62948207171314, "difficulty": "Easy", "likes": 58, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9115, "totalSubmissionRaw": 12550}, "2073": {"acRate": 62.67528863782766, "difficulty": "Easy", "likes": 829, "dislikes": 65, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 50594, "totalSubmissionRaw": 80724}, "2074": {"acRate": 55.492879084054735, "difficulty": "Medium", "likes": 592, "dislikes": 308, "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": 19872, "totalSubmissionRaw": 35810}, "2075": {"acRate": 49.4183895762259, "difficulty": "Medium", "likes": 231, "dislikes": 47, "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": 12023, "totalSubmissionRaw": 24329}, "2076": {"acRate": 54.043677351179994, "difficulty": "Hard", "likes": 573, "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": 15343, "totalSubmissionRaw": 28390}, "2077": {"acRate": 54.80692833306849, "difficulty": "Medium", "likes": 114, "dislikes": 7, "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": 3449, "totalSubmissionRaw": 6293}, "2078": {"acRate": 66.57065449878796, "difficulty": "Easy", "likes": 842, "dislikes": 22, "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": 46686, "totalSubmissionRaw": 70130}, "2079": {"acRate": 79.57431933817533, "difficulty": "Medium", "likes": 811, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40976, "totalSubmissionRaw": 51494}, "2080": {"acRate": 39.228268125148034, "difficulty": "Medium", "likes": 595, "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": 18218, "totalSubmissionRaw": 46441}, "2081": {"acRate": 42.10063446196369, "difficulty": "Hard", "likes": 116, "dislikes": 145, "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": 6702, "totalSubmissionRaw": 15919}, "2082": {"acRate": 77.61660978384528, "difficulty": "Easy", "likes": 91, "dislikes": 24, "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": 19103, "totalSubmissionRaw": 24612}, "2083": {"acRate": 68.0033120416371, "difficulty": "Medium", "likes": 107, "dislikes": 6, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 5749, "totalSubmissionRaw": 8454}, "2084": {"acRate": 87.27538654408691, "difficulty": "Medium", "likes": 72, "dislikes": 17, "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": 8354, "totalSubmissionRaw": 9572}, "2085": {"acRate": 69.82209101833952, "difficulty": "Easy", "likes": 724, "dislikes": 15, "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": 53453, "totalSubmissionRaw": 76556}, "2086": {"acRate": 45.27165232984953, "difficulty": "Medium", "likes": 498, "dislikes": 21, "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": 16157, "totalSubmissionRaw": 35689}, "2087": {"acRate": 51.05689997720092, "difficulty": "Medium", "likes": 620, "dislikes": 83, "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"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15676, "totalSubmissionRaw": 30703}, "2088": {"acRate": 63.469119579500656, "difficulty": "Hard", "likes": 328, "dislikes": 12, "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": 7243, "totalSubmissionRaw": 11413}, "2089": {"acRate": 75.76363900408242, "difficulty": "Easy", "likes": 1649, "dislikes": 77, "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": 140859, "totalSubmissionRaw": 185919}, "2090": {"acRate": 47.49407422537419, "difficulty": "Medium", "likes": 1792, "dislikes": 86, "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": 99980, "totalSubmissionRaw": 210513}, "2091": {"acRate": 54.557538348713564, "difficulty": "Medium", "likes": 879, "dislikes": 43, "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": 35709, "totalSubmissionRaw": 65452}, "2092": {"acRate": 34.1928267839833, "difficulty": "Hard", "likes": 769, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 22928, "totalSubmissionRaw": 67055}, "2093": {"acRate": 55.48691860465116, "difficulty": "Medium", "likes": 178, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 4581, "totalSubmissionRaw": 8256}, "2094": {"acRate": 58.74308335957533, "difficulty": "Easy", "likes": 518, "dislikes": 248, "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": 26116, "totalSubmissionRaw": 44458}, "2095": {"acRate": 58.78579079294619, "difficulty": "Medium", "likes": 3663, "dislikes": 65, "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": 266184, "totalSubmissionRaw": 452803}, "2096": {"acRate": 48.64117742899039, "difficulty": "Medium", "likes": 2217, "dislikes": 110, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 89563, "totalSubmissionRaw": 184130}, "2097": {"acRate": 42.10127732619781, "difficulty": "Hard", "likes": 460, "dislikes": 24, "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": 8339, "totalSubmissionRaw": 19807}, "2098": {"acRate": 37.35203857957036, "difficulty": "Medium", "likes": 73, "dislikes": 5, "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": 2556, "totalSubmissionRaw": 6843}, "2099": {"acRate": 42.7588821490468, "difficulty": "Easy", "likes": 1121, "dislikes": 103, "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": 39475, "totalSubmissionRaw": 92320}, "2100": {"acRate": 49.39358414153256, "difficulty": "Medium", "likes": 826, "dislikes": 43, "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": 23173, "totalSubmissionRaw": 46915}, "2101": {"acRate": 49.135065531388186, "difficulty": "Medium", "likes": 2773, "dislikes": 136, "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": 98448, "totalSubmissionRaw": 200362}, "2102": {"acRate": 64.73001335622973, "difficulty": "Hard", "likes": 355, "dislikes": 40, "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": 13570, "totalSubmissionRaw": 20964}, "2103": {"acRate": 80.8148282660579, "difficulty": "Easy", "likes": 873, "dislikes": 13, "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": 62305, "totalSubmissionRaw": 77096}, "2104": {"acRate": 60.93872289489434, "difficulty": "Medium", "likes": 2098, "dislikes": 102, "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": 79417, "totalSubmissionRaw": 130324}, "2105": {"acRate": 48.637791043087105, "difficulty": "Medium", "likes": 250, "dislikes": 151, "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": 17192, "totalSubmissionRaw": 35347}, "2106": {"acRate": 35.46567011064703, "difficulty": "Hard", "likes": 512, "dislikes": 16, "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": 9680, "totalSubmissionRaw": 27294}, "2107": {"acRate": 55.90087345114767, "difficulty": "Medium", "likes": 70, "dislikes": 3, "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": 2752, "totalSubmissionRaw": 4923}, "2108": {"acRate": 78.93363619620602, "difficulty": "Easy", "likes": 939, "dislikes": 30, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 102860, "totalSubmissionRaw": 130312}, "2109": {"acRate": 56.68361171629146, "difficulty": "Medium", "likes": 515, "dislikes": 51, "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": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35124, "totalSubmissionRaw": 61965}, "2110": {"acRate": 58.34857732780323, "difficulty": "Medium", "likes": 656, "dislikes": 26, "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": 32216, "totalSubmissionRaw": 55213}, "2111": {"acRate": 38.067283811244074, "difficulty": "Hard", "likes": 669, "dislikes": 11, "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": 11802, "totalSubmissionRaw": 31003}, "2112": {"acRate": 68.78923766816143, "difficulty": "Medium", "likes": 59, "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": 6903, "totalSubmissionRaw": 10035}, "2113": {"acRate": 73.50390286209887, "difficulty": "Medium", "likes": 54, "dislikes": 7, "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": 1695, "totalSubmissionRaw": 2306}, "2114": {"acRate": 86.43906051386975, "difficulty": "Easy", "likes": 1591, "dislikes": 51, "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": 226447, "totalSubmissionRaw": 261973}, "2115": {"acRate": 48.946997015466486, "difficulty": "Medium", "likes": 1685, "dislikes": 83, "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": 75605, "totalSubmissionRaw": 154463}, "2116": {"acRate": 30.827439284192586, "difficulty": "Medium", "likes": 997, "dislikes": 32, "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": 18088, "totalSubmissionRaw": 58675}, "2117": {"acRate": 26.50955980435749, "difficulty": "Hard", "likes": 84, "dislikes": 145, "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": 2981, "totalSubmissionRaw": 11245}, "2118": {"acRate": 55.44246536612949, "difficulty": "Hard", "likes": 19, "dislikes": 32, "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": 1961, "totalSubmissionRaw": 3537}, "2119": {"acRate": 78.28517430607738, "difficulty": "Easy", "likes": 603, "dislikes": 34, "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": 68761, "totalSubmissionRaw": 87834}, "2120": {"acRate": 82.55821059707877, "difficulty": "Medium", "likes": 496, "dislikes": 45, "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": 27018, "totalSubmissionRaw": 32726}, "2121": {"acRate": 44.03573567578359, "difficulty": "Medium", "likes": 848, "dislikes": 34, "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": 17646, "totalSubmissionRaw": 40072}, "2122": {"acRate": 38.7920323834716, "difficulty": "Hard", "likes": 353, "dislikes": 30, "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": 9679, "totalSubmissionRaw": 24951}, "2123": {"acRate": 41.7184265010352, "difficulty": "Hard", "likes": 45, "dislikes": 9, "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": 806, "totalSubmissionRaw": 1932}, "2124": {"acRate": 71.22931951421411, "difficulty": "Easy", "likes": 672, "dislikes": 16, "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": 62815, "totalSubmissionRaw": 88187}, "2125": {"acRate": 81.36801836266258, "difficulty": "Medium", "likes": 803, "dislikes": 69, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 53174, "totalSubmissionRaw": 65350}, "2126": {"acRate": 50.77093635581229, "difficulty": "Medium", "likes": 489, "dislikes": 180, "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": 34805, "totalSubmissionRaw": 68553}, "2127": {"acRate": 35.90066337812553, "difficulty": "Hard", "likes": 941, "dislikes": 24, "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": 10553, "totalSubmissionRaw": 29395}, "2128": {"acRate": 76.26260201632262, "difficulty": "Medium", "likes": 457, "dislikes": 176, "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": 31771, "totalSubmissionRaw": 41660}, "2129": {"acRate": 62.90824543770208, "difficulty": "Easy", "likes": 666, "dislikes": 47, "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": 51949, "totalSubmissionRaw": 82579}, "2130": {"acRate": 81.6847268708808, "difficulty": "Medium", "likes": 3153, "dislikes": 80, "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": 205487, "totalSubmissionRaw": 251562}, "2131": {"acRate": 48.04069896040699, "difficulty": "Medium", "likes": 2334, "dislikes": 52, "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": 108596, "totalSubmissionRaw": 226050}, "2132": {"acRate": 31.8562689559451, "difficulty": "Hard", "likes": 363, "dislikes": 37, "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": 6197, "totalSubmissionRaw": 19453}, "2133": {"acRate": 51.59271995303195, "difficulty": "Easy", "likes": 904, "dislikes": 48, "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": 61514, "totalSubmissionRaw": 119230}, "2134": {"acRate": 51.665637838183024, "difficulty": "Medium", "likes": 1024, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24272, "totalSubmissionRaw": 46979}, "2135": {"acRate": 42.710120068610635, "difficulty": "Medium", "likes": 634, "dislikes": 151, "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": 31374, "totalSubmissionRaw": 73458}, "2136": {"acRate": 72.2913042853241, "difficulty": "Hard", "likes": 1512, "dislikes": 79, "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": 50288, "totalSubmissionRaw": 69563}, "2137": {"acRate": 67.2875816993464, "difficulty": "Medium", "likes": 89, "dislikes": 8, "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": 2059, "totalSubmissionRaw": 3060}, "2138": {"acRate": 65.84531143052703, "difficulty": "Easy", "likes": 429, "dislikes": 18, "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": 40404, "totalSubmissionRaw": 61362}, "2139": {"acRate": 49.47808499952491, "difficulty": "Medium", "likes": 894, "dislikes": 17, "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": 36451, "totalSubmissionRaw": 73671}, "2140": {"acRate": 54.943264123611776, "difficulty": "Medium", "likes": 2224, "dislikes": 54, "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": 91029, "totalSubmissionRaw": 165679}, "2141": {"acRate": 50.36818330489821, "difficulty": "Hard", "likes": 1939, "dislikes": 53, "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": 56977, "totalSubmissionRaw": 113120}, "2142": {"acRate": 48.05555555555556, "difficulty": "Medium", "likes": 93, "dislikes": 10, "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": 7266, "totalSubmissionRaw": 15120}, "2143": {"acRate": 51.62818235642392, "difficulty": "Hard", "likes": 37, "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": 872, "totalSubmissionRaw": 1689}, "2144": {"acRate": 60.76000931098696, "difficulty": "Easy", "likes": 532, "dislikes": 17, "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": 41764, "totalSubmissionRaw": 68736}, "2145": {"acRate": 37.55353935430387, "difficulty": "Medium", "likes": 488, "dislikes": 45, "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": 16308, "totalSubmissionRaw": 43426}, "2146": {"acRate": 42.099329677026205, "difficulty": "Medium", "likes": 469, "dislikes": 149, "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": 13815, "totalSubmissionRaw": 32817}, "2147": {"acRate": 39.61498439125911, "difficulty": "Hard", "likes": 375, "dislikes": 33, "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": 11421, "totalSubmissionRaw": 28830}, "2148": {"acRate": 59.345637180688726, "difficulty": "Easy", "likes": 607, "dislikes": 32, "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": 49391, "totalSubmissionRaw": 83226}, "2149": {"acRate": 81.8528510734862, "difficulty": "Medium", "likes": 2228, "dislikes": 90, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 129852, "totalSubmissionRaw": 158641}, "2150": {"acRate": 60.24251220876612, "difficulty": "Medium", "likes": 561, "dislikes": 54, "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": 39844, "totalSubmissionRaw": 66139}, "2151": {"acRate": 49.53862705341995, "difficulty": "Hard", "likes": 466, "dislikes": 76, "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": 11972, "totalSubmissionRaw": 24167}, "2152": {"acRate": 45.91419816138917, "difficulty": "Medium", "likes": 64, "dislikes": 10, "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": 1798, "totalSubmissionRaw": 3916}, "2153": {"acRate": 41.37746930058729, "difficulty": "Hard", "likes": 70, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 2325, "totalSubmissionRaw": 5619}, "2154": {"acRate": 71.62744386439984, "difficulty": "Easy", "likes": 642, "dislikes": 31, "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": 76973, "totalSubmissionRaw": 107463}, "2155": {"acRate": 63.86652693755062, "difficulty": "Medium", "likes": 468, "dislikes": 14, "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": 26815, "totalSubmissionRaw": 41986}, "2156": {"acRate": 22.768184295082584, "difficulty": "Hard", "likes": 408, "dislikes": 381, "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": 12117, "totalSubmissionRaw": 53219}, "2157": {"acRate": 25.6038791942291, "difficulty": "Hard", "likes": 437, "dislikes": 53, "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": 8554, "totalSubmissionRaw": 33409}, "2158": {"acRate": 54.721162656892616, "difficulty": "Hard", "likes": 390, "dislikes": 39, "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": 25679, "totalSubmissionRaw": 46926}, "2159": {"acRate": 59.55286637267972, "difficulty": "Medium", "likes": 64, "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": 5806, "totalSubmissionRaw": 9750}, "2160": {"acRate": 86.2092351973004, "difficulty": "Easy", "likes": 1299, "dislikes": 126, "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": 104233, "totalSubmissionRaw": 120907}, "2161": {"acRate": 84.83930508785032, "difficulty": "Medium", "likes": 983, "dislikes": 72, "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": 60213, "totalSubmissionRaw": 70973}, "2162": {"acRate": 40.58785871350238, "difficulty": "Medium", "likes": 193, "dislikes": 607, "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": 14582, "totalSubmissionRaw": 35927}, "2163": {"acRate": 47.36379130243554, "difficulty": "Hard", "likes": 627, "dislikes": 14, "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": 8615, "totalSubmissionRaw": 18189}, "2164": {"acRate": 63.54715857637295, "difficulty": "Easy", "likes": 672, "dislikes": 51, "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": 51226, "totalSubmissionRaw": 80611}, "2165": {"acRate": 51.64098907112887, "difficulty": "Medium", "likes": 590, "dislikes": 21, "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": 31139, "totalSubmissionRaw": 60299}, "2166": {"acRate": 31.94132684873426, "difficulty": "Medium", "likes": 558, "dislikes": 45, "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": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20491, "totalSubmissionRaw": 64152}, "2167": {"acRate": 41.010848662965785, "difficulty": "Hard", "likes": 640, "dislikes": 11, "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": 11303, "totalSubmissionRaw": 27561}, "2168": {"acRate": 58.998682476943344, "difficulty": "Medium", "likes": 65, "dislikes": 6, "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": 2239, "totalSubmissionRaw": 3790}, "2169": {"acRate": 74.42076107899808, "difficulty": "Easy", "likes": 549, "dislikes": 19, "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": 61799, "totalSubmissionRaw": 83040}, "2170": {"acRate": 33.05281112219612, "difficulty": "Medium", "likes": 552, "dislikes": 322, "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": 20541, "totalSubmissionRaw": 62146}, "2171": {"acRate": 42.348950378290056, "difficulty": "Medium", "likes": 810, "dislikes": 45, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23845, "totalSubmissionRaw": 56306}, "2172": {"acRate": 48.56208635360858, "difficulty": "Hard", "likes": 472, "dislikes": 27, "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": 12327, "totalSubmissionRaw": 25384}, "2173": {"acRate": 52.14793281653747, "difficulty": "Hard", "likes": 86, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3228, "totalSubmissionRaw": 6191}, "2174": {"acRate": 68.04458894565722, "difficulty": "Medium", "likes": 81, "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": 4395, "totalSubmissionRaw": 6459}, "2175": {"acRate": 62.610251821551834, "difficulty": "Medium", "likes": 37, "dislikes": 13, "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": 4897, "totalSubmissionRaw": 7820}, "2176": {"acRate": 79.37290526288547, "difficulty": "Easy", "likes": 583, "dislikes": 24, "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": 61337, "totalSubmissionRaw": 77277}, "2177": {"acRate": 64.16886543535621, "difficulty": "Medium", "likes": 614, "dislikes": 200, "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": 38912, "totalSubmissionRaw": 60640}, "2178": {"acRate": 59.32285162901578, "difficulty": "Medium", "likes": 738, "dislikes": 70, "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": 41806, "totalSubmissionRaw": 70472}, "2179": {"acRate": 39.813286275402746, "difficulty": "Hard", "likes": 576, "dislikes": 24, "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": 6994, "totalSubmissionRaw": 17567}, "2180": {"acRate": 66.16127449029673, "difficulty": "Easy", "likes": 560, "dislikes": 25, "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": 49877, "totalSubmissionRaw": 75387}, "2181": {"acRate": 85.92771582767634, "difficulty": "Medium", "likes": 1565, "dislikes": 29, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 91391, "totalSubmissionRaw": 106358}, "2182": {"acRate": 52.95005872154801, "difficulty": "Medium", "likes": 592, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"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": 18936, "totalSubmissionRaw": 35762}, "2183": {"acRate": 28.594033503523352, "difficulty": "Hard", "likes": 777, "dislikes": 33, "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": 13553, "totalSubmissionRaw": 47398}, "2184": {"acRate": 50.112476206956224, "difficulty": "Medium", "likes": 144, "dislikes": 94, "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": 5792, "totalSubmissionRaw": 11558}, "2185": {"acRate": 77.36445367235683, "difficulty": "Easy", "likes": 624, "dislikes": 18, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75640, "totalSubmissionRaw": 97771}, "2186": {"acRate": 71.94806768162178, "difficulty": "Medium", "likes": 504, "dislikes": 15, "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": 35633, "totalSubmissionRaw": 49526}, "2187": {"acRate": 38.94222939460788, "difficulty": "Medium", "likes": 2659, "dislikes": 167, "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": 105211, "totalSubmissionRaw": 270172}, "2188": {"acRate": 41.38773610518559, "difficulty": "Hard", "likes": 531, "dislikes": 23, "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": 10671, "totalSubmissionRaw": 25783}, "2189": {"acRate": 63.554107853782114, "difficulty": "Medium", "likes": 62, "dislikes": 13, "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": 1756, "totalSubmissionRaw": 2763}, "2190": {"acRate": 59.15297652292818, "difficulty": "Easy", "likes": 332, "dislikes": 192, "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": 30714, "totalSubmissionRaw": 51923}, "2191": {"acRate": 46.037142930736934, "difficulty": "Medium", "likes": 347, "dislikes": 41, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 17873, "totalSubmissionRaw": 38823}, "2192": {"acRate": 51.49709694842019, "difficulty": "Medium", "likes": 990, "dislikes": 16, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30511, "totalSubmissionRaw": 59248}, "2193": {"acRate": 50.92140182048166, "difficulty": "Hard", "likes": 895, "dislikes": 68, "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": 20531, "totalSubmissionRaw": 40319}, "2194": {"acRate": 83.91813287530852, "difficulty": "Easy", "likes": 566, "dislikes": 85, "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": 58139, "totalSubmissionRaw": 69281}, "2195": {"acRate": 25.089276336519273, "difficulty": "Medium", "likes": 674, "dislikes": 298, "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": 28665, "totalSubmissionRaw": 114252}, "2196": {"acRate": 72.24974981083257, "difficulty": "Medium", "likes": 870, "dislikes": 17, "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": "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": 29600, "totalSubmissionRaw": 40969}, "2197": {"acRate": 38.64460630039265, "difficulty": "Hard", "likes": 408, "dislikes": 11, "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": 12893, "totalSubmissionRaw": 33363}, "2198": {"acRate": 56.202679091438554, "difficulty": "Medium", "likes": 25, "dislikes": 10, "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": 965, "totalSubmissionRaw": 1717}, "2199": {"acRate": 48.87200736648251, "difficulty": "Hard", "likes": 37, "dislikes": 12, "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": 2122, "totalSubmissionRaw": 4343}, "2200": {"acRate": 65.09817133659011, "difficulty": "Easy", "likes": 381, "dislikes": 58, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34780, "totalSubmissionRaw": 53427}, "2201": {"acRate": 55.817460073237534, "difficulty": "Medium", "likes": 191, "dislikes": 188, "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": 18139, "totalSubmissionRaw": 32497}, "2202": {"acRate": 22.843735167423407, "difficulty": "Medium", "likes": 580, "dislikes": 311, "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": 25508, "totalSubmissionRaw": 111663}, "2203": {"acRate": 36.22351344768797, "difficulty": "Hard", "likes": 635, "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": 10411, "totalSubmissionRaw": 28741}, "2204": {"acRate": 70.15891701000588, "difficulty": "Hard", "likes": 98, "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": 2384, "totalSubmissionRaw": 3398}, "2205": {"acRate": 50.225563909774436, "difficulty": "Easy", "likes": 24, "dislikes": 69, "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": 5009, "totalSubmissionRaw": 9974}, "2206": {"acRate": 73.30671853140888, "difficulty": "Easy", "likes": 643, "dislikes": 26, "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": 64452, "totalSubmissionRaw": 87921}, "2207": {"acRate": 33.88041040703328, "difficulty": "Medium", "likes": 453, "dislikes": 28, "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": 17072, "totalSubmissionRaw": 50389}, "2208": {"acRate": 45.87173217980064, "difficulty": "Medium", "likes": 538, "dislikes": 26, "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": 24390, "totalSubmissionRaw": 53170}, "2209": {"acRate": 35.011426705843945, "difficulty": "Hard", "likes": 481, "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": 10724, "totalSubmissionRaw": 30630}, "2210": {"acRate": 58.70535714285714, "difficulty": "Easy", "likes": 612, "dislikes": 84, "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": 37083, "totalSubmissionRaw": 63168}, "2211": {"acRate": 43.03980163943527, "difficulty": "Medium", "likes": 581, "dislikes": 213, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23260, "totalSubmissionRaw": 54043}, "2212": {"acRate": 49.60761931939787, "difficulty": "Medium", "likes": 470, "dislikes": 42, "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": 13907, "totalSubmissionRaw": 28034}, "2213": {"acRate": 31.724902939545203, "difficulty": "Hard", "likes": 271, "dislikes": 81, "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": 4004, "totalSubmissionRaw": 12621}, "2214": {"acRate": 57.84313725490197, "difficulty": "Medium", "likes": 305, "dislikes": 227, "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"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28910, "totalSubmissionRaw": 49980}, "2215": {"acRate": 78.32552161242783, "difficulty": "Easy", "likes": 2032, "dislikes": 81, "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": 212064, "totalSubmissionRaw": 270747}, "2216": {"acRate": 47.52773503927443, "difficulty": "Medium", "likes": 743, "dislikes": 92, "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": 29346, "totalSubmissionRaw": 61745}, "2217": {"acRate": 33.86283729402296, "difficulty": "Medium", "likes": 559, "dislikes": 243, "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": 15988, "totalSubmissionRaw": 47214}, "2218": {"acRate": 60.90550197391435, "difficulty": "Hard", "likes": 2184, "dislikes": 36, "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": 60939, "totalSubmissionRaw": 100055}, "2219": {"acRate": 62.06204379562044, "difficulty": "Medium", "likes": 60, "dislikes": 15, "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": 3401, "totalSubmissionRaw": 5480}, "2220": {"acRate": 82.7973802218551, "difficulty": "Easy", "likes": 747, "dislikes": 14, "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": 56130, "totalSubmissionRaw": 67792}, "2221": {"acRate": 78.25502542988617, "difficulty": "Medium", "likes": 975, "dislikes": 49, "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": 64623, "totalSubmissionRaw": 82580}, "2222": {"acRate": 50.51877635718589, "difficulty": "Medium", "likes": 913, "dislikes": 41, "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": 30188, "totalSubmissionRaw": 59756}, "2223": {"acRate": 37.74769585253456, "difficulty": "Hard", "likes": 230, "dislikes": 180, "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": 6553, "totalSubmissionRaw": 17360}, "2224": {"acRate": 64.97720664776195, "difficulty": "Easy", "likes": 419, "dislikes": 33, "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": 36204, "totalSubmissionRaw": 55718}, "2225": {"acRate": 71.24992378926547, "difficulty": "Medium", "likes": 1480, "dislikes": 93, "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": 105177, "totalSubmissionRaw": 147617}, "2226": {"acRate": 37.32862253627536, "difficulty": "Medium", "likes": 993, "dislikes": 37, "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": 33598, "totalSubmissionRaw": 90006}, "2227": {"acRate": 39.630890521411935, "difficulty": "Hard", "likes": 312, "dislikes": 63, "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": 11059, "totalSubmissionRaw": 27905}, "2228": {"acRate": 43.71991247264771, "difficulty": "Medium", "likes": 54, "dislikes": 8, "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": 5994, "totalSubmissionRaw": 13710}, "2229": {"acRate": 60.851008794619766, "difficulty": "Easy", "likes": 70, "dislikes": 9, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4705, "totalSubmissionRaw": 7732}, "2230": {"acRate": 49.60666358167515, "difficulty": "Easy", "likes": 17, "dislikes": 38, "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": 4288, "totalSubmissionRaw": 8644}, "2231": {"acRate": 60.78337593798962, "difficulty": "Easy", "likes": 556, "dislikes": 288, "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": 36856, "totalSubmissionRaw": 60635}, "2232": {"acRate": 66.1592505854801, "difficulty": "Medium", "likes": 184, "dislikes": 316, "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": 16950, "totalSubmissionRaw": 25620}, "2233": {"acRate": 41.25986965785186, "difficulty": "Medium", "likes": 648, "dislikes": 38, "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": 26337, "totalSubmissionRaw": 63832}, "2234": {"acRate": 28.68355007985398, "difficulty": "Hard", "likes": 411, "dislikes": 37, "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": 6286, "totalSubmissionRaw": 21915}, "2235": {"acRate": 87.1666308360553, "difficulty": "Easy", "likes": 1319, "dislikes": 2925, "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": 377075, "totalSubmissionRaw": 432591}, "2236": {"acRate": 83.49147889966233, "difficulty": "Easy", "likes": 1061, "dislikes": 1384, "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": 169116, "totalSubmissionRaw": 202555}, "2237": {"acRate": 63.78280072746168, "difficulty": "Medium", "likes": 66, "dislikes": 5, "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": 2455, "totalSubmissionRaw": 3849}, "2238": {"acRate": 70.70497990989895, "difficulty": "Medium", "likes": 62, "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": 5807, "totalSubmissionRaw": 8213}, "2239": {"acRate": 44.56337866638632, "difficulty": "Easy", "likes": 510, "dislikes": 31, "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": 46628, "totalSubmissionRaw": 104633}, "2240": {"acRate": 56.96022040697956, "difficulty": "Medium", "likes": 417, "dislikes": 28, "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": 23569, "totalSubmissionRaw": 41378}, "2241": {"acRate": 39.49745363697511, "difficulty": "Medium", "likes": 217, "dislikes": 309, "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": 16442, "totalSubmissionRaw": 41628}, "2242": {"acRate": 38.02625460528669, "difficulty": "Hard", "likes": 487, "dislikes": 14, "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": 10631, "totalSubmissionRaw": 27957}, "2243": {"acRate": 65.76333489754418, "difficulty": "Easy", "likes": 511, "dislikes": 38, "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": 33634, "totalSubmissionRaw": 51144}, "2244": {"acRate": 62.75979163333155, "difficulty": "Medium", "likes": 2660, "dislikes": 78, "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": 141202, "totalSubmissionRaw": 224988}, "2245": {"acRate": 35.557044410413475, "difficulty": "Medium", "likes": 167, "dislikes": 391, "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": 7430, "totalSubmissionRaw": 20896}, "2246": {"acRate": 55.0560183855214, "difficulty": "Hard", "likes": 2285, "dislikes": 59, "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": 68994, "totalSubmissionRaw": 125316}, "2247": {"acRate": 50.52710843373494, "difficulty": "Hard", "likes": 55, "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": 1342, "totalSubmissionRaw": 2656}, "2248": {"acRate": 68.18252522110129, "difficulty": "Easy", "likes": 638, "dislikes": 35, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61367, "totalSubmissionRaw": 90004}, "2249": {"acRate": 51.29851038808311, "difficulty": "Medium", "likes": 209, "dislikes": 212, "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": 20938, "totalSubmissionRaw": 40816}, "2250": {"acRate": 34.246335045733616, "difficulty": "Medium", "likes": 462, "dislikes": 131, "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": 13666, "totalSubmissionRaw": 39905}, "2251": {"acRate": 57.15663325860477, "difficulty": "Hard", "likes": 1497, "dislikes": 38, "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": 69341, "totalSubmissionRaw": 121320}, "2252": {"acRate": 52.99669655497876, "difficulty": "Hard", "likes": 26, "dislikes": 7, "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": 1123, "totalSubmissionRaw": 2119}, "2253": {"acRate": 66.28630705394191, "difficulty": "Hard", "likes": 13, "dislikes": 11, "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": 639, "totalSubmissionRaw": 964}, "2254": {"acRate": 63.29043088975938, "difficulty": "Hard", "likes": 67, "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": 2262, "totalSubmissionRaw": 3574}, "2255": {"acRate": 72.45021166407238, "difficulty": "Easy", "likes": 496, "dislikes": 17, "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": 49803, "totalSubmissionRaw": 68741}, "2256": {"acRate": 43.01931668785083, "difficulty": "Medium", "likes": 1445, "dislikes": 164, "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": 78860, "totalSubmissionRaw": 183313}, "2257": {"acRate": 51.98335052830054, "difficulty": "Medium", "likes": 390, "dislikes": 33, "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": 14612, "totalSubmissionRaw": 28109}, "2258": {"acRate": 34.49269561737042, "difficulty": "Hard", "likes": 646, "dislikes": 24, "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": 8618, "totalSubmissionRaw": 24985}, "2259": {"acRate": 45.140609580336665, "difficulty": "Easy", "likes": 728, "dislikes": 41, "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": 63581, "totalSubmissionRaw": 140851}, "2260": {"acRate": 50.63712016020101, "difficulty": "Medium", "likes": 839, "dislikes": 26, "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": 53607, "totalSubmissionRaw": 105866}, "2261": {"acRate": 49.05287850649985, "difficulty": "Medium", "likes": 576, "dislikes": 136, "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": 25091, "totalSubmissionRaw": 51153}, "2262": {"acRate": 55.65238940977242, "difficulty": "Hard", "likes": 1004, "dislikes": 24, "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": 26948, "totalSubmissionRaw": 48418}, "2263": {"acRate": 64.96815286624204, "difficulty": "Hard", "likes": 67, "dislikes": 4, "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": 1122, "totalSubmissionRaw": 1727}, "2264": {"acRate": 60.02739189982391, "difficulty": "Easy", "likes": 344, "dislikes": 19, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 36815, "totalSubmissionRaw": 61331}, "2265": {"acRate": 84.81361426256078, "difficulty": "Medium", "likes": 1265, "dislikes": 24, "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": 47096, "totalSubmissionRaw": 55529}, "2266": {"acRate": 47.21718170246188, "difficulty": "Medium", "likes": 803, "dislikes": 25, "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": 17434, "totalSubmissionRaw": 36923}, "2267": {"acRate": 38.048444811450594, "difficulty": "Hard", "likes": 485, "dislikes": 6, "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": 13823, "totalSubmissionRaw": 36330}, "2268": {"acRate": 71.45908559222906, "difficulty": "Medium", "likes": 198, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14051, "totalSubmissionRaw": 19663}, "2269": {"acRate": 58.4189187460831, "difficulty": "Easy", "likes": 583, "dislikes": 37, "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": 45676, "totalSubmissionRaw": 78187}, "2270": {"acRate": 46.4681136981099, "difficulty": "Medium", "likes": 497, "dislikes": 39, "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": 31812, "totalSubmissionRaw": 68460}, "2271": {"acRate": 33.349743773356906, "difficulty": "Medium", "likes": 735, "dislikes": 42, "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": 14903, "totalSubmissionRaw": 44687}, "2272": {"acRate": 46.8246569755586, "difficulty": "Hard", "likes": 1797, "dislikes": 202, "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": 64294, "totalSubmissionRaw": 137308}, "2273": {"acRate": 57.810930999856545, "difficulty": "Easy", "likes": 585, "dislikes": 143, "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": 48360, "totalSubmissionRaw": 83652}, "2274": {"acRate": 51.90649897461026, "difficulty": "Medium", "likes": 361, "dislikes": 34, "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": 28601, "totalSubmissionRaw": 55101}, "2275": {"acRate": 72.48145859085291, "difficulty": "Medium", "likes": 522, "dislikes": 13, "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": 23455, "totalSubmissionRaw": 32360}, "2276": {"acRate": 34.541909426429285, "difficulty": "Hard", "likes": 521, "dislikes": 55, "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": 14881, "totalSubmissionRaw": 43081}, "2277": {"acRate": 62.96753705010586, "difficulty": "Hard", "likes": 111, "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": 3569, "totalSubmissionRaw": 5668}, "2278": {"acRate": 73.9232635729451, "difficulty": "Easy", "likes": 454, "dislikes": 50, "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": 58494, "totalSubmissionRaw": 79128}, "2279": {"acRate": 67.59790528233151, "difficulty": "Medium", "likes": 1612, "dislikes": 66, "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": 89067, "totalSubmissionRaw": 131760}, "2280": {"acRate": 24.88076721021024, "difficulty": "Medium", "likes": 318, "dislikes": 503, "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": 24154, "totalSubmissionRaw": 97079}, "2281": {"acRate": 27.46452576549664, "difficulty": "Hard", "likes": 1090, "dislikes": 87, "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": 16181, "totalSubmissionRaw": 58916}, "2282": {"acRate": 49.062808286747774, "difficulty": "Medium", "likes": 51, "dislikes": 23, "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": 1492, "totalSubmissionRaw": 3041}, "2283": {"acRate": 72.57832220897279, "difficulty": "Easy", "likes": 533, "dislikes": 63, "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": 46866, "totalSubmissionRaw": 64573}, "2284": {"acRate": 56.154672800286576, "difficulty": "Medium", "likes": 390, "dislikes": 33, "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": 29785, "totalSubmissionRaw": 53041}, "2285": {"acRate": 60.75467775467776, "difficulty": "Medium", "likes": 682, "dislikes": 26, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29223, "totalSubmissionRaw": 48100}, "2286": {"acRate": 15.74685326995863, "difficulty": "Hard", "likes": 294, "dislikes": 53, "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": 5367, "totalSubmissionRaw": 34083}, "2287": {"acRate": 58.00888292969078, "difficulty": "Easy", "likes": 422, "dislikes": 31, "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": 34611, "totalSubmissionRaw": 59665}, "2288": {"acRate": 28.571857636281724, "difficulty": "Medium", "likes": 172, "dislikes": 1061, "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": 19026, "totalSubmissionRaw": 66590}, "2289": {"acRate": 21.23351602326305, "difficulty": "Medium", "likes": 1238, "dislikes": 120, "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": 17744, "totalSubmissionRaw": 83566}, "2290": {"acRate": 51.60815253122946, "difficulty": "Hard", "likes": 860, "dislikes": 15, "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": 19624, "totalSubmissionRaw": 38025}, "2291": {"acRate": 45.053212455656286, "difficulty": "Medium", "likes": 126, "dislikes": 4, "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": 4572, "totalSubmissionRaw": 10148}, "2292": {"acRate": 38.273578442566794, "difficulty": "Medium", "likes": 55, "dislikes": 24, "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": 5028, "totalSubmissionRaw": 13137}, "2293": {"acRate": 63.143680776816865, "difficulty": "Easy", "likes": 494, "dislikes": 22, "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": 41618, "totalSubmissionRaw": 65910}, "2294": {"acRate": 73.03784270030462, "difficulty": "Medium", "likes": 685, "dislikes": 23, "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": 35725, "totalSubmissionRaw": 48913}, "2295": {"acRate": 57.675531425416395, "difficulty": "Medium", "likes": 580, "dislikes": 32, "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": 31338, "totalSubmissionRaw": 54335}, "2296": {"acRate": 42.40827306403246, "difficulty": "Hard", "likes": 506, "dislikes": 220, "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": 19232, "totalSubmissionRaw": 45351}, "2297": {"acRate": 50.62002591153063, "difficulty": "Medium", "likes": 117, "dislikes": 25, "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": 2735, "totalSubmissionRaw": 5403}, "2298": {"acRate": 82.07156986153569, "difficulty": "Medium", "likes": 40, "dislikes": 8, "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": 4564, "totalSubmissionRaw": 5561}, "2299": {"acRate": 55.07210226829839, "difficulty": "Easy", "likes": 313, "dislikes": 37, "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": 35326, "totalSubmissionRaw": 64145}, "2300": {"acRate": 41.81336533345409, "difficulty": "Medium", "likes": 2355, "dislikes": 54, "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": 110803, "totalSubmissionRaw": 264996}, "2301": {"acRate": 39.72294427185697, "difficulty": "Hard", "likes": 358, "dislikes": 73, "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": 12531, "totalSubmissionRaw": 31546}, "2302": {"acRate": 53.53307249954048, "difficulty": "Hard", "likes": 901, "dislikes": 20, "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": 20387, "totalSubmissionRaw": 38083}, "2303": {"acRate": 64.34218848829855, "difficulty": "Easy", "likes": 226, "dislikes": 263, "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": 32552, "totalSubmissionRaw": 50592}, "2304": {"acRate": 65.99556563622926, "difficulty": "Medium", "likes": 805, "dislikes": 129, "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": 25896, "totalSubmissionRaw": 39239}, "2305": {"acRate": 69.74376915900307, "difficulty": "Medium", "likes": 2380, "dislikes": 102, "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": 83726, "totalSubmissionRaw": 120048}, "2306": {"acRate": 46.773619115456846, "difficulty": "Hard", "likes": 1912, "dislikes": 66, "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": 57786, "totalSubmissionRaw": 123544}, "2307": {"acRate": 42.482725756492734, "difficulty": "Hard", "likes": 38, "dislikes": 22, "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": 1783, "totalSubmissionRaw": 4197}, "2308": {"acRate": 68.39847473784558, "difficulty": "Medium", "likes": 68, "dislikes": 14, "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": 4305, "totalSubmissionRaw": 6294}, "2309": {"acRate": 69.09165576613026, "difficulty": "Easy", "likes": 438, "dislikes": 28, "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": 45425, "totalSubmissionRaw": 65746}, "2310": {"acRate": 26.259060269408558, "difficulty": "Medium", "likes": 375, "dislikes": 318, "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": 23802, "totalSubmissionRaw": 90643}, "2311": {"acRate": 37.37471051412691, "difficulty": "Medium", "likes": 647, "dislikes": 45, "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": 20173, "totalSubmissionRaw": 53975}, "2312": {"acRate": 49.06862220319024, "difficulty": "Hard", "likes": 516, "dislikes": 9, "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": 9167, "totalSubmissionRaw": 18682}, "2313": {"acRate": 60.09852216748769, "difficulty": "Hard", "likes": 72, "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": 2074, "totalSubmissionRaw": 3451}, "2314": {"acRate": 71.32313231323131, "difficulty": "Medium", "likes": 48, "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": 3962, "totalSubmissionRaw": 5555}, "2315": {"acRate": 81.58746029878837, "difficulty": "Easy", "likes": 558, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55486, "totalSubmissionRaw": 68008}, "2316": {"acRate": 49.98939799911329, "difficulty": "Medium", "likes": 1872, "dislikes": 44, "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": 77799, "totalSubmissionRaw": 155631}, "2317": {"acRate": 79.31363931669661, "difficulty": "Medium", "likes": 552, "dislikes": 156, "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": 20754, "totalSubmissionRaw": 26167}, "2318": {"acRate": 56.62983425414365, "difficulty": "Hard", "likes": 408, "dislikes": 17, "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": 9635, "totalSubmissionRaw": 17014}, "2319": {"acRate": 65.42961342086069, "difficulty": "Easy", "likes": 448, "dislikes": 19, "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": 44852, "totalSubmissionRaw": 68550}, "2320": {"acRate": 41.059097001883366, "difficulty": "Medium", "likes": 525, "dislikes": 187, "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": 24199, "totalSubmissionRaw": 58937}, "2321": {"acRate": 56.14476738483669, "difficulty": "Hard", "likes": 738, "dislikes": 11, "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": 17173, "totalSubmissionRaw": 30587}, "2322": {"acRate": 51.44265739917563, "difficulty": "Hard", "likes": 429, "dislikes": 13, "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": 6365, "totalSubmissionRaw": 12373}, "2323": {"acRate": 68.87037037037037, "difficulty": "Medium", "likes": 46, "dislikes": 14, "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": 3719, "totalSubmissionRaw": 5400}, "2324": {"acRate": 73.61610352264559, "difficulty": "Medium", "likes": 41, "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": 5120, "totalSubmissionRaw": 6955}, "2325": {"acRate": 83.82546826695763, "difficulty": "Easy", "likes": 845, "dislikes": 79, "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": 73753, "totalSubmissionRaw": 87984}, "2326": {"acRate": 75.11819412691719, "difficulty": "Medium", "likes": 675, "dislikes": 25, "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": 33843, "totalSubmissionRaw": 45053}, "2327": {"acRate": 44.9121751405892, "difficulty": "Medium", "likes": 747, "dislikes": 109, "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": 19407, "totalSubmissionRaw": 43211}, "2328": {"acRate": 59.091768263869206, "difficulty": "Hard", "likes": 1876, "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": 62525, "totalSubmissionRaw": 105810}, "2329": {"acRate": 68.65006553079948, "difficulty": "Easy", "likes": 29, "dislikes": 6, "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": 5237, "totalSubmissionRaw": 7628}, "2330": {"acRate": 75.56561085972851, "difficulty": "Medium", "likes": 77, "dislikes": 19, "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": 5511, "totalSubmissionRaw": 7293}, "2331": {"acRate": 77.93301019646178, "difficulty": "Easy", "likes": 856, "dislikes": 21, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 57400, "totalSubmissionRaw": 73653}, "2332": {"acRate": 25.77792335407796, "difficulty": "Medium", "likes": 400, "dislikes": 682, "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": 19675, "totalSubmissionRaw": 76325}, "2333": {"acRate": 25.35883241066935, "difficulty": "Medium", "likes": 589, "dislikes": 34, "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": 12597, "totalSubmissionRaw": 49675}, "2334": {"acRate": 42.54964986798301, "difficulty": "Hard", "likes": 500, "dislikes": 6, "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": 7413, "totalSubmissionRaw": 17422}, "2335": {"acRate": 57.06627204065392, "difficulty": "Easy", "likes": 630, "dislikes": 74, "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": 40876, "totalSubmissionRaw": 71629}, "2336": {"acRate": 73.26597487711632, "difficulty": "Medium", "likes": 1472, "dislikes": 153, "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": 104636, "totalSubmissionRaw": 142817}, "2337": {"acRate": 47.62390373240873, "difficulty": "Medium", "likes": 623, "dislikes": 41, "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": 23350, "totalSubmissionRaw": 49030}, "2338": {"acRate": 26.37336275967951, "difficulty": "Hard", "likes": 456, "dislikes": 26, "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": 5497, "totalSubmissionRaw": 20843}, "2339": {"acRate": 87.0632530120482, "difficulty": "Easy", "likes": 39, "dislikes": 3, "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": 5781, "totalSubmissionRaw": 6640}, "2340": {"acRate": 73.29671065853822, "difficulty": "Medium", "likes": 126, "dislikes": 20, "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": 10941, "totalSubmissionRaw": 14927}, "2341": {"acRate": 75.43499018619701, "difficulty": "Easy", "likes": 613, "dislikes": 15, "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": 56881, "totalSubmissionRaw": 75404}, "2342": {"acRate": 53.82534883075814, "difficulty": "Medium", "likes": 633, "dislikes": 12, "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": 38807, "totalSubmissionRaw": 72098}, "2343": {"acRate": 41.84360249116069, "difficulty": "Medium", "likes": 247, "dislikes": 397, "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": 23314, "totalSubmissionRaw": 55717}, "2344": {"acRate": 56.22062605302829, "difficulty": "Hard", "likes": 524, "dislikes": 122, "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": 25360, "totalSubmissionRaw": 45108}, "2345": {"acRate": 38.251186083289404, "difficulty": "Medium", "likes": 126, "dislikes": 59, "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": 5805, "totalSubmissionRaw": 15176}, "2346": {"acRate": 32.91368717897069, "difficulty": "Medium", "likes": 23, "dislikes": 69, "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": 3268, "totalSubmissionRaw": 9929}, "2347": {"acRate": 60.24350976051519, "difficulty": "Easy", "likes": 337, "dislikes": 31, "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": 35922, "totalSubmissionRaw": 59628}, "2348": {"acRate": 66.66880837368504, "difficulty": "Medium", "likes": 2150, "dislikes": 71, "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": 114139, "totalSubmissionRaw": 171203}, "2349": {"acRate": 45.1216799394937, "difficulty": "Medium", "likes": 340, "dislikes": 28, "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": 20284, "totalSubmissionRaw": 44954}, "2350": {"acRate": 68.09919901417129, "difficulty": "Hard", "likes": 600, "dislikes": 43, "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": 13263, "totalSubmissionRaw": 19476}, "2351": {"acRate": 73.66809706642576, "difficulty": "Easy", "likes": 909, "dislikes": 51, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88067, "totalSubmissionRaw": 119546}, "2352": {"acRate": 72.79058814097746, "difficulty": "Medium", "likes": 1921, "dislikes": 112, "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": 145274, "totalSubmissionRaw": 199578}, "2353": {"acRate": 34.48308501978305, "difficulty": "Medium", "likes": 496, "dislikes": 96, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 18215, "totalSubmissionRaw": 52823}, "2354": {"acRate": 46.507630240308714, "difficulty": "Hard", "likes": 557, "dislikes": 17, "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": 13257, "totalSubmissionRaw": 28505}, "2355": {"acRate": 42.85334220152976, "difficulty": "Hard", "likes": 198, "dislikes": 20, "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": 6431, "totalSubmissionRaw": 15015}, "2356": {"acRate": 86.32080810367269, "difficulty": "Easy", "likes": 284, "dislikes": 14, "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": 61015, "totalSubmissionRaw": 70684}, "2357": {"acRate": 71.84025694419934, "difficulty": "Easy", "likes": 1032, "dislikes": 41, "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": 81418, "totalSubmissionRaw": 113332}, "2358": {"acRate": 67.71319646898127, "difficulty": "Medium", "likes": 610, "dislikes": 102, "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": 33214, "totalSubmissionRaw": 49051}, "2359": {"acRate": 45.69716879627684, "difficulty": "Medium", "likes": 1608, "dislikes": 382, "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": 71777, "totalSubmissionRaw": 157071}, "2360": {"acRate": 50.18900608489493, "difficulty": "Hard", "likes": 2214, "dislikes": 44, "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": 68377, "totalSubmissionRaw": 136239}, "2361": {"acRate": 79.36978184756262, "difficulty": "Hard", "likes": 172, "dislikes": 29, "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": 8841, "totalSubmissionRaw": 11139}, "2362": {"acRate": 73.57280307889673, "difficulty": "Hard", "likes": 28, "dislikes": 24, "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": 2294, "totalSubmissionRaw": 3118}, "2363": {"acRate": 75.47883148462743, "difficulty": "Easy", "likes": 491, "dislikes": 19, "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": 45317, "totalSubmissionRaw": 60040}, "2364": {"acRate": 41.11215775900675, "difficulty": "Medium", "likes": 893, "dislikes": 22, "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": 26623, "totalSubmissionRaw": 64757}, "2365": {"acRate": 47.26902764123551, "difficulty": "Medium", "likes": 457, "dislikes": 31, "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": 20675, "totalSubmissionRaw": 43738}, "2366": {"acRate": 54.105798925890035, "difficulty": "Hard", "likes": 1889, "dislikes": 62, "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": 59742, "totalSubmissionRaw": 110417}, "2367": {"acRate": 83.44094356408608, "difficulty": "Easy", "likes": 1103, "dislikes": 61, "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": 94728, "totalSubmissionRaw": 113527}, "2368": {"acRate": 58.46211187247341, "difficulty": "Medium", "likes": 603, "dislikes": 25, "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": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40782, "totalSubmissionRaw": 69758}, "2369": {"acRate": 51.927299819621986, "difficulty": "Medium", "likes": 1894, "dislikes": 188, "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": 79455, "totalSubmissionRaw": 153012}, "2370": {"acRate": 37.51165762840662, "difficulty": "Medium", "likes": 739, "dislikes": 22, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 21720, "totalSubmissionRaw": 57902}, "2371": {"acRate": 65.34170153417016, "difficulty": "Hard", "likes": 78, "dislikes": 2, "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": 1874, "totalSubmissionRaw": 2868}, "2372": {"acRate": 82.86674132138859, "difficulty": "Medium", "likes": 31, "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": 3700, "totalSubmissionRaw": 4465}, "2373": {"acRate": 82.88621294108681, "difficulty": "Easy", "likes": 649, "dislikes": 72, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 43502, "totalSubmissionRaw": 52484}, "2374": {"acRate": 46.72771945499218, "difficulty": "Medium", "likes": 395, "dislikes": 32, "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": 29288, "totalSubmissionRaw": 62678}, "2375": {"acRate": 75.15907355561211, "difficulty": "Medium", "likes": 836, "dislikes": 34, "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": 26577, "totalSubmissionRaw": 35361}, "2376": {"acRate": 37.719711521037944, "difficulty": "Hard", "likes": 535, "dislikes": 30, "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": 10408, "totalSubmissionRaw": 27593}, "2377": {"acRate": 77.95555555555555, "difficulty": "Easy", "likes": 34, "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": 4385, "totalSubmissionRaw": 5625}, "2378": {"acRate": 59.305339554173145, "difficulty": "Medium", "likes": 44, "dislikes": 11, "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": 1144, "totalSubmissionRaw": 1929}, "2379": {"acRate": 58.174475182290585, "difficulty": "Easy", "likes": 662, "dislikes": 17, "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": 42205, "totalSubmissionRaw": 72549}, "2380": {"acRate": 49.44369012597119, "difficulty": "Medium", "likes": 422, "dislikes": 103, "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": 26219, "totalSubmissionRaw": 53028}, "2381": {"acRate": 36.00156108783173, "difficulty": "Medium", "likes": 698, "dislikes": 18, "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": 17527, "totalSubmissionRaw": 48684}, "2382": {"acRate": 48.52248121258438, "difficulty": "Hard", "likes": 427, "dislikes": 5, "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": 7619, "totalSubmissionRaw": 15702}, "2383": {"acRate": 40.835467073275986, "difficulty": "Easy", "likes": 293, "dislikes": 261, "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": 28388, "totalSubmissionRaw": 69518}, "2384": {"acRate": 31.95477536447486, "difficulty": "Medium", "likes": 525, "dislikes": 205, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23628, "totalSubmissionRaw": 73942}, "2385": {"acRate": 58.64859292856407, "difficulty": "Medium", "likes": 1424, "dislikes": 13, "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": "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": 34137, "totalSubmissionRaw": 58206}, "2386": {"acRate": 38.2404350359293, "difficulty": "Hard", "likes": 530, "dislikes": 18, "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": 7876, "totalSubmissionRaw": 20596}, "2387": {"acRate": 69.20065252854812, "difficulty": "Medium", "likes": 60, "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": 2121, "totalSubmissionRaw": 3065}, "2388": {"acRate": 52.19298245614035, "difficulty": "Medium", "likes": 71, "dislikes": 26, "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": 2975, "totalSubmissionRaw": 5700}, "2389": {"acRate": 71.75649238559208, "difficulty": "Easy", "likes": 1739, "dislikes": 154, "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": 93531, "totalSubmissionRaw": 130345}, "2390": {"acRate": 73.50563982886037, "difficulty": "Medium", "likes": 2548, "dislikes": 174, "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": 188979, "totalSubmissionRaw": 257094}, "2391": {"acRate": 82.7475353621946, "difficulty": "Medium", "likes": 751, "dislikes": 75, "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": 42471, "totalSubmissionRaw": 51326}, "2392": {"acRate": 60.54488527501285, "difficulty": "Hard", "likes": 727, "dislikes": 8, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 12956, "totalSubmissionRaw": 21399}, "2393": {"acRate": 76.38010350776308, "difficulty": "Medium", "likes": 116, "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": 5313, "totalSubmissionRaw": 6956}, "2394": {"acRate": 40.809924426065876, "difficulty": "Medium", "likes": 24, "dislikes": 33, "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": 2862, "totalSubmissionRaw": 7013}, "2395": {"acRate": 64.70843470580031, "difficulty": "Easy", "likes": 469, "dislikes": 25, "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": 41757, "totalSubmissionRaw": 64531}, "2396": {"acRate": 87.33077871623861, "difficulty": "Medium", "likes": 505, "dislikes": 1358, "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": 65864, "totalSubmissionRaw": 75419}, "2397": {"acRate": 53.99004008259444, "difficulty": "Medium", "likes": 248, "dislikes": 384, "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": 13335, "totalSubmissionRaw": 24699}, "2398": {"acRate": 33.61492169102531, "difficulty": "Hard", "likes": 741, "dislikes": 14, "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": 17986, "totalSubmissionRaw": 53506}, "2399": {"acRate": 70.00919336715585, "difficulty": "Easy", "likes": 429, "dislikes": 45, "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": 41122, "totalSubmissionRaw": 58738}, "2400": {"acRate": 33.927834090333924, "difficulty": "Medium", "likes": 674, "dislikes": 54, "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": 25463, "totalSubmissionRaw": 75065}, "2401": {"acRate": 49.97724799683451, "difficulty": "Medium", "likes": 1108, "dislikes": 24, "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": 25261, "totalSubmissionRaw": 50545}, "2402": {"acRate": 33.29735696326731, "difficulty": "Hard", "likes": 793, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "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": 27149, "totalSubmissionRaw": 81535}, "2403": {"acRate": 55.206185567010316, "difficulty": "Hard", "likes": 38, "dislikes": 3, "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": 1071, "totalSubmissionRaw": 1940}, "2404": {"acRate": 50.340157910378224, "difficulty": "Easy", "likes": 832, "dislikes": 30, "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": 62674, "totalSubmissionRaw": 124501}, "2405": {"acRate": 78.86055089924918, "difficulty": "Medium", "likes": 2402, "dislikes": 95, "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": 144519, "totalSubmissionRaw": 183260}, "2406": {"acRate": 46.55023378256257, "difficulty": "Medium", "likes": 720, "dislikes": 10, "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": 23695, "totalSubmissionRaw": 50902}, "2407": {"acRate": 22.06935735881983, "difficulty": "Hard", "likes": 763, "dislikes": 32, "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": 10876, "totalSubmissionRaw": 49281}, "2408": {"acRate": 77.97558494404882, "difficulty": "Medium", "likes": 35, "dislikes": 55, "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": 3066, "totalSubmissionRaw": 3932}, "2409": {"acRate": 44.458275807437246, "difficulty": "Easy", "likes": 226, "dislikes": 576, "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": 19643, "totalSubmissionRaw": 44183}, "2410": {"acRate": 61.61478892987338, "difficulty": "Medium", "likes": 433, "dislikes": 13, "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": 28564, "totalSubmissionRaw": 46359}, "2411": {"acRate": 42.78985367360333, "difficulty": "Medium", "likes": 524, "dislikes": 22, "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": 11083, "totalSubmissionRaw": 25901}, "2412": {"acRate": 39.736644720393365, "difficulty": "Hard", "likes": 378, "dislikes": 33, "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": 9536, "totalSubmissionRaw": 23998}, "2413": {"acRate": 87.38094004632885, "difficulty": "Easy", "likes": 775, "dislikes": 85, "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": 118069, "totalSubmissionRaw": 135120}, "2414": {"acRate": 57.31579407394458, "difficulty": "Medium", "likes": 451, "dislikes": 29, "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": 39342, "totalSubmissionRaw": 68637}, "2415": {"acRate": 77.42129273283646, "difficulty": "Medium", "likes": 977, "dislikes": 35, "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": 41240, "totalSubmissionRaw": 53267}, "2416": {"acRate": 44.61608270202021, "difficulty": "Hard", "likes": 621, "dislikes": 49, "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": 22615, "totalSubmissionRaw": 50688}, "2417": {"acRate": 44.483805668016196, "difficulty": "Medium", "likes": 22, "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": 879, "totalSubmissionRaw": 1976}, "2418": {"acRate": 80.05711869680023, "difficulty": "Easy", "likes": 1126, "dislikes": 18, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 100354, "totalSubmissionRaw": 125353}, "2419": {"acRate": 49.026245646802465, "difficulty": "Medium", "likes": 429, "dislikes": 37, "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": 25199, "totalSubmissionRaw": 51399}, "2420": {"acRate": 38.03032538921272, "difficulty": "Medium", "likes": 586, "dislikes": 28, "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": 20617, "totalSubmissionRaw": 54212}, "2421": {"acRate": 56.83724416131201, "difficulty": "Hard", "likes": 2100, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51569, "totalSubmissionRaw": 90731}, "2422": {"acRate": 66.51515151515152, "difficulty": "Medium", "likes": 94, "dislikes": 9, "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": 3950, "totalSubmissionRaw": 5939}, "2423": {"acRate": 17.307011957829193, "difficulty": "Easy", "likes": 564, "dislikes": 1077, "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": 34244, "totalSubmissionRaw": 197862}, "2424": {"acRate": 54.4510020902496, "difficulty": "Medium", "likes": 315, "dislikes": 19, "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": 17714, "totalSubmissionRaw": 32532}, "2425": {"acRate": 58.332195987443704, "difficulty": "Medium", "likes": 363, "dislikes": 11, "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": 17096, "totalSubmissionRaw": 29308}, "2426": {"acRate": 43.441333752752435, "difficulty": "Hard", "likes": 494, "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": 11048, "totalSubmissionRaw": 25432}, "2427": {"acRate": 78.85256259368921, "difficulty": "Easy", "likes": 489, "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": 63648, "totalSubmissionRaw": 80718}, "2428": {"acRate": 74.67290786619478, "difficulty": "Medium", "likes": 404, "dislikes": 52, "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": 32703, "totalSubmissionRaw": 43795}, "2429": {"acRate": 43.37176419403959, "difficulty": "Medium", "likes": 428, "dislikes": 19, "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": 19938, "totalSubmissionRaw": 45970}, "2430": {"acRate": 32.24260452817716, "difficulty": "Hard", "likes": 446, "dislikes": 51, "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": 11706, "totalSubmissionRaw": 36306}, "2431": {"acRate": 64.24970918960837, "difficulty": "Medium", "likes": 42, "dislikes": 0, "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": 1657, "totalSubmissionRaw": 2579}, "2432": {"acRate": 49.17596937713215, "difficulty": "Easy", "likes": 247, "dislikes": 62, "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": 30704, "totalSubmissionRaw": 62437}, "2433": {"acRate": 85.67761113363059, "difficulty": "Medium", "likes": 636, "dislikes": 31, "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": 44387, "totalSubmissionRaw": 51807}, "2434": {"acRate": 38.92464239745489, "difficulty": "Medium", "likes": 603, "dislikes": 170, "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": 16028, "totalSubmissionRaw": 41177}, "2435": {"acRate": 42.35620531426742, "difficulty": "Hard", "likes": 827, "dislikes": 28, "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": 19846, "totalSubmissionRaw": 46855}, "2436": {"acRate": 72.27968556061232, "difficulty": "Medium", "likes": 33, "dislikes": 9, "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": 1747, "totalSubmissionRaw": 2417}, "2437": {"acRate": 43.29375639713409, "difficulty": "Easy", "likes": 224, "dislikes": 195, "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": 21149, "totalSubmissionRaw": 48850}, "2438": {"acRate": 39.47021293778771, "difficulty": "Medium", "likes": 274, "dislikes": 44, "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": 14662, "totalSubmissionRaw": 37147}, "2439": {"acRate": 46.81634659052027, "difficulty": "Medium", "likes": 2299, "dislikes": 590, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 75252, "totalSubmissionRaw": 160735}, "2440": {"acRate": 53.731053245239025, "difficulty": "Hard", "likes": 362, "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": 5530, "totalSubmissionRaw": 10292}, "2441": {"acRate": 67.6705024619821, "difficulty": "Easy", "likes": 447, "dislikes": 10, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49750, "totalSubmissionRaw": 73518}, "2442": {"acRate": 78.74384030735823, "difficulty": "Medium", "likes": 519, "dislikes": 48, "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": 47140, "totalSubmissionRaw": 59865}, "2443": {"acRate": 46.538789679621075, "difficulty": "Medium", "likes": 231, "dislikes": 287, "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": 31638, "totalSubmissionRaw": 67982}, "2444": {"acRate": 61.54189989536455, "difficulty": "Hard", "likes": 2321, "dislikes": 50, "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": 60580, "totalSubmissionRaw": 98437}, "2445": {"acRate": 69.74935177182368, "difficulty": "Medium", "likes": 67, "dislikes": 5, "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": 1614, "totalSubmissionRaw": 2314}, "2446": {"acRate": 50.13209947299999, "difficulty": "Easy", "likes": 401, "dislikes": 56, "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": 35863, "totalSubmissionRaw": 71537}, "2447": {"acRate": 49.15265516170534, "difficulty": "Medium", "likes": 409, "dislikes": 59, "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": 22159, "totalSubmissionRaw": 45082}, "2448": {"acRate": 45.93193448191102, "difficulty": "Hard", "likes": 2293, "dislikes": 32, "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": 61665, "totalSubmissionRaw": 134253}, "2449": {"acRate": 62.17560306390762, "difficulty": "Hard", "likes": 389, "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": 10877, "totalSubmissionRaw": 17494}, "2450": {"acRate": 64.82635796972396, "difficulty": "Medium", "likes": 30, "dislikes": 6, "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": 728, "totalSubmissionRaw": 1123}, "2451": {"acRate": 58.8168973540912, "difficulty": "Easy", "likes": 360, "dislikes": 104, "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": 24519, "totalSubmissionRaw": 41687}, "2452": {"acRate": 60.315549772283674, "difficulty": "Medium", "likes": 262, "dislikes": 17, "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": 18541, "totalSubmissionRaw": 30740}, "2453": {"acRate": 38.53700912133677, "difficulty": "Medium", "likes": 528, "dislikes": 16, "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": 15083, "totalSubmissionRaw": 39139}, "2454": {"acRate": 38.098345374038686, "difficulty": "Hard", "likes": 588, "dislikes": 7, "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": 8174, "totalSubmissionRaw": 21455}, "2455": {"acRate": 59.62568262552357, "difficulty": "Easy", "likes": 284, "dislikes": 33, "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": 44984, "totalSubmissionRaw": 75444}, "2456": {"acRate": 43.46753046429122, "difficulty": "Medium", "likes": 231, "dislikes": 350, "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": 19726, "totalSubmissionRaw": 45381}, "2457": {"acRate": 37.09423861318831, "difficulty": "Medium", "likes": 496, "dislikes": 23, "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": 17461, "totalSubmissionRaw": 47072}, "2458": {"acRate": 38.6917580266249, "difficulty": "Hard", "likes": 679, "dislikes": 16, "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": 15811, "totalSubmissionRaw": 40864}, "2459": {"acRate": 46.69565217391305, "difficulty": "Hard", "likes": 41, "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": 1074, "totalSubmissionRaw": 2300}, "2460": {"acRate": 67.1628224065447, "difficulty": "Easy", "likes": 462, "dislikes": 19, "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": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47288, "totalSubmissionRaw": 70408}, "2461": {"acRate": 33.88625592417062, "difficulty": "Medium", "likes": 1054, "dislikes": 14, "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": 34320, "totalSubmissionRaw": 101276}, "2462": {"acRate": 44.32932425252379, "difficulty": "Medium", "likes": 1678, "dislikes": 428, "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": 73418, "totalSubmissionRaw": 165613}, "2463": {"acRate": 40.05706760316067, "difficulty": "Hard", "likes": 448, "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": 7300, "totalSubmissionRaw": 18224}, "2464": {"acRate": 55.98784194528875, "difficulty": "Medium", "likes": 24, "dislikes": 5, "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": 921, "totalSubmissionRaw": 1645}, "2465": {"acRate": 57.93278953754888, "difficulty": "Easy", "likes": 328, "dislikes": 21, "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": 34375, "totalSubmissionRaw": 59336}, "2466": {"acRate": 55.34582925887273, "difficulty": "Medium", "likes": 1613, "dislikes": 138, "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": 67352, "totalSubmissionRaw": 121693}, "2467": {"acRate": 48.480548079275756, "difficulty": "Medium", "likes": 603, "dislikes": 51, "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": 9907, "totalSubmissionRaw": 20435}, "2468": {"acRate": 42.813294746996405, "difficulty": "Hard", "likes": 117, "dislikes": 128, "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": 4882, "totalSubmissionRaw": 11403}, "2469": {"acRate": 88.61565209703916, "difficulty": "Easy", "likes": 512, "dislikes": 298, "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": 120286, "totalSubmissionRaw": 135739}, "2470": {"acRate": 38.45462545168598, "difficulty": "Medium", "likes": 338, "dislikes": 34, "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": 20539, "totalSubmissionRaw": 53411}, "2471": {"acRate": 62.04593040646083, "difficulty": "Medium", "likes": 580, "dislikes": 12, "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": 18669, "totalSubmissionRaw": 30089}, "2472": {"acRate": 38.736463233669056, "difficulty": "Hard", "likes": 419, "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": 12269, "totalSubmissionRaw": 31673}, "2473": {"acRate": 60.02921129503408, "difficulty": "Medium", "likes": 60, "dislikes": 1, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 1233, "totalSubmissionRaw": 2054}, "2474": {"acRate": 40.04667444574096, "difficulty": "Hard", "likes": 32, "dislikes": 5, "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": 1716, "totalSubmissionRaw": 4285}, "2475": {"acRate": 70.55595576083732, "difficulty": "Easy", "likes": 349, "dislikes": 34, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33301, "totalSubmissionRaw": 47198}, "2476": {"acRate": 41.24876751278347, "difficulty": "Medium", "likes": 384, "dislikes": 102, "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 Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17989, "totalSubmissionRaw": 43611}, "2477": {"acRate": 65.72145355025087, "difficulty": "Medium", "likes": 2039, "dislikes": 76, "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": 60515, "totalSubmissionRaw": 92078}, "2478": {"acRate": 30.398688121348776, "difficulty": "Hard", "likes": 328, "dislikes": 15, "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": 8898, "totalSubmissionRaw": 29271}, "2479": {"acRate": 46.808510638297875, "difficulty": "Hard", "likes": 26, "dislikes": 2, "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": 506, "totalSubmissionRaw": 1081}, "2480": {"acRate": 69.10755148741418, "difficulty": "Easy", "likes": 24, "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": 2718, "totalSubmissionRaw": 3933}, "2481": {"acRate": 52.34992180294342, "difficulty": "Easy", "likes": 191, "dislikes": 45, "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": 26109, "totalSubmissionRaw": 49874}, "2482": {"acRate": 79.8128037047908, "difficulty": "Medium", "likes": 400, "dislikes": 19, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 24473, "totalSubmissionRaw": 30663}, "2483": {"acRate": 67.64016667043407, "difficulty": "Medium", "likes": 1774, "dislikes": 87, "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": 89770, "totalSubmissionRaw": 132715}, "2484": {"acRate": 34.78430797791783, "difficulty": "Hard", "likes": 415, "dislikes": 18, "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": 7120, "totalSubmissionRaw": 20469}, "2485": {"acRate": 79.8245755210429, "difficulty": "Easy", "likes": 568, "dislikes": 10, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49599, "totalSubmissionRaw": 62135}, "2486": {"acRate": 65.19186943210332, "difficulty": "Medium", "likes": 400, "dislikes": 20, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 28320, "totalSubmissionRaw": 43441}, "2487": {"acRate": 65.96465995479763, "difficulty": "Medium", "likes": 1185, "dislikes": 31, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 44947, "totalSubmissionRaw": 68138}, "2488": {"acRate": 43.75840053763441, "difficulty": "Hard", "likes": 528, "dislikes": 10, "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": 10417, "totalSubmissionRaw": 23807}, "2489": {"acRate": 58.0590717299578, "difficulty": "Medium", "likes": 34, "dislikes": 1, "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": 688, "totalSubmissionRaw": 1185}, "2490": {"acRate": 62.998153049372604, "difficulty": "Easy", "likes": 324, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33086, "totalSubmissionRaw": 52519}, "2491": {"acRate": 58.86010151456469, "difficulty": "Medium", "likes": 429, "dislikes": 9, "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": 28873, "totalSubmissionRaw": 49055}, "2492": {"acRate": 57.6522932038115, "difficulty": "Medium", "likes": 1687, "dislikes": 280, "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": 77747, "totalSubmissionRaw": 134855}, "2493": {"acRate": 37.251461988304094, "difficulty": "Hard", "likes": 369, "dislikes": 17, "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": 6370, "totalSubmissionRaw": 17100}, "2494": {"acRate": 24.986985944820404, "difficulty": "Hard", "likes": 33, "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": 959, "totalSubmissionRaw": 3841}, "2495": {"acRate": 64.57033125300048, "difficulty": "Medium", "likes": 39, "dislikes": 2, "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": 1345, "totalSubmissionRaw": 2083}, "2496": {"acRate": 71.50406504065042, "difficulty": "Easy", "likes": 343, "dislikes": 17, "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": 33418, "totalSubmissionRaw": 46737}, "2497": {"acRate": 38.47298217302504, "difficulty": "Medium", "likes": 338, "dislikes": 39, "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": 15258, "totalSubmissionRaw": 39659}, "2498": {"acRate": 61.38095604649373, "difficulty": "Medium", "likes": 585, "dislikes": 88, "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": 15948, "totalSubmissionRaw": 25982}, "2499": {"acRate": 42.77230224917867, "difficulty": "Hard", "likes": 199, "dislikes": 8, "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": 3385, "totalSubmissionRaw": 7914}, "2500": {"acRate": 78.06592170918547, "difficulty": "Easy", "likes": 542, "dislikes": 33, "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": 44432, "totalSubmissionRaw": 56916}, "2501": {"acRate": 38.974341347723716, "difficulty": "Medium", "likes": 426, "dislikes": 7, "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": 22678, "totalSubmissionRaw": 58187}, "2502": {"acRate": 52.33372228704785, "difficulty": "Medium", "likes": 255, "dislikes": 76, "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": 13455, "totalSubmissionRaw": 25710}, "2503": {"acRate": 35.622098421541324, "difficulty": "Hard", "likes": 433, "dislikes": 14, "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": 7673, "totalSubmissionRaw": 21540}, "2504": {"acRate": 68.0, "difficulty": "Easy", "likes": 26, "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": 2550, "totalSubmissionRaw": 3750}, "2505": {"acRate": 58.809891808346215, "difficulty": "Medium", "likes": 27, "dislikes": 3, "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": 761, "totalSubmissionRaw": 1294}, "2506": {"acRate": 68.92951444177938, "difficulty": "Easy", "likes": 440, "dislikes": 31, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34198, "totalSubmissionRaw": 49613}, "2507": {"acRate": 47.79745685740236, "difficulty": "Medium", "likes": 348, "dislikes": 22, "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": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18944, "totalSubmissionRaw": 39635}, "2508": {"acRate": 31.204256194703273, "difficulty": "Hard", "likes": 306, "dislikes": 51, "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": 10616, "totalSubmissionRaw": 34021}, "2509": {"acRate": 54.602585896049035, "difficulty": "Hard", "likes": 315, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10600, "totalSubmissionRaw": 19413}, "2510": {"acRate": 50.638947167652105, "difficulty": "Medium", "likes": 74, "dislikes": 3, "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": 2655, "totalSubmissionRaw": 5243}, "2511": {"acRate": 37.564533792240304, "difficulty": "Easy", "likes": 235, "dislikes": 238, "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": 19209, "totalSubmissionRaw": 51136}, "2512": {"acRate": 45.06345212751251, "difficulty": "Medium", "likes": 285, "dislikes": 68, "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": 16299, "totalSubmissionRaw": 36169}, "2513": {"acRate": 26.759086141638928, "difficulty": "Medium", "likes": 326, "dislikes": 63, "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": 5868, "totalSubmissionRaw": 21929}, "2514": {"acRate": 32.41923512637213, "difficulty": "Hard", "likes": 350, "dislikes": 25, "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": 8299, "totalSubmissionRaw": 25599}, "2515": {"acRate": 48.2049786075457, "difficulty": "Easy", "likes": 315, "dislikes": 18, "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": 24787, "totalSubmissionRaw": 51420}, "2516": {"acRate": 34.0205397415968, "difficulty": "Medium", "likes": 637, "dislikes": 59, "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": 13350, "totalSubmissionRaw": 39241}, "2517": {"acRate": 62.885846228631614, "difficulty": "Medium", "likes": 782, "dislikes": 94, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15524, "totalSubmissionRaw": 24686}, "2518": {"acRate": 30.952589606520025, "difficulty": "Hard", "likes": 396, "dislikes": 8, "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": 7064, "totalSubmissionRaw": 22822}, "2519": {"acRate": 55.92479230432882, "difficulty": "Hard", "likes": 61, "dislikes": 7, "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": 2557, "totalSubmissionRaw": 4573}, "2520": {"acRate": 83.45383446801328, "difficulty": "Easy", "likes": 425, "dislikes": 25, "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": 59329, "totalSubmissionRaw": 71092}, "2521": {"acRate": 50.08925527007241, "difficulty": "Medium", "likes": 403, "dislikes": 9, "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": 24973, "totalSubmissionRaw": 49857}, "2522": {"acRate": 45.82162402011537, "difficulty": "Medium", "likes": 341, "dislikes": 45, "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": 18588, "totalSubmissionRaw": 40566}, "2523": {"acRate": 36.642550911039656, "difficulty": "Medium", "likes": 338, "dislikes": 27, "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": 19145, "totalSubmissionRaw": 52248}, "2524": {"acRate": 40.32967032967033, "difficulty": "Hard", "likes": 21, "dislikes": 3, "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": 734, "totalSubmissionRaw": 1820}, "2525": {"acRate": 34.30052859323552, "difficulty": "Easy", "likes": 169, "dislikes": 47, "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": 27189, "totalSubmissionRaw": 79267}, "2526": {"acRate": 46.82439961119936, "difficulty": "Medium", "likes": 255, "dislikes": 26, "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": 19751, "totalSubmissionRaw": 42181}, "2527": {"acRate": 67.92021862381205, "difficulty": "Medium", "likes": 319, "dislikes": 49, "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": 16652, "totalSubmissionRaw": 24517}, "2528": {"acRate": 31.724890829694324, "difficulty": "Hard", "likes": 425, "dislikes": 7, "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": 5812, "totalSubmissionRaw": 18320}, "2529": {"acRate": 71.61452450869663, "difficulty": "Easy", "likes": 751, "dislikes": 40, "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": 76088, "totalSubmissionRaw": 106247}, "2530": {"acRate": 44.404520220621265, "difficulty": "Medium", "likes": 353, "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": 24716, "totalSubmissionRaw": 55661}, "2531": {"acRate": 25.88218531828328, "difficulty": "Medium", "likes": 514, "dislikes": 134, "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": 16349, "totalSubmissionRaw": 63167}, "2532": {"acRate": 46.37550071068613, "difficulty": "Hard", "likes": 105, "dislikes": 208, "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": 3589, "totalSubmissionRaw": 7739}, "2533": {"acRate": 53.832146995530536, "difficulty": "Medium", "likes": 42, "dislikes": 14, "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": 3252, "totalSubmissionRaw": 6041}, "2534": {"acRate": 54.11227154046997, "difficulty": "Hard", "likes": 53, "dislikes": 9, "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": 3316, "totalSubmissionRaw": 6128}, "2535": {"acRate": 83.53160985281781, "difficulty": "Easy", "likes": 585, "dislikes": 16, "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": 87628, "totalSubmissionRaw": 104904}, "2536": {"acRate": 48.21478774247962, "difficulty": "Medium", "likes": 432, "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": 18865, "totalSubmissionRaw": 39127}, "2537": {"acRate": 48.5617491138367, "difficulty": "Medium", "likes": 735, "dislikes": 20, "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": 15481, "totalSubmissionRaw": 31879}, "2538": {"acRate": 32.38827242186705, "difficulty": "Hard", "likes": 385, "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": 6363, "totalSubmissionRaw": 19646}, "2539": {"acRate": 60.58135412974123, "difficulty": "Medium", "likes": 22, "dislikes": 45, "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": 1709, "totalSubmissionRaw": 2821}, "2540": {"acRate": 50.51203249784659, "difficulty": "Easy", "likes": 471, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 47499, "totalSubmissionRaw": 94036}, "2541": {"acRate": 30.997496752115083, "difficulty": "Medium", "likes": 380, "dislikes": 23, "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": 19565, "totalSubmissionRaw": 63118}, "2542": {"acRate": 54.82375557143343, "difficulty": "Medium", "likes": 2348, "dislikes": 115, "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": 64453, "totalSubmissionRaw": 117564}, "2543": {"acRate": 41.33714880332987, "difficulty": "Hard", "likes": 228, "dislikes": 46, "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": 6356, "totalSubmissionRaw": 15376}, "2544": {"acRate": 68.14370542774446, "difficulty": "Easy", "likes": 340, "dislikes": 18, "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": 45673, "totalSubmissionRaw": 67023}, "2545": {"acRate": 84.62818453064035, "difficulty": "Medium", "likes": 548, "dislikes": 33, "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": 44247, "totalSubmissionRaw": 52284}, "2546": {"acRate": 40.440152069706485, "difficulty": "Medium", "likes": 226, "dislikes": 96, "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": 17126, "totalSubmissionRaw": 42349}, "2547": {"acRate": 38.74899698139161, "difficulty": "Hard", "likes": 394, "dislikes": 22, "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": 10141, "totalSubmissionRaw": 26171}, "2548": {"acRate": 65.78599735799207, "difficulty": "Medium", "likes": 30, "dislikes": 4, "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": 996, "totalSubmissionRaw": 1514}, "2549": {"acRate": 59.17905448224665, "difficulty": "Easy", "likes": 213, "dislikes": 228, "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": 32684, "totalSubmissionRaw": 55229}, "2550": {"acRate": 26.854088422758654, "difficulty": "Medium", "likes": 167, "dislikes": 465, "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": 17232, "totalSubmissionRaw": 64169}, "2551": {"acRate": 67.14230907268295, "difficulty": "Hard", "likes": 1949, "dislikes": 75, "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": 54253, "totalSubmissionRaw": 80803}, "2552": {"acRate": 31.988338685144495, "difficulty": "Hard", "likes": 341, "dislikes": 59, "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": 7571, "totalSubmissionRaw": 23668}, "2553": {"acRate": 78.17705636933945, "difficulty": "Easy", "likes": 401, "dislikes": 11, "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": 51342, "totalSubmissionRaw": 65674}, "2554": {"acRate": 52.46111099843836, "difficulty": "Medium", "likes": 284, "dislikes": 19, "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": 25867, "totalSubmissionRaw": 49307}, "2555": {"acRate": 31.808593316309537, "difficulty": "Medium", "likes": 508, "dislikes": 37, "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": 8595, "totalSubmissionRaw": 27021}, "2556": {"acRate": 27.408034247598188, "difficulty": "Medium", "likes": 503, "dislikes": 21, "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": 11012, "totalSubmissionRaw": 40178}, "2557": {"acRate": 41.90298507462686, "difficulty": "Medium", "likes": 26, "dislikes": 20, "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": 1123, "totalSubmissionRaw": 2680}, "2558": {"acRate": 65.72577749048337, "difficulty": "Easy", "likes": 316, "dislikes": 29, "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": 36604, "totalSubmissionRaw": 55692}, "2559": {"acRate": 50.9990975892742, "difficulty": "Medium", "likes": 397, "dislikes": 14, "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": 23736, "totalSubmissionRaw": 46542}, "2560": {"acRate": 41.64383561643836, "difficulty": "Medium", "likes": 809, "dislikes": 20, "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": 14440, "totalSubmissionRaw": 34675}, "2561": {"acRate": 33.24434221875385, "difficulty": "Hard", "likes": 349, "dislikes": 17, "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": 8094, "totalSubmissionRaw": 24345}, "2562": {"acRate": 69.01283673838365, "difficulty": "Easy", "likes": 301, "dislikes": 10, "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": 38171, "totalSubmissionRaw": 55310}, "2563": {"acRate": 32.55141437602867, "difficulty": "Medium", "likes": 717, "dislikes": 33, "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": 21162, "totalSubmissionRaw": 65011}, "2564": {"acRate": 32.99175500588928, "difficulty": "Medium", "likes": 340, "dislikes": 79, "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": 11204, "totalSubmissionRaw": 33960}, "2565": {"acRate": 30.495654972642424, "difficulty": "Hard", "likes": 339, "dislikes": 6, "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": 5685, "totalSubmissionRaw": 18642}, "2566": {"acRate": 58.70810381210776, "difficulty": "Easy", "likes": 205, "dislikes": 34, "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": 21422, "totalSubmissionRaw": 36489}, "2567": {"acRate": 47.23786286286286, "difficulty": "Medium", "likes": 202, "dislikes": 195, "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": 15101, "totalSubmissionRaw": 31968}, "2568": {"acRate": 56.64111850416912, "difficulty": "Medium", "likes": 320, "dislikes": 17, "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": 13450, "totalSubmissionRaw": 23746}, "2569": {"acRate": 26.259541984732827, "difficulty": "Hard", "likes": 160, "dislikes": 23, "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": 4300, "totalSubmissionRaw": 16375}, "2570": {"acRate": 72.8176473228311, "difficulty": "Easy", "likes": 278, "dislikes": 9, "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": 32449, "totalSubmissionRaw": 44562}, "2571": {"acRate": 50.86046511627907, "difficulty": "Medium", "likes": 454, "dislikes": 186, "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": 19682, "totalSubmissionRaw": 38699}, "2572": {"acRate": 21.829119390095002, "difficulty": "Medium", "likes": 399, "dislikes": 104, "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": 7330, "totalSubmissionRaw": 33579}, "2573": {"acRate": 31.31601937892145, "difficulty": "Hard", "likes": 174, "dislikes": 15, "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": 3943, "totalSubmissionRaw": 12591}, "2574": {"acRate": 85.93956834532374, "difficulty": "Easy", "likes": 825, "dislikes": 65, "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": 89592, "totalSubmissionRaw": 104250}, "2575": {"acRate": 31.737202633814782, "difficulty": "Medium", "likes": 489, "dislikes": 16, "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": 23907, "totalSubmissionRaw": 75328}, "2576": {"acRate": 37.63184905330742, "difficulty": "Medium", "likes": 520, "dislikes": 23, "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": 17232, "totalSubmissionRaw": 45791}, "2577": {"acRate": 34.36838124054463, "difficulty": "Hard", "likes": 486, "dislikes": 8, "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": 9087, "totalSubmissionRaw": 26440}, "2578": {"acRate": 69.08044506970201, "difficulty": "Easy", "likes": 309, "dislikes": 26, "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": 27007, "totalSubmissionRaw": 39095}, "2579": {"acRate": 57.083067500319, "difficulty": "Medium", "likes": 264, "dislikes": 18, "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": 22368, "totalSubmissionRaw": 39185}, "2580": {"acRate": 34.99821163967094, "difficulty": "Medium", "likes": 287, "dislikes": 17, "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": 13699, "totalSubmissionRaw": 39142}, "2581": {"acRate": 45.14840182648402, "difficulty": "Hard", "likes": 270, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"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": 4746, "totalSubmissionRaw": 10512}, "2582": {"acRate": 45.41618661439708, "difficulty": "Easy", "likes": 335, "dislikes": 13, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30353, "totalSubmissionRaw": 66833}, "2583": {"acRate": 46.70875096376253, "difficulty": "Medium", "likes": 469, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29079, "totalSubmissionRaw": 62256}, "2584": {"acRate": 22.1159891598916, "difficulty": "Hard", "likes": 292, "dislikes": 110, "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": 10201, "totalSubmissionRaw": 46125}, "2585": {"acRate": 56.93314983944284, "difficulty": "Hard", "likes": 431, "dislikes": 8, "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": 13652, "totalSubmissionRaw": 23979}, "2586": {"acRate": 74.04558499632917, "difficulty": "Easy", "likes": 279, "dislikes": 19, "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": 44377, "totalSubmissionRaw": 59932}, "2587": {"acRate": 40.046560243253516, "difficulty": "Medium", "likes": 256, "dislikes": 37, "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": 25287, "totalSubmissionRaw": 63144}, "2588": {"acRate": 48.96372203367492, "difficulty": "Medium", "likes": 439, "dislikes": 15, "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": 14860, "totalSubmissionRaw": 30349}, "2589": {"acRate": 36.99874383998454, "difficulty": "Hard", "likes": 392, "dislikes": 13, "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": 7658, "totalSubmissionRaw": 20698}, "2590": {"acRate": 59.70488081725313, "difficulty": "Medium", "likes": 23, "dislikes": 10, "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": 1052, "totalSubmissionRaw": 1762}, "2591": {"acRate": 18.81605504977815, "difficulty": "Easy", "likes": 228, "dislikes": 724, "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": 22094, "totalSubmissionRaw": 117421}, "2592": {"acRate": 56.26986506746626, "difficulty": "Medium", "likes": 379, "dislikes": 11, "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": 18766, "totalSubmissionRaw": 33350}, "2593": {"acRate": 51.969620253164564, "difficulty": "Medium", "likes": 322, "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": "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": 15396, "totalSubmissionRaw": 29625}, "2594": {"acRate": 42.55592784377433, "difficulty": "Medium", "likes": 485, "dislikes": 23, "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": 12574, "totalSubmissionRaw": 29547}, "2595": {"acRate": 71.04656803298569, "difficulty": "Easy", "likes": 228, "dislikes": 96, "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": 35150, "totalSubmissionRaw": 49475}, "2596": {"acRate": 56.659261877114155, "difficulty": "Medium", "likes": 325, "dislikes": 45, "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": 22445, "totalSubmissionRaw": 39614}, "2597": {"acRate": 30.102127498914545, "difficulty": "Medium", "likes": 467, "dislikes": 94, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15946, "totalSubmissionRaw": 52973}, "2598": {"acRate": 38.590096073646166, "difficulty": "Medium", "likes": 313, "dislikes": 31, "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": 12492, "totalSubmissionRaw": 32371}, "2599": {"acRate": 51.22684026039058, "difficulty": "Medium", "likes": 34, "dislikes": 1, "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": 1023, "totalSubmissionRaw": 1997}, "2600": {"acRate": 61.0488217475117, "difficulty": "Easy", "likes": 233, "dislikes": 23, "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": 31036, "totalSubmissionRaw": 50838}, "2601": {"acRate": 36.89108659819957, "difficulty": "Medium", "likes": 348, "dislikes": 31, "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": 14548, "totalSubmissionRaw": 39435}, "2602": {"acRate": 34.55128668933748, "difficulty": "Medium", "likes": 618, "dislikes": 16, "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": 14326, "totalSubmissionRaw": 41463}, "2603": {"acRate": 35.81768668482156, "difficulty": "Hard", "likes": 348, "dislikes": 7, "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": 4998, "totalSubmissionRaw": 13954}, "2604": {"acRate": 45.31346989447548, "difficulty": "Hard", "likes": 34, "dislikes": 2, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 730, "totalSubmissionRaw": 1611}, "2605": {"acRate": 53.08279821846996, "difficulty": "Easy", "likes": 260, "dislikes": 17, "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": 29675, "totalSubmissionRaw": 55905}, "2606": {"acRate": 55.7141303756864, "difficulty": "Medium", "likes": 311, "dislikes": 9, "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": 20495, "totalSubmissionRaw": 36786}, "2607": {"acRate": 34.1016548463357, "difficulty": "Medium", "likes": 405, "dislikes": 75, "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": 8078, "totalSubmissionRaw": 23688}, "2608": {"acRate": 36.244825066969725, "difficulty": "Hard", "likes": 425, "dislikes": 14, "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": 13395, "totalSubmissionRaw": 36955}, "2609": {"acRate": 45.49262940176334, "difficulty": "Easy", "likes": 328, "dislikes": 18, "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": 25954, "totalSubmissionRaw": 57051}, "2610": {"acRate": 83.36377511446943, "difficulty": "Medium", "likes": 442, "dislikes": 12, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 33318, "totalSubmissionRaw": 39967}, "2611": {"acRate": 43.424345591053594, "difficulty": "Medium", "likes": 539, "dislikes": 31, "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": 19260, "totalSubmissionRaw": 44353}, "2612": {"acRate": 14.683199113724488, "difficulty": "Hard", "likes": 207, "dislikes": 64, "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": 3446, "totalSubmissionRaw": 23469}, "2613": {"acRate": 46.44808743169399, "difficulty": "Hard", "likes": 15, "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": 423, "totalSubmissionRaw": 913}, "2614": {"acRate": 32.664782569058254, "difficulty": "Easy", "likes": 287, "dislikes": 29, "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": 32247, "totalSubmissionRaw": 98721}, "2615": {"acRate": 29.8471079215258, "difficulty": "Medium", "likes": 618, "dislikes": 77, "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": 15305, "totalSubmissionRaw": 51278}, "2616": {"acRate": 44.269266313222204, "difficulty": "Medium", "likes": 2144, "dislikes": 210, "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": 63710, "totalSubmissionRaw": 143916}, "2617": {"acRate": 24.875205082556636, "difficulty": "Hard", "likes": 335, "dislikes": 26, "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": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7126, "totalSubmissionRaw": 28647}, "2618": {"acRate": 28.504027411513555, "difficulty": "Medium", "likes": 241, "dislikes": 87, "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": 15888, "totalSubmissionRaw": 55738}, "2619": {"acRate": 71.39140761965804, "difficulty": "Easy", "likes": 394, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75741, "totalSubmissionRaw": 106093}, "2620": {"acRate": 79.59358444009, "difficulty": "Easy", "likes": 871, "dislikes": 59, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164504, "totalSubmissionRaw": 206681}, "2621": {"acRate": 84.8954033354079, "difficulty": "Easy", "likes": 481, "dislikes": 33, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66837, "totalSubmissionRaw": 78727}, "2622": {"acRate": 75.77820321917322, "difficulty": "Medium", "likes": 324, "dislikes": 26, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21373, "totalSubmissionRaw": 28199}, "2623": {"acRate": 61.73074886134944, "difficulty": "Medium", "likes": 443, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40796, "totalSubmissionRaw": 66087}, "2624": {"acRate": 65.2105096549541, "difficulty": "Medium", "likes": 83, "dislikes": 39, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6180, "totalSubmissionRaw": 9477}, "2625": {"acRate": 66.23660389137447, "difficulty": "Medium", "likes": 243, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19097, "totalSubmissionRaw": 28828}, "2626": {"acRate": 83.66211882095403, "difficulty": "Easy", "likes": 442, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65735, "totalSubmissionRaw": 78572}, "2627": {"acRate": 91.99715528781793, "difficulty": "Medium", "likes": 298, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21991, "totalSubmissionRaw": 23904}, "2628": {"acRate": 38.12614003086853, "difficulty": "Medium", "likes": 205, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10869, "totalSubmissionRaw": 28508}, "2629": {"acRate": 85.60653771180087, "difficulty": "Easy", "likes": 491, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57090, "totalSubmissionRaw": 66689}, "2630": {"acRate": 31.704220882259598, "difficulty": "Hard", "likes": 98, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2997, "totalSubmissionRaw": 9453}, "2631": {"acRate": 83.17146309806203, "difficulty": "Medium", "likes": 228, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18583, "totalSubmissionRaw": 22343}, "2632": {"acRate": 89.26485640315491, "difficulty": "Hard", "likes": 331, "dislikes": 34, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14826, "totalSubmissionRaw": 16609}, "2633": {"acRate": 77.57229832572298, "difficulty": "Medium", "likes": 196, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10193, "totalSubmissionRaw": 13140}, "2634": {"acRate": 83.46347576699684, "difficulty": "Easy", "likes": 468, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69260, "totalSubmissionRaw": 82982}, "2635": {"acRate": 85.63559370660668, "difficulty": "Easy", "likes": 532, "dislikes": 35, "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": 74622, "totalSubmissionRaw": 87139}, "2636": {"acRate": 80.7868601986249, "difficulty": "Medium", "likes": 270, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10575, "totalSubmissionRaw": 13090}, "2637": {"acRate": 81.70098194488439, "difficulty": "Medium", "likes": 379, "dislikes": 46, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25793, "totalSubmissionRaw": 31570}, "2638": {"acRate": 50.19815059445178, "difficulty": "Medium", "likes": 57, "dislikes": 7, "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": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1520, "totalSubmissionRaw": 3028}, "2639": {"acRate": 65.95738348907804, "difficulty": "Easy", "likes": 143, "dislikes": 28, "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": 22163, "totalSubmissionRaw": 33602}, "2640": {"acRate": 69.79975354282193, "difficulty": "Medium", "likes": 224, "dislikes": 17, "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": 22657, "totalSubmissionRaw": 32460}, "2641": {"acRate": 67.7253105453264, "difficulty": "Medium", "likes": 480, "dislikes": 7, "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": 15375, "totalSubmissionRaw": 22702}, "2642": {"acRate": 58.232636928289104, "difficulty": "Hard", "likes": 196, "dislikes": 21, "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": 10313, "totalSubmissionRaw": 17710}, "2643": {"acRate": 75.53403967967131, "difficulty": "Easy", "likes": 329, "dislikes": 9, "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": 39709, "totalSubmissionRaw": 52571}, "2644": {"acRate": 48.16200665626234, "difficulty": "Easy", "likes": 147, "dislikes": 39, "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": 25614, "totalSubmissionRaw": 53183}, "2645": {"acRate": 49.4610193948139, "difficulty": "Medium", "likes": 472, "dislikes": 19, "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": 23309, "totalSubmissionRaw": 47126}, "2646": {"acRate": 43.019197207678886, "difficulty": "Hard", "likes": 425, "dislikes": 16, "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": 7888, "totalSubmissionRaw": 18336}, "2647": {"acRate": 68.84816753926701, "difficulty": "Hard", "likes": 10, "dislikes": 13, "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": 263, "totalSubmissionRaw": 382}, "2648": {"acRate": 83.79133210313701, "difficulty": "Easy", "likes": 213, "dislikes": 20, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16801, "totalSubmissionRaw": 20051}, "2649": {"acRate": 80.99846251243557, "difficulty": "Medium", "likes": 147, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8956, "totalSubmissionRaw": 11057}, "2650": {"acRate": 49.652476107732404, "difficulty": "Hard", "likes": 54, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1143, "totalSubmissionRaw": 2302}, "2651": {"acRate": 79.01816377928719, "difficulty": "Easy", "likes": 186, "dislikes": 39, "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": 41415, "totalSubmissionRaw": 52412}, "2652": {"acRate": 84.76301657716554, "difficulty": "Easy", "likes": 421, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72607, "totalSubmissionRaw": 85657}, "2653": {"acRate": 31.90219595573324, "difficulty": "Medium", "likes": 545, "dislikes": 102, "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": 16518, "totalSubmissionRaw": 51777}, "2654": {"acRate": 34.751573213111676, "difficulty": "Medium", "likes": 358, "dislikes": 14, "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": 11100, "totalSubmissionRaw": 31941}, "2655": {"acRate": 54.177718832891244, "difficulty": "Medium", "likes": 20, "dislikes": 2, "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": 817, "totalSubmissionRaw": 1508}, "2656": {"acRate": 81.52221733391994, "difficulty": "Easy", "likes": 293, "dislikes": 33, "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": 46325, "totalSubmissionRaw": 56825}, "2657": {"acRate": 79.83744394618833, "difficulty": "Medium", "likes": 365, "dislikes": 9, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28486, "totalSubmissionRaw": 35680}, "2658": {"acRate": 58.673206770218314, "difficulty": "Medium", "likes": 361, "dislikes": 19, "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": 19378, "totalSubmissionRaw": 33027}, "2659": {"acRate": 24.246360979066402, "difficulty": "Hard", "likes": 479, "dislikes": 24, "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": 8212, "totalSubmissionRaw": 33869}, "2660": {"acRate": 33.919677734375, "difficulty": "Easy", "likes": 204, "dislikes": 101, "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": 27787, "totalSubmissionRaw": 81920}, "2661": {"acRate": 49.52804711812968, "difficulty": "Medium", "likes": 360, "dislikes": 6, "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": 19257, "totalSubmissionRaw": 38881}, "2662": {"acRate": 35.784165023509786, "difficulty": "Medium", "likes": 472, "dislikes": 71, "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": 9437, "totalSubmissionRaw": 26372}, "2663": {"acRate": 36.437282229965156, "difficulty": "Hard", "likes": 171, "dislikes": 15, "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": 4183, "totalSubmissionRaw": 11480}, "2664": {"acRate": 69.21119592875317, "difficulty": "Medium", "likes": 25, "dislikes": 0, "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": 816, "totalSubmissionRaw": 1179}, "2665": {"acRate": 80.27070213365917, "difficulty": "Easy", "likes": 545, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76855, "totalSubmissionRaw": 95745}, "2666": {"acRate": 86.44716692189893, "difficulty": "Easy", "likes": 352, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42902, "totalSubmissionRaw": 49628}, "2667": {"acRate": 79.85706225315027, "difficulty": "Easy", "likes": 819, "dislikes": 113, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157091, "totalSubmissionRaw": 196709}, "2668": {"acRate": 64.41281138790036, "difficulty": "Easy", "likes": 14, "dislikes": 15, "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": 1448, "totalSubmissionRaw": 2247}, "2669": {"acRate": 67.444120505345, "difficulty": "Easy", "likes": 13, "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": 1388, "totalSubmissionRaw": 2058}, "2670": {"acRate": 76.4784515025131, "difficulty": "Easy", "likes": 267, "dislikes": 24, "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": 28606, "totalSubmissionRaw": 37404}, "2671": {"acRate": 28.79239597358466, "difficulty": "Medium", "likes": 296, "dislikes": 22, "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": 17963, "totalSubmissionRaw": 62388}, "2672": {"acRate": 54.16567009487363, "difficulty": "Medium", "likes": 321, "dislikes": 81, "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": 13588, "totalSubmissionRaw": 25086}, "2673": {"acRate": 58.248742569730226, "difficulty": "Medium", "likes": 505, "dislikes": 9, "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": 12739, "totalSubmissionRaw": 21870}, "2674": {"acRate": 74.60978147762746, "difficulty": "Medium", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 717, "totalSubmissionRaw": 961}, "2675": {"acRate": 69.62503043584125, "difficulty": "Hard", "likes": 129, "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": 5719, "totalSubmissionRaw": 8214}, "2676": {"acRate": 85.63758389261746, "difficulty": "Medium", "likes": 155, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7656, "totalSubmissionRaw": 8940}, "2677": {"acRate": 82.67384535547482, "difficulty": "Easy", "likes": 262, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25490, "totalSubmissionRaw": 30832}, "2678": {"acRate": 75.78163094146788, "difficulty": "Easy", "likes": 222, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38854, "totalSubmissionRaw": 51271}, "2679": {"acRate": 58.68909696873512, "difficulty": "Medium", "likes": 290, "dislikes": 47, "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": 25886, "totalSubmissionRaw": 44107}, "2680": {"acRate": 39.684155114932445, "difficulty": "Medium", "likes": 344, "dislikes": 41, "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": 11308, "totalSubmissionRaw": 28495}, "2681": {"acRate": 29.569040640101402, "difficulty": "Hard", "likes": 291, "dislikes": 15, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7465, "totalSubmissionRaw": 25246}, "2682": {"acRate": 48.18391467281637, "difficulty": "Easy", "likes": 218, "dislikes": 35, "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": 23401, "totalSubmissionRaw": 48566}, "2683": {"acRate": 60.82816937774334, "difficulty": "Medium", "likes": 247, "dislikes": 7, "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": 18847, "totalSubmissionRaw": 30984}, "2684": {"acRate": 44.71105555679561, "difficulty": "Medium", "likes": 375, "dislikes": 5, "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": 20031, "totalSubmissionRaw": 44801}, "2685": {"acRate": 64.80317679558011, "difficulty": "Medium", "likes": 511, "dislikes": 12, "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": 18767, "totalSubmissionRaw": 28960}, "2686": {"acRate": 57.15915573302909, "difficulty": "Medium", "likes": 9, "dislikes": 0, "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": 1002, "totalSubmissionRaw": 1753}, "2687": {"acRate": 77.49595250944414, "difficulty": "Easy", "likes": 18, "dislikes": 2, "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": 1436, "totalSubmissionRaw": 1853}, "2688": {"acRate": 38.743116294136705, "difficulty": "Medium", "likes": 16, "dislikes": 3, "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": 1196, "totalSubmissionRaw": 3087}, "2689": {"acRate": 74.71810089020772, "difficulty": "Easy", "likes": 25, "dislikes": 15, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1259, "totalSubmissionRaw": 1685}, "2690": {"acRate": 91.78082191780823, "difficulty": "Easy", "likes": 21, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 603, "totalSubmissionRaw": 657}, "2691": {"acRate": 42.333333333333336, "difficulty": "Hard", "likes": 7, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127, "totalSubmissionRaw": 300}, "2692": {"acRate": 61.09725685785536, "difficulty": "Medium", "likes": 14, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245, "totalSubmissionRaw": 401}, "2693": {"acRate": 82.03878236377425, "difficulty": "Medium", "likes": 125, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7573, "totalSubmissionRaw": 9231}, "2694": {"acRate": 82.05279023601206, "difficulty": "Medium", "likes": 172, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11160, "totalSubmissionRaw": 13601}, "2695": {"acRate": 88.0144912951595, "difficulty": "Easy", "likes": 186, "dislikes": 20, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17492, "totalSubmissionRaw": 19874}, "2696": {"acRate": 68.17523461836075, "difficulty": "Easy", "likes": 333, "dislikes": 8, "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": 34361, "totalSubmissionRaw": 50401}, "2697": {"acRate": 80.47695061190925, "difficulty": "Easy", "likes": 275, "dislikes": 13, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33274, "totalSubmissionRaw": 41346}, "2698": {"acRate": 60.92075913262881, "difficulty": "Medium", "likes": 426, "dislikes": 25, "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": 16660, "totalSubmissionRaw": 27347}, "2699": {"acRate": 21.926830728698878, "difficulty": "Hard", "likes": 251, "dislikes": 41, "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": 3662, "totalSubmissionRaw": 16701}, "2700": {"acRate": 82.26855959775214, "difficulty": "Medium", "likes": 126, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5563, "totalSubmissionRaw": 6762}, "2701": {"acRate": 22.50789354984213, "difficulty": "Hard", "likes": 20, "dislikes": 0, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 499, "totalSubmissionRaw": 2217}, "2702": {"acRate": 52.742616033755276, "difficulty": "Hard", "likes": 29, "dislikes": 0, "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": 625, "totalSubmissionRaw": 1185}, "2703": {"acRate": 92.47647647647648, "difficulty": "Easy", "likes": 189, "dislikes": 96, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46191, "totalSubmissionRaw": 49949}, "2704": {"acRate": 61.26749730810644, "difficulty": "Easy", "likes": 358, "dislikes": 62, "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": 51778, "totalSubmissionRaw": 84511}, "2705": {"acRate": 64.72247497725205, "difficulty": "Medium", "likes": 107, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7112, "totalSubmissionRaw": 10989}, "2706": {"acRate": 63.18528968234665, "difficulty": "Easy", "likes": 262, "dislikes": 11, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 38967, "totalSubmissionRaw": 61671}, "2707": {"acRate": 52.86945098559859, "difficulty": "Medium", "likes": 1922, "dislikes": 83, "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": 75658, "totalSubmissionRaw": 143107}, "2708": {"acRate": 23.32711562788105, "difficulty": "Medium", "likes": 309, "dislikes": 42, "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": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21760, "totalSubmissionRaw": 93282}, "2709": {"acRate": 22.658663092254795, "difficulty": "Hard", "likes": 299, "dislikes": 27, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7776, "totalSubmissionRaw": 34315}, "2710": {"acRate": 78.20963770664791, "difficulty": "Easy", "likes": 248, "dislikes": 8, "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": 44470, "totalSubmissionRaw": 56860}, "2711": {"acRate": 70.52774234693877, "difficulty": "Medium", "likes": 111, "dislikes": 189, "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": 17694, "totalSubmissionRaw": 25088}, "2712": {"acRate": 53.600053882939314, "difficulty": "Medium", "likes": 480, "dislikes": 20, "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": 15916, "totalSubmissionRaw": 29694}, "2713": {"acRate": 27.849530196885684, "difficulty": "Hard", "likes": 476, "dislikes": 12, "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": "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8388, "totalSubmissionRaw": 30119}, "2714": {"acRate": 60.270880361173816, "difficulty": "Hard", "likes": 20, "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": 534, "totalSubmissionRaw": 886}, "2715": {"acRate": 87.25753324386972, "difficulty": "Easy", "likes": 124, "dislikes": 127, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14305, "totalSubmissionRaw": 16394}, "2716": {"acRate": 74.50681350023768, "difficulty": "Easy", "likes": 227, "dislikes": 66, "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": 37617, "totalSubmissionRaw": 50488}, "2717": {"acRate": 62.93549217342475, "difficulty": "Easy", "likes": 186, "dislikes": 10, "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": 26898, "totalSubmissionRaw": 42739}, "2718": {"acRate": 29.8859230300894, "difficulty": "Medium", "likes": 652, "dislikes": 23, "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": 18653, "totalSubmissionRaw": 62414}, "2719": {"acRate": 33.634833000509026, "difficulty": "Hard", "likes": 458, "dislikes": 10, "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": 8590, "totalSubmissionRaw": 25539}, "2720": {"acRate": 41.15076474872542, "difficulty": "Hard", "likes": 9, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 565, "totalSubmissionRaw": 1373}, "2721": {"acRate": 80.46531125550199, "difficulty": "Medium", "likes": 112, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7678, "totalSubmissionRaw": 9542}, "2722": {"acRate": 52.58290234256161, "difficulty": "Medium", "likes": 89, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8642, "totalSubmissionRaw": 16435}, "2723": {"acRate": 89.73726327020539, "difficulty": "Easy", "likes": 167, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26914, "totalSubmissionRaw": 29992}, "2724": {"acRate": 81.21091151031271, "difficulty": "Easy", "likes": 97, "dislikes": 22, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12206, "totalSubmissionRaw": 15030}, "2725": {"acRate": 85.24040519332287, "difficulty": "Easy", "likes": 96, "dislikes": 39, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11949, "totalSubmissionRaw": 14018}, "2726": {"acRate": 72.72727272727273, "difficulty": "Easy", "likes": 75, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8936, "totalSubmissionRaw": 12287}, "2727": {"acRate": 77.45146088595665, "difficulty": "Easy", "likes": 118, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20544, "totalSubmissionRaw": 26525}, "2728": {"acRate": 83.89630793401413, "difficulty": "Easy", "likes": 38, "dislikes": 6, "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": 1068, "totalSubmissionRaw": 1273}, "2729": {"acRate": 51.367225837624, "difficulty": "Easy", "likes": 194, "dislikes": 10, "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": 34020, "totalSubmissionRaw": 66229}, "2730": {"acRate": 34.97344691164415, "difficulty": "Medium", "likes": 252, "dislikes": 70, "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": 19625, "totalSubmissionRaw": 56114}, "2731": {"acRate": 28.332868763145225, "difficulty": "Medium", "likes": 430, "dislikes": 82, "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": 11181, "totalSubmissionRaw": 39463}, "2732": {"acRate": 44.27545093243657, "difficulty": "Hard", "likes": 196, "dislikes": 19, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5793, "totalSubmissionRaw": 13084}, "2733": {"acRate": 76.84017263167935, "difficulty": "Easy", "likes": 268, "dislikes": 11, "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": 64452, "totalSubmissionRaw": 83878}, "2734": {"acRate": 29.807377565151704, "difficulty": "Medium", "likes": 191, "dislikes": 169, "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": 23676, "totalSubmissionRaw": 79430}, "2735": {"acRate": 31.918895654668923, "difficulty": "Medium", "likes": 267, "dislikes": 510, "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": 10012, "totalSubmissionRaw": 31367}, "2736": {"acRate": 24.778586892344027, "difficulty": "Hard", "likes": 286, "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": 3777, "totalSubmissionRaw": 15243}, "2737": {"acRate": 54.231770833333336, "difficulty": "Medium", "likes": 29, "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": 833, "totalSubmissionRaw": 1536}, "2738": {"acRate": 53.7564162389174, "difficulty": "Medium", "likes": 10, "dislikes": 31, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1149, "totalSubmissionRaw": 2139}, "2739": {"acRate": 38.50374230013468, "difficulty": "Easy", "likes": 246, "dislikes": 88, "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": 34879, "totalSubmissionRaw": 90586}, "2740": {"acRate": 64.5002438967736, "difficulty": "Medium", "likes": 234, "dislikes": 14, "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": 27768, "totalSubmissionRaw": 43051}, "2741": {"acRate": 26.453118861078373, "difficulty": "Medium", "likes": 492, "dislikes": 56, "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": 11446, "totalSubmissionRaw": 43269}, "2742": {"acRate": 51.93743470801905, "difficulty": "Hard", "likes": 1205, "dislikes": 70, "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": 54190, "totalSubmissionRaw": 104338}, "2743": {"acRate": 72.87878787878788, "difficulty": "Medium", "likes": 41, "dislikes": 0, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 962, "totalSubmissionRaw": 1320}, "2744": {"acRate": 80.30161228570213, "difficulty": "Easy", "likes": 252, "dislikes": 7, "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": 37753, "totalSubmissionRaw": 47014}, "2745": {"acRate": 51.899039289280665, "difficulty": "Medium", "likes": 254, "dislikes": 19, "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": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15072, "totalSubmissionRaw": 29041}, "2746": {"acRate": 24.97792760253632, "difficulty": "Medium", "likes": 329, "dislikes": 26, "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": 6224, "totalSubmissionRaw": 24918}, "2747": {"acRate": 31.200839014158365, "difficulty": "Medium", "likes": 280, "dislikes": 25, "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": 4165, "totalSubmissionRaw": 13349}, "2748": {"acRate": 49.015547678377146, "difficulty": "Easy", "likes": 171, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "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": 27932, "totalSubmissionRaw": 56986}, "2749": {"acRate": 29.006872485133357, "difficulty": "Medium", "likes": 255, "dislikes": 276, "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": 8146, "totalSubmissionRaw": 28083}, "2750": {"acRate": 32.98044825941822, "difficulty": "Medium", "likes": 369, "dislikes": 8, "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": 17290, "totalSubmissionRaw": 52425}, "2751": {"acRate": 39.75915704967386, "difficulty": "Hard", "likes": 381, "dislikes": 12, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 7924, "totalSubmissionRaw": 19930}, "2752": {"acRate": 34.58588957055215, "difficulty": "Hard", "likes": 8, "dislikes": 16, "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": 451, "totalSubmissionRaw": 1304}, "2753": {"acRate": 76.22259696458684, "difficulty": "Hard", "likes": 17, "dislikes": 0, "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": 452, "totalSubmissionRaw": 593}, "2754": {"acRate": 90.96989966555184, "difficulty": "Medium", "likes": 10, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 272, "totalSubmissionRaw": 299}, "2755": {"acRate": 57.14285714285714, "difficulty": "Medium", "likes": 10, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224, "totalSubmissionRaw": 392}, "2756": {"acRate": 72.62569832402235, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130, "totalSubmissionRaw": 179}, "2757": {"acRate": 80.0925925925926, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 173, "totalSubmissionRaw": 216}, "2758": {"acRate": 85.46168958742632, "difficulty": "Easy", "likes": 10, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435, "totalSubmissionRaw": 509}, "2759": {"acRate": 69.23076923076923, "difficulty": "Hard", "likes": 9, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 171, "totalSubmissionRaw": 247}, "2760": {"acRate": 28.633038366929686, "difficulty": "Easy", "likes": 229, "dislikes": 235, "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": 26889, "totalSubmissionRaw": 93909}, "2761": {"acRate": 32.85550927060361, "difficulty": "Medium", "likes": 305, "dislikes": 30, "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": 24135, "totalSubmissionRaw": 73458}, "2762": {"acRate": 40.50818869361771, "difficulty": "Medium", "likes": 590, "dislikes": 13, "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": 14890, "totalSubmissionRaw": 36758}, "2763": {"acRate": 46.086576300830785, "difficulty": "Hard", "likes": 276, "dislikes": 7, "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": 6324, "totalSubmissionRaw": 13722}, "2764": {"acRate": 67.35582154515778, "difficulty": "Medium", "likes": 22, "dislikes": 1, "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": 619, "totalSubmissionRaw": 919}, "2765": {"acRate": 32.997709323395675, "difficulty": "Easy", "likes": 171, "dislikes": 146, "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": 19303, "totalSubmissionRaw": 58498}, "2766": {"acRate": 50.846441947565545, "difficulty": "Medium", "likes": 165, "dislikes": 11, "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": 16970, "totalSubmissionRaw": 33375}, "2767": {"acRate": 51.964517524881, "difficulty": "Medium", "likes": 280, "dislikes": 8, "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": 12009, "totalSubmissionRaw": 23110}, "2768": {"acRate": 35.313774354327144, "difficulty": "Medium", "likes": 204, "dislikes": 17, "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": 6235, "totalSubmissionRaw": 17656}, "2769": {"acRate": 88.43999852621495, "difficulty": "Easy", "likes": 216, "dislikes": 230, "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": 48004, "totalSubmissionRaw": 54279}, "2770": {"acRate": 28.828230795783437, "difficulty": "Medium", "likes": 342, "dislikes": 10, "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": 21714, "totalSubmissionRaw": 75322}, "2771": {"acRate": 27.31869841699364, "difficulty": "Medium", "likes": 481, "dislikes": 9, "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": 16153, "totalSubmissionRaw": 59127}, "2772": {"acRate": 32.022009159500506, "difficulty": "Medium", "likes": 331, "dislikes": 18, "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": 9719, "totalSubmissionRaw": 30351}, "2773": {"acRate": 72.94117647058823, "difficulty": "Medium", "likes": 7, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 372, "totalSubmissionRaw": 510}, "2774": {"acRate": 79.9709724238026, "difficulty": "Easy", "likes": 12, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 551, "totalSubmissionRaw": 689}, "2775": {"acRate": 73.69942196531792, "difficulty": "Medium", "likes": 10, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 255, "totalSubmissionRaw": 346}, "2776": {"acRate": 92.93680297397769, "difficulty": "Medium", "likes": 9, "dislikes": 6, "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": 250, "totalSubmissionRaw": 269}, "2777": {"acRate": 91.81818181818183, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 202, "totalSubmissionRaw": 220}, "2778": {"acRate": 78.7460109571858, "difficulty": "Easy", "likes": 195, "dislikes": 55, "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": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42689, "totalSubmissionRaw": 54211}, "2779": {"acRate": 36.69526458661483, "difficulty": "Medium", "likes": 548, "dislikes": 11, "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": 21899, "totalSubmissionRaw": 59678}, "2780": {"acRate": 61.921150477829336, "difficulty": "Medium", "likes": 277, "dislikes": 11, "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": 20151, "totalSubmissionRaw": 32543}, "2781": {"acRate": 33.252131546894034, "difficulty": "Hard", "likes": 431, "dislikes": 6, "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": 9828, "totalSubmissionRaw": 29556}, "2782": {"acRate": 84.3385214007782, "difficulty": "Medium", "likes": 19, "dislikes": 1, "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": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 867, "totalSubmissionRaw": 1028}, "2783": {"acRate": 35.45183714001986, "difficulty": "Medium", "likes": 10, "dislikes": 3, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 714, "totalSubmissionRaw": 2014}, "2784": {"acRate": 50.12145854171809, "difficulty": "Easy", "likes": 220, "dislikes": 39, "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": 38584, "totalSubmissionRaw": 76981}, "2785": {"acRate": 75.32916309337638, "difficulty": "Medium", "likes": 246, "dislikes": 7, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29864, "totalSubmissionRaw": 39644}, "2786": {"acRate": 35.13833908423125, "difficulty": "Medium", "likes": 429, "dislikes": 20, "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": 16599, "totalSubmissionRaw": 47239}, "2787": {"acRate": 33.04332386363637, "difficulty": "Medium", "likes": 336, "dislikes": 11, "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": 14888, "totalSubmissionRaw": 45056}, "2788": {"acRate": 71.51026421385232, "difficulty": "Easy", "likes": 238, "dislikes": 4, "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": 36890, "totalSubmissionRaw": 51587}, "2789": {"acRate": 46.33783879414054, "difficulty": "Medium", "likes": 402, "dislikes": 23, "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"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26192, "totalSubmissionRaw": 56524}, "2790": {"acRate": 18.833275113528618, "difficulty": "Hard", "likes": 376, "dislikes": 38, "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": 7548, "totalSubmissionRaw": 40078}, "2791": {"acRate": 44.29218698198696, "difficulty": "Hard", "likes": 332, "dislikes": 4, "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": 4008, "totalSubmissionRaw": 9049}, "2792": {"acRate": 59.43396226415094, "difficulty": "Hard", "likes": 14, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 441, "totalSubmissionRaw": 742}, "2793": {"acRate": 55.051813471502584, "difficulty": "Hard", "likes": 3, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 425, "totalSubmissionRaw": 772}, "2794": {"acRate": 65.14285714285715, "difficulty": "Easy", "likes": 6, "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": 456, "totalSubmissionRaw": 700}, "2795": {"acRate": 93.0327868852459, "difficulty": "Medium", "likes": 9, "dislikes": 4, "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": 227, "totalSubmissionRaw": 244}, "2796": {"acRate": 92.17935349322211, "difficulty": "Easy", "likes": 17, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 884, "totalSubmissionRaw": 959}, "2797": {"acRate": 92.44791666666666, "difficulty": "Easy", "likes": 8, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 355, "totalSubmissionRaw": 384}, "2798": {"acRate": 87.6327948467168, "difficulty": "Easy", "likes": 320, "dislikes": 37, "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"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77951, "totalSubmissionRaw": 88952}, "2799": {"acRate": 63.42244645885234, "difficulty": "Medium", "likes": 436, "dislikes": 9, "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": 30295, "totalSubmissionRaw": 47767}, "2800": {"acRate": 29.725052031985978, "difficulty": "Medium", "likes": 296, "dislikes": 237, "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": 13568, "totalSubmissionRaw": 45645}, "2801": {"acRate": 26.232708138844096, "difficulty": "Hard", "likes": 306, "dislikes": 8, "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": 6182, "totalSubmissionRaw": 23566}, "2802": {"acRate": 70.68527918781726, "difficulty": "Medium", "likes": 21, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 557, "totalSubmissionRaw": 788}, "2803": {"acRate": 84.04907975460122, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 489}, "2804": {"acRate": 91.74311926605505, "difficulty": "Easy", "likes": 7, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 400, "totalSubmissionRaw": 436}, "2805": {"acRate": 88.5, "difficulty": "Medium", "likes": 11, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177, "totalSubmissionRaw": 200}, "2806": {"acRate": 51.59962273754809, "difficulty": "Easy", "likes": 167, "dislikes": 37, "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": 34467, "totalSubmissionRaw": 66797}, "2807": {"acRate": 88.54834460349521, "difficulty": "Medium", "likes": 352, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40330, "totalSubmissionRaw": 45546}, "2808": {"acRate": 25.427378933124967, "difficulty": "Medium", "likes": 474, "dislikes": 24, "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"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13342, "totalSubmissionRaw": 52471}, "2809": {"acRate": 23.499098170574594, "difficulty": "Hard", "likes": 202, "dislikes": 10, "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": 2736, "totalSubmissionRaw": 11643}, "2810": {"acRate": 82.0916781018221, "difficulty": "Easy", "likes": 318, "dislikes": 4, "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": 47261, "totalSubmissionRaw": 57571}, "2811": {"acRate": 33.158423011930324, "difficulty": "Medium", "likes": 417, "dislikes": 83, "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": 26098, "totalSubmissionRaw": 78707}, "2812": {"acRate": 30.26402706327442, "difficulty": "Medium", "likes": 673, "dislikes": 67, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 15117, "totalSubmissionRaw": 49955}, "2813": {"acRate": 32.0631606420462, "difficulty": "Hard", "likes": 265, "dislikes": 3, "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": "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": 4914, "totalSubmissionRaw": 15326}, "2814": {"acRate": 67.1484888304862, "difficulty": "Hard", "likes": 16, "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": 511, "totalSubmissionRaw": 761}, "2815": {"acRate": 57.63258981890959, "difficulty": "Easy", "likes": 259, "dislikes": 84, "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": 35708, "totalSubmissionRaw": 61958}, "2816": {"acRate": 47.85258726318766, "difficulty": "Medium", "likes": 375, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 30462, "totalSubmissionRaw": 63658}, "2817": {"acRate": 31.877835385612443, "difficulty": "Medium", "likes": 596, "dislikes": 65, "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": 19675, "totalSubmissionRaw": 61720}, "2818": {"acRate": 32.25548902195609, "difficulty": "Hard", "likes": 291, "dislikes": 8, "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": 5656, "totalSubmissionRaw": 17535}, "2819": {"acRate": 56.074766355140184, "difficulty": "Hard", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 240, "totalSubmissionRaw": 428}, "2820": {"acRate": 68.46733668341709, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 545, "totalSubmissionRaw": 796}, "2821": {"acRate": 79.53795379537954, "difficulty": "Easy", "likes": 11, "dislikes": 4, "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": 241, "totalSubmissionRaw": 303}, "2822": {"acRate": 68.75, "difficulty": "Easy", "likes": 12, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 319, "totalSubmissionRaw": 464}, "2823": {"acRate": 55.42635658914728, "difficulty": "Medium", "likes": 8, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143, "totalSubmissionRaw": 258}, "2824": {"acRate": 86.91177319706681, "difficulty": "Easy", "likes": 289, "dislikes": 19, "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": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60207, "totalSubmissionRaw": 69274}, "2825": {"acRate": 46.6876755497705, "difficulty": "Medium", "likes": 262, "dislikes": 9, "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": 27260, "totalSubmissionRaw": 58388}, "2826": {"acRate": 40.97400311761452, "difficulty": "Medium", "likes": 331, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16297, "totalSubmissionRaw": 39774}, "2827": {"acRate": 16.747535229443038, "difficulty": "Hard", "likes": 295, "dislikes": 18, "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": 6489, "totalSubmissionRaw": 38746}, "2828": {"acRate": 82.99379982285208, "difficulty": "Easy", "likes": 231, "dislikes": 7, "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": 52472, "totalSubmissionRaw": 63224}, "2829": {"acRate": 60.74830735317273, "difficulty": "Medium", "likes": 300, "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": 30865, "totalSubmissionRaw": 50808}, "2830": {"acRate": 35.026722264638515, "difficulty": "Medium", "likes": 579, "dislikes": 19, "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": "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": 17892, "totalSubmissionRaw": 51081}, "2831": {"acRate": 34.17058307661173, "difficulty": "Medium", "likes": 554, "dislikes": 13, "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": 15196, "totalSubmissionRaw": 44471}, "2832": {"acRate": 74.08854166666666, "difficulty": "Medium", "likes": 20, "dislikes": 0, "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": 569, "totalSubmissionRaw": 768}, "2833": {"acRate": 63.06773376285633, "difficulty": "Easy", "likes": 192, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37589, "totalSubmissionRaw": 59601}, "2834": {"acRate": 41.78875115254584, "difficulty": "Medium", "likes": 270, "dislikes": 34, "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": 28553, "totalSubmissionRaw": 68327}, "2835": {"acRate": 30.660881786794587, "difficulty": "Hard", "likes": 496, "dislikes": 125, "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": 10035, "totalSubmissionRaw": 32729}, "2836": {"acRate": 29.16285643029346, "difficulty": "Hard", "likes": 198, "dislikes": 85, "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": 3508, "totalSubmissionRaw": 12029}, "2837": {"acRate": 71.9298245614035, "difficulty": "Easy", "likes": 11, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 656, "totalSubmissionRaw": 912}, "2838": {"acRate": 74.77931904161412, "difficulty": "Medium", "likes": 19, "dislikes": 0, "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": 593, "totalSubmissionRaw": 793}, "2839": {"acRate": 46.23368570247446, "difficulty": "Easy", "likes": 152, "dislikes": 19, "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": 31315, "totalSubmissionRaw": 67732}, "2840": {"acRate": 54.5162888348942, "difficulty": "Medium", "likes": 223, "dislikes": 2, "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": 23110, "totalSubmissionRaw": 42391}, "2841": {"acRate": 36.960657078348056, "difficulty": "Medium", "likes": 221, "dislikes": 131, "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": 20790, "totalSubmissionRaw": 56249}, "2842": {"acRate": 27.547504184306387, "difficulty": "Hard", "likes": 279, "dislikes": 16, "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": 8394, "totalSubmissionRaw": 30471}, "2843": {"acRate": 74.31770005299417, "difficulty": "Easy", "likes": 189, "dislikes": 7, "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": 33657, "totalSubmissionRaw": 45288}, "2844": {"acRate": 37.268164239282484, "difficulty": "Medium", "likes": 303, "dislikes": 47, "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": 22646, "totalSubmissionRaw": 60765}, "2845": {"acRate": 33.84438142502659, "difficulty": "Medium", "likes": 434, "dislikes": 57, "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": 11457, "totalSubmissionRaw": 33852}, "2846": {"acRate": 43.65169116891128, "difficulty": "Hard", "likes": 246, "dislikes": 3, "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": 4246, "totalSubmissionRaw": 9727}, "2847": {"acRate": 50.33557046979866, "difficulty": "Medium", "likes": 16, "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": 525, "totalSubmissionRaw": 1043}, "2848": {"acRate": 74.52768582944898, "difficulty": "Easy", "likes": 190, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33096, "totalSubmissionRaw": 44407}, "2849": {"acRate": 23.20167773505767, "difficulty": "Medium", "likes": 167, "dislikes": 194, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 23233, "totalSubmissionRaw": 100129}, "2850": {"acRate": 38.83380779424757, "difficulty": "Medium", "likes": 388, "dislikes": 37, "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": 11868, "totalSubmissionRaw": 30561}, "2851": {"acRate": 27.009318578916712, "difficulty": "Hard", "likes": 132, "dislikes": 16, "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": 1855, "totalSubmissionRaw": 6868}, "2852": {"acRate": 69.17510853835022, "difficulty": "Medium", "likes": 16, "dislikes": 0, "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": "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": 478, "totalSubmissionRaw": 691}, "2853": {"acRate": 76.37681159420289, "difficulty": "Easy", "likes": 7, "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": 527, "totalSubmissionRaw": 690}, "2854": {"acRate": 69.25996204933587, "difficulty": "Medium", "likes": 6, "dislikes": 1, "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": 365, "totalSubmissionRaw": 527}, "2855": {"acRate": 57.15533773705519, "difficulty": "Easy", "likes": 154, "dislikes": 5, "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": 26823, "totalSubmissionRaw": 46930}, "2856": {"acRate": 20.087896893980545, "difficulty": "Medium", "likes": 239, "dislikes": 83, "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": 16272, "totalSubmissionRaw": 81004}, "2857": {"acRate": 31.56068937520759, "difficulty": "Medium", "likes": 223, "dislikes": 33, "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": 8552, "totalSubmissionRaw": 27097}, "2858": {"acRate": 59.10755148741419, "difficulty": "Hard", "likes": 198, "dislikes": 2, "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": 5166, "totalSubmissionRaw": 8740}, "2859": {"acRate": 86.43034825870647, "difficulty": "Easy", "likes": 110, "dislikes": 8, "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": 34742, "totalSubmissionRaw": 40196}, "2860": {"acRate": 50.00285730613177, "difficulty": "Medium", "likes": 136, "dislikes": 260, "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": 17500, "totalSubmissionRaw": 34998}, "2861": {"acRate": 36.754502888000275, "difficulty": "Medium", "likes": 215, "dislikes": 35, "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": 10754, "totalSubmissionRaw": 29259}, "2862": {"acRate": 42.86950876433672, "difficulty": "Hard", "likes": 146, "dislikes": 25, "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": 5943, "totalSubmissionRaw": 13863}, "2863": {"acRate": 71.60194174757282, "difficulty": "Medium", "likes": 15, "dislikes": 2, "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": 590, "totalSubmissionRaw": 824}, "2864": {"acRate": 71.93743717977004, "difficulty": "Easy", "likes": 119, "dislikes": 1, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 29344, "totalSubmissionRaw": 40791}, "2865": {"acRate": 42.590711011763645, "difficulty": "Medium", "likes": 145, "dislikes": 25, "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": 18862, "totalSubmissionRaw": 44288}, "2866": {"acRate": 33.07609716816535, "difficulty": "Medium", "likes": 319, "dislikes": 19, "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": 9858, "totalSubmissionRaw": 29804}, "2867": {"acRate": 33.48113738738739, "difficulty": "Hard", "likes": 194, "dislikes": 5, "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": 4757, "totalSubmissionRaw": 14207}, "2868": {"acRate": 65.92039800995025, "difficulty": "Hard", "likes": 6, "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": 265, "totalSubmissionRaw": 402}, "2869": {"acRate": 57.84471612947127, "difficulty": "Easy", "likes": 87, "dislikes": 7, "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"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25502, "totalSubmissionRaw": 44087}, "2870": {"acRate": 48.05705539730454, "difficulty": "Medium", "likes": 135, "dislikes": 5, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 22607, "totalSubmissionRaw": 47042}, "2871": {"acRate": 42.940757987323764, "difficulty": "Medium", "likes": 176, "dislikes": 24, "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": 13279, "totalSubmissionRaw": 30924}, "2872": {"acRate": 60.84602613152386, "difficulty": "Hard", "likes": 150, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "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": 8429, "totalSubmissionRaw": 13853}, "2873": {"acRate": 43.91300994833038, "difficulty": "Easy", "likes": 104, "dislikes": 9, "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": 28471, "totalSubmissionRaw": 64835}, "2874": {"acRate": 40.671008486283796, "difficulty": "Medium", "likes": 219, "dislikes": 5, "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": 20608, "totalSubmissionRaw": 50670}, "2875": {"acRate": 30.050141794418643, "difficulty": "Medium", "likes": 282, "dislikes": 19, "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": 14623, "totalSubmissionRaw": 48662}, "2876": {"acRate": 31.284628269552893, "difficulty": "Hard", "likes": 246, "dislikes": 4, "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": 7284, "totalSubmissionRaw": 23283}, "2877": {"acRate": 81.3995411340544, "difficulty": "Easy", "likes": 34, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4967, "totalSubmissionRaw": 6102}, "2878": {"acRate": 84.97340425531915, "difficulty": "Easy", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3834, "totalSubmissionRaw": 4512}, "2879": {"acRate": 92.46414044101905, "difficulty": "Easy", "likes": 21, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4317, "totalSubmissionRaw": 4669}, "2880": {"acRate": 79.28746928746929, "difficulty": "Easy", "likes": 19, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3228, "totalSubmissionRaw": 4071}, "2881": {"acRate": 90.45587843241802, "difficulty": "Easy", "likes": 18, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3393, "totalSubmissionRaw": 3751}, "2882": {"acRate": 82.5910931174089, "difficulty": "Easy", "likes": 24, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2651, "totalSubmissionRaw": 3210}, "2883": {"acRate": 83.53884093711468, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2710, "totalSubmissionRaw": 3244}, "2884": {"acRate": 90.66955982641042, "difficulty": "Easy", "likes": 17, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2925, "totalSubmissionRaw": 3226}, "2885": {"acRate": 85.46451834076106, "difficulty": "Easy", "likes": 14, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2493, "totalSubmissionRaw": 2917}, "2886": {"acRate": 84.81059212945937, "difficulty": "Easy", "likes": 15, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2304, "totalSubmissionRaw": 2717}, "2887": {"acRate": 86.06948228882834, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2523, "totalSubmissionRaw": 2923}, "2888": {"acRate": 87.42813338443848, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2278, "totalSubmissionRaw": 2601}, "2889": {"acRate": 80.76241134751773, "difficulty": "Easy", "likes": 21, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1817, "totalSubmissionRaw": 2241}, "2890": {"acRate": 83.89513108614233, "difficulty": "Easy", "likes": 22, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1790, "totalSubmissionRaw": 2130}, "2891": {"acRate": 74.07006139400507, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2048, "totalSubmissionRaw": 2764}, "2892": {"acRate": 43.42928660826033, "difficulty": "Medium", "likes": 13, "dislikes": 0, "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": 347, "totalSubmissionRaw": 799}, "2893": {"acRate": 72.52747252747253, "difficulty": "Medium", "likes": 7, "dislikes": 1, "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": 198, "totalSubmissionRaw": 273}, "2894": {"acRate": 87.29339117936706, "difficulty": "Easy", "likes": 70, "dislikes": 5, "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": 32797, "totalSubmissionRaw": 37571}, "2895": {"acRate": 67.29021913415286, "difficulty": "Medium", "likes": 98, "dislikes": 17, "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": 23921, "totalSubmissionRaw": 35549}, "2896": {"acRate": 24.138762389499064, "difficulty": "Medium", "likes": 254, "dislikes": 60, "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": 9011, "totalSubmissionRaw": 37328}, "2897": {"acRate": 46.282742681047765, "difficulty": "Hard", "likes": 137, "dislikes": 2, "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": 4806, "totalSubmissionRaw": 10384}, "2898": {"acRate": 73.26388888888889, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 208, "totalSubmissionRaw": 284}, "2899": {"acRate": 62.76000463088025, "difficulty": "Easy", "likes": 41, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16262, "totalSubmissionRaw": 25912}, "2900": {"acRate": 62.934397560647504, "difficulty": "Medium", "likes": 53, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14032, "totalSubmissionRaw": 22295}, "2901": {"acRate": 22.625485428084055, "difficulty": "Medium", "likes": 102, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6234, "totalSubmissionRaw": 27553}, "2902": {"acRate": 12.535272411547647, "difficulty": "Hard", "likes": 59, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1155, "totalSubmissionRaw": 9211}, "2903": {"acRate": 62.921620231720965, "difficulty": "Easy", "likes": 51, "dislikes": 2, "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": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20781, "totalSubmissionRaw": 33034}, "2904": {"acRate": 34.87968730914865, "difficulty": "Medium", "likes": 84, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2904", "paidOnly": false, "title": "Shortest and Lexicographically Smallest Beautiful String", "titleSlug": "shortest-and-lexicographically-smallest-beautiful-string", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14266, "totalSubmissionRaw": 40903}, "2905": {"acRate": 28.015105027141846, "difficulty": "Medium", "likes": 124, "dislikes": 2, "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": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9472, "totalSubmissionRaw": 33842}, "2906": {"acRate": 26.253129871970522, "difficulty": "Medium", "likes": 97, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5538, "totalSubmissionRaw": 21126}} \ No newline at end of file