From b4fcbfba12739f636c5ad9fe146c6766ee0e7613 Mon Sep 17 00:00:00 2001
From: bunnyxt-ci <bunnyxt-ci@users.noreply.github.com>
Date: Thu, 6 Jun 2024 00:09:05 +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 2f7c143..85f9f8a 100644
--- a/problems_all.json
+++ b/problems_all.json
@@ -1 +1 @@
-{"1": {"acRate": 52.749743534238426, "difficulty": "Easy", "likes": 56472, "dislikes": 1962, "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": 13353686, "totalSubmissionRaw": 25315187}, "2": {"acRate": 43.05334222995402, "difficulty": "Medium", "likes": 30779, "dislikes": 6115, "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": 4616013, "totalSubmissionRaw": 10721627}, "3": {"acRate": 34.88229807608668, "difficulty": "Medium", "likes": 39378, "dislikes": 1865, "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": 5838712, "totalSubmissionRaw": 16738340}, "4": {"acRate": 40.26200253307411, "difficulty": "Hard", "likes": 28050, "dislikes": 3117, "categoryTitle": "Algorithms", "frontendQuestionId": "4", "paidOnly": false, "title": "Median of Two Sorted Arrays", "titleSlug": "median-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2614318, "totalSubmissionRaw": 6493267}, "5": {"acRate": 33.95039574866555, "difficulty": "Medium", "likes": 29054, "dislikes": 1763, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3088655, "totalSubmissionRaw": 9097555}, "6": {"acRate": 48.21128091731013, "difficulty": "Medium", "likes": 7545, "dislikes": 14519, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1351766, "totalSubmissionRaw": 2803828}, "7": {"acRate": 28.699889687417052, "difficulty": "Medium", "likes": 12867, "dislikes": 13479, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3247946, "totalSubmissionRaw": 11316921}, "8": {"acRate": 17.359902335465502, "difficulty": "Medium", "likes": 4421, "dislikes": 13540, "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": 1551538, "totalSubmissionRaw": 8937488}, "9": {"acRate": 56.57779700768024, "difficulty": "Easy", "likes": 12481, "dislikes": 2715, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4689144, "totalSubmissionRaw": 8287976}, "10": {"acRate": 28.19368590871656, "difficulty": "Hard", "likes": 12048, "dislikes": 2144, "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": 966066, "totalSubmissionRaw": 3426538}, "11": {"acRate": 55.414158545203875, "difficulty": "Medium", "likes": 28785, "dislikes": 1734, "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": 2996831, "totalSubmissionRaw": 5408070}, "12": {"acRate": 65.01337634959346, "difficulty": "Medium", "likes": 7020, "dislikes": 5531, "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": 1325163, "totalSubmissionRaw": 2038295}, "13": {"acRate": 61.46529597783419, "difficulty": "Easy", "likes": 13979, "dislikes": 911, "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": 3677621, "totalSubmissionRaw": 5983255}, "14": {"acRate": 42.95800172045751, "difficulty": "Easy", "likes": 17351, "dislikes": 4516, "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": 3370779, "totalSubmissionRaw": 7846701}, "15": {"acRate": 34.650326187228885, "difficulty": "Medium", "likes": 30541, "dislikes": 2838, "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": 3579932, "totalSubmissionRaw": 10331604}, "16": {"acRate": 45.84959519686224, "difficulty": "Medium", "likes": 10369, "dislikes": 562, "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": 1231630, "totalSubmissionRaw": 2686239}, "17": {"acRate": 60.66282989008877, "difficulty": "Medium", "likes": 18362, "dislikes": 986, "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": 2045814, "totalSubmissionRaw": 3372439}, "18": {"acRate": 36.327330772534374, "difficulty": "Medium", "likes": 11189, "dislikes": 1372, "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": 967669, "totalSubmissionRaw": 2663747}, "19": {"acRate": 45.56638799582649, "difficulty": "Medium", "likes": 18670, "dislikes": 789, "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": 2748272, "totalSubmissionRaw": 6031356}, "20": {"acRate": 40.630264653656255, "difficulty": "Easy", "likes": 23819, "dislikes": 1734, "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": 4652466, "totalSubmissionRaw": 11450745}, "21": {"acRate": 64.44797812211557, "difficulty": "Easy", "likes": 21578, "dislikes": 2101, "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": 4206100, "totalSubmissionRaw": 6526364}, "22": {"acRate": 74.72085204246598, "difficulty": "Medium", "likes": 20899, "dislikes": 922, "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": 1844140, "totalSubmissionRaw": 2468041}, "23": {"acRate": 53.04485691617538, "difficulty": "Hard", "likes": 19270, "dislikes": 704, "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": 2011111, "totalSubmissionRaw": 3791341}, "24": {"acRate": 64.53679532629074, "difficulty": "Medium", "likes": 11865, "dislikes": 441, "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": 1375542, "totalSubmissionRaw": 2131409}, "25": {"acRate": 58.992112160220245, "difficulty": "Hard", "likes": 13506, "dislikes": 689, "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": 936802, "totalSubmissionRaw": 1588013}, "26": {"acRate": 56.044864250701096, "difficulty": "Easy", "likes": 14339, "dislikes": 18498, "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": 4407788, "totalSubmissionRaw": 7864745}, "27": {"acRate": 57.05055555888464, "difficulty": "Easy", "likes": 2386, "dislikes": 3464, "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": 2951362, "totalSubmissionRaw": 5173239}, "28": {"acRate": 42.53426648526474, "difficulty": "Easy", "likes": 5701, "dislikes": 396, "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": 2490438, "totalSubmissionRaw": 5855136}, "29": {"acRate": 17.525429790063008, "difficulty": "Medium", "likes": 5068, "dislikes": 14776, "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": 750779, "totalSubmissionRaw": 4283941}, "30": {"acRate": 32.71512910299257, "difficulty": "Hard", "likes": 1793, "dislikes": 234, "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": 454878, "totalSubmissionRaw": 1390446}, "31": {"acRate": 40.12578160942885, "difficulty": "Medium", "likes": 18157, "dislikes": 4643, "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": 1363186, "totalSubmissionRaw": 3397299}, "32": {"acRate": 34.29215963574902, "difficulty": "Hard", "likes": 12247, "dislikes": 402, "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": 745623, "totalSubmissionRaw": 2174324}, "33": {"acRate": 40.87122703569611, "difficulty": "Medium", "likes": 25950, "dislikes": 1560, "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": 2766307, "totalSubmissionRaw": 6768354}, "34": {"acRate": 44.44451160815616, "difficulty": "Medium", "likes": 20306, "dislikes": 509, "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": 2058721, "totalSubmissionRaw": 4632108}, "35": {"acRate": 46.14784763208292, "difficulty": "Easy", "likes": 15956, "dislikes": 730, "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": 2910396, "totalSubmissionRaw": 6306680}, "36": {"acRate": 59.827848495768286, "difficulty": "Medium", "likes": 10560, "dislikes": 1118, "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": 1535735, "totalSubmissionRaw": 2566923}, "37": {"acRate": 61.44379800918141, "difficulty": "Hard", "likes": 9410, "dislikes": 258, "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": 594797, "totalSubmissionRaw": 968038}, "38": {"acRate": 55.32669356458195, "difficulty": "Medium", "likes": 3941, "dislikes": 8244, "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": 933974, "totalSubmissionRaw": 1688109}, "39": {"acRate": 71.68384209839756, "difficulty": "Medium", "likes": 18610, "dislikes": 409, "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": 1956307, "totalSubmissionRaw": 2729074}, "40": {"acRate": 54.65809933275357, "difficulty": "Medium", "likes": 10361, "dislikes": 292, "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": 984870, "totalSubmissionRaw": 1801874}, "41": {"acRate": 39.58937554649618, "difficulty": "Hard", "likes": 16694, "dislikes": 1841, "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": 1220196, "totalSubmissionRaw": 3082133}, "42": {"acRate": 62.16228036542808, "difficulty": "Hard", "likes": 31751, "dislikes": 506, "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": 2131999, "totalSubmissionRaw": 3429731}, "43": {"acRate": 40.53926144189872, "difficulty": "Medium", "likes": 7002, "dislikes": 3315, "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": 803467, "totalSubmissionRaw": 1981950}, "44": {"acRate": 28.085677485756726, "difficulty": "Hard", "likes": 8158, "dislikes": 345, "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": 576322, "totalSubmissionRaw": 2052017}, "45": {"acRate": 40.50275162792436, "difficulty": "Medium", "likes": 14375, "dislikes": 565, "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": 1257112, "totalSubmissionRaw": 3103775}, "46": {"acRate": 78.50888654597665, "difficulty": "Medium", "likes": 18882, "dislikes": 324, "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": 2090956, "totalSubmissionRaw": 2663339}, "47": {"acRate": 59.401829156317056, "difficulty": "Medium", "likes": 8464, "dislikes": 143, "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": 934824, "totalSubmissionRaw": 1573730}, "48": {"acRate": 74.61466391540252, "difficulty": "Medium", "likes": 17364, "dislikes": 799, "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": 1727371, "totalSubmissionRaw": 2315056}, "49": {"acRate": 68.70475125684062, "difficulty": "Medium", "likes": 19036, "dislikes": 614, "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": 2907852, "totalSubmissionRaw": 4232399}, "50": {"acRate": 34.93131385979881, "difficulty": "Medium", "likes": 9586, "dislikes": 9410, "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": 1674878, "totalSubmissionRaw": 4794768}, "51": {"acRate": 68.54194706987242, "difficulty": "Hard", "likes": 12219, "dislikes": 284, "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": 731278, "totalSubmissionRaw": 1066907}, "52": {"acRate": 74.15560865338884, "difficulty": "Hard", "likes": 3818, "dislikes": 261, "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": 391351, "totalSubmissionRaw": 527739}, "53": {"acRate": 50.84532881098479, "difficulty": "Medium", "likes": 33749, "dislikes": 1427, "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": 3923097, "totalSubmissionRaw": 7715745}, "54": {"acRate": 49.784286235452036, "difficulty": "Medium", "likes": 14589, "dislikes": 1284, "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": 1434235, "totalSubmissionRaw": 2880900}, "55": {"acRate": 38.53067180866137, "difficulty": "Medium", "likes": 19107, "dislikes": 1214, "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": 1922657, "totalSubmissionRaw": 4989958}, "56": {"acRate": 47.46315327329956, "difficulty": "Medium", "likes": 22001, "dislikes": 766, "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": 2414041, "totalSubmissionRaw": 5086137}, "57": {"acRate": 41.62379941724522, "difficulty": "Medium", "likes": 10252, "dislikes": 792, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1122382, "totalSubmissionRaw": 2696480}, "58": {"acRate": 52.0671047156592, "difficulty": "Easy", "likes": 5126, "dislikes": 279, "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": 2008340, "totalSubmissionRaw": 3857227}, "59": {"acRate": 71.26769043239236, "difficulty": "Medium", "likes": 6304, "dislikes": 259, "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": 577646, "totalSubmissionRaw": 810529}, "60": {"acRate": 47.213260045569854, "difficulty": "Hard", "likes": 6599, "dislikes": 478, "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": 398468, "totalSubmissionRaw": 843976}, "61": {"acRate": 37.91670871203499, "difficulty": "Medium", "likes": 9553, "dislikes": 1441, "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": 969440, "totalSubmissionRaw": 2556761}, "62": {"acRate": 64.38491779017875, "difficulty": "Medium", "likes": 16485, "dislikes": 439, "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": 1841164, "totalSubmissionRaw": 2859618}, "63": {"acRate": 41.68795163570127, "difficulty": "Medium", "likes": 8661, "dislikes": 508, "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": 939946, "totalSubmissionRaw": 2254718}, "64": {"acRate": 64.07013334724178, "difficulty": "Medium", "likes": 12341, "dislikes": 168, "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": 1179278, "totalSubmissionRaw": 1840605}, "65": {"acRate": 19.95629841382441, "difficulty": "Hard", "likes": 1244, "dislikes": 1983, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 367968, "totalSubmissionRaw": 1843867}, "66": {"acRate": 45.44252325194169, "difficulty": "Easy", "likes": 9221, "dislikes": 5370, "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": 2267929, "totalSubmissionRaw": 4990762}, "67": {"acRate": 53.706523131382525, "difficulty": "Easy", "likes": 9341, "dislikes": 964, "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": 1475906, "totalSubmissionRaw": 2748100}, "68": {"acRate": 43.75611675877377, "difficulty": "Hard", "likes": 3633, "dislikes": 4629, "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": 420264, "totalSubmissionRaw": 960471}, "69": {"acRate": 38.87914058671182, "difficulty": "Easy", "likes": 8066, "dislikes": 4488, "categoryTitle": "Algorithms", "frontendQuestionId": "69", "paidOnly": false, "title": "Sqrt(x)", "titleSlug": "sqrtx", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1979304, "totalSubmissionRaw": 5090914}, "70": {"acRate": 52.92587937654234, "difficulty": "Easy", "likes": 21747, "dislikes": 820, "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": 3285023, "totalSubmissionRaw": 6206839}, "71": {"acRate": 42.800445523398054, "difficulty": "Medium", "likes": 5506, "dislikes": 1271, "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": 768158, "totalSubmissionRaw": 1794741}, "72": {"acRate": 56.601635330542834, "difficulty": "Medium", "likes": 14656, "dislikes": 220, "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": 868547, "totalSubmissionRaw": 1534489}, "73": {"acRate": 55.97525614067011, "difficulty": "Medium", "likes": 14276, "dislikes": 719, "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": 1427350, "totalSubmissionRaw": 2549966}, "74": {"acRate": 50.26039510692142, "difficulty": "Medium", "likes": 15571, "dislikes": 412, "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": 1796974, "totalSubmissionRaw": 3575328}, "75": {"acRate": 62.580627036028204, "difficulty": "Medium", "likes": 17912, "dislikes": 629, "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": 1960226, "totalSubmissionRaw": 3132321}, "76": {"acRate": 43.126233095835374, "difficulty": "Hard", "likes": 17723, "dislikes": 727, "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": 1368790, "totalSubmissionRaw": 3173913}, "77": {"acRate": 70.56907703451697, "difficulty": "Medium", "likes": 8169, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 908952, "totalSubmissionRaw": 1288031}, "78": {"acRate": 78.39083729335385, "difficulty": "Medium", "likes": 17097, "dislikes": 277, "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": 1967677, "totalSubmissionRaw": 2510084}, "79": {"acRate": 42.93458625866364, "difficulty": "Medium", "likes": 15724, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1691077, "totalSubmissionRaw": 3938729}, "80": {"acRate": 58.64323769180295, "difficulty": "Medium", "likes": 6779, "dislikes": 1309, "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": 980413, "totalSubmissionRaw": 1671828}, "81": {"acRate": 37.766471178247926, "difficulty": "Medium", "likes": 8376, "dislikes": 1035, "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": 730839, "totalSubmissionRaw": 1935149}, "82": {"acRate": 47.626593962478836, "difficulty": "Medium", "likes": 8740, "dislikes": 237, "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": 741716, "totalSubmissionRaw": 1557359}, "83": {"acRate": 52.68039586708606, "difficulty": "Easy", "likes": 8607, "dislikes": 298, "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": 1533461, "totalSubmissionRaw": 2910876}, "84": {"acRate": 44.62404778976307, "difficulty": "Hard", "likes": 17021, "dislikes": 274, "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": 901186, "totalSubmissionRaw": 2019503}, "85": {"acRate": 50.62371558279541, "difficulty": "Hard", "likes": 10446, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "85", "paidOnly": false, "title": "Maximal Rectangle", "titleSlug": "maximal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 488977, "totalSubmissionRaw": 965905}, "86": {"acRate": 56.4424907528897, "difficulty": "Medium", "likes": 7288, "dislikes": 868, "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": 627622, "totalSubmissionRaw": 1111968}, "87": {"acRate": 40.239466080885386, "difficulty": "Hard", "likes": 3290, "dislikes": 1270, "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": 230078, "totalSubmissionRaw": 571772}, "88": {"acRate": 49.86954168280079, "difficulty": "Easy", "likes": 14613, "dislikes": 1882, "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": 3197825, "totalSubmissionRaw": 6412375}, "89": {"acRate": 59.39221873794379, "difficulty": "Medium", "likes": 2232, "dislikes": 2707, "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": 300195, "totalSubmissionRaw": 505445}, "90": {"acRate": 57.431130586273596, "difficulty": "Medium", "likes": 9638, "dislikes": 303, "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": 930293, "totalSubmissionRaw": 1619841}, "91": {"acRate": 34.99661821055424, "difficulty": "Medium", "likes": 11792, "dislikes": 4505, "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": 1259936, "totalSubmissionRaw": 3600166}, "92": {"acRate": 47.78424319097873, "difficulty": "Medium", "likes": 11483, "dislikes": 605, "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": 873254, "totalSubmissionRaw": 1827493}, "93": {"acRate": 50.16646347691351, "difficulty": "Medium", "likes": 5185, "dislikes": 789, "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": 461690, "totalSubmissionRaw": 920319}, "94": {"acRate": 76.28549685033168, "difficulty": "Easy", "likes": 13351, "dislikes": 776, "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": 2547100, "totalSubmissionRaw": 3338904}, "95": {"acRate": 57.92614953206584, "difficulty": "Medium", "likes": 7515, "dislikes": 517, "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": 453632, "totalSubmissionRaw": 783122}, "96": {"acRate": 61.120141020239394, "difficulty": "Medium", "likes": 10272, "dislikes": 399, "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": 662942, "totalSubmissionRaw": 1084656}, "97": {"acRate": 40.09085798640786, "difficulty": "Medium", "likes": 8142, "dislikes": 477, "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": 526319, "totalSubmissionRaw": 1312817}, "98": {"acRate": 33.01982627176472, "difficulty": "Medium", "likes": 16671, "dislikes": 1362, "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": 2356569, "totalSubmissionRaw": 7136851}, "99": {"acRate": 53.3124313972769, "difficulty": "Medium", "likes": 7830, "dislikes": 256, "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": 456557, "totalSubmissionRaw": 856380}, "100": {"acRate": 62.32861126960586, "difficulty": "Easy", "likes": 11428, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2180345, "totalSubmissionRaw": 3498159}, "101": {"acRate": 56.68521351476191, "difficulty": "Easy", "likes": 15166, "dislikes": 370, "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": 2006477, "totalSubmissionRaw": 3539681}, "102": {"acRate": 67.4454393966994, "difficulty": "Medium", "likes": 15164, "dislikes": 310, "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": 2254834, "totalSubmissionRaw": 3343194}, "103": {"acRate": 59.11313729411346, "difficulty": "Medium", "likes": 10703, "dislikes": 294, "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": 1179428, "totalSubmissionRaw": 1995207}, "104": {"acRate": 75.48774096564178, "difficulty": "Easy", "likes": 12703, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "104", "paidOnly": false, "title": "Maximum Depth of Binary Tree", "titleSlug": "maximum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3118404, "totalSubmissionRaw": 4131012}, "105": {"acRate": 64.1137390462478, "difficulty": "Medium", "likes": 14815, "dislikes": 498, "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": 1239690, "totalSubmissionRaw": 1933580}, "106": {"acRate": 63.101582308197955, "difficulty": "Medium", "likes": 7945, "dislikes": 130, "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": 645086, "totalSubmissionRaw": 1022300}, "107": {"acRate": 63.58236279550103, "difficulty": "Medium", "likes": 4831, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "107", "paidOnly": false, "title": "Binary Tree Level Order Traversal II", "titleSlug": "binary-tree-level-order-traversal-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 650157, "totalSubmissionRaw": 1022543}, "108": {"acRate": 71.84776086126377, "difficulty": "Easy", "likes": 10863, "dislikes": 554, "categoryTitle": "Algorithms", "frontendQuestionId": "108", "paidOnly": false, "title": "Convert Sorted Array to Binary Search Tree", "titleSlug": "convert-sorted-array-to-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1211676, "totalSubmissionRaw": 1686448}, "109": {"acRate": 62.0803468065716, "difficulty": "Medium", "likes": 7397, "dislikes": 160, "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": 529284, "totalSubmissionRaw": 852579}, "110": {"acRate": 52.29225405593198, "difficulty": "Easy", "likes": 10583, "dislikes": 678, "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": 1497653, "totalSubmissionRaw": 2864009}, "111": {"acRate": 48.2015159812547, "difficulty": "Easy", "likes": 7246, "dislikes": 1306, "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": 1209377, "totalSubmissionRaw": 2508998}, "112": {"acRate": 50.575629902889716, "difficulty": "Easy", "likes": 9615, "dislikes": 1097, "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": 1466531, "totalSubmissionRaw": 2899679}, "113": {"acRate": 58.60598889646281, "difficulty": "Medium", "likes": 7891, "dislikes": 154, "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": 862341, "totalSubmissionRaw": 1471422}, "114": {"acRate": 65.168318882125, "difficulty": "Medium", "likes": 12116, "dislikes": 560, "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": 956620, "totalSubmissionRaw": 1467924}, "115": {"acRate": 47.18400332266841, "difficulty": "Hard", "likes": 6562, "dislikes": 288, "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": 402159, "totalSubmissionRaw": 852321}, "116": {"acRate": 62.895064606886365, "difficulty": "Medium", "likes": 9624, "dislikes": 301, "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": 1049336, "totalSubmissionRaw": 1668393}, "117": {"acRate": 52.71808865793828, "difficulty": "Medium", "likes": 5806, "dislikes": 320, "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": 635589, "totalSubmissionRaw": 1205641}, "118": {"acRate": 74.4848623692631, "difficulty": "Easy", "likes": 12724, "dislikes": 438, "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": 1680918, "totalSubmissionRaw": 2256725}, "119": {"acRate": 64.13594804794045, "difficulty": "Easy", "likes": 4796, "dislikes": 338, "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": 889544, "totalSubmissionRaw": 1386968}, "120": {"acRate": 56.78514020360779, "difficulty": "Medium", "likes": 9436, "dislikes": 552, "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": 763056, "totalSubmissionRaw": 1343760}, "121": {"acRate": 53.73632400311801, "difficulty": "Easy", "likes": 30572, "dislikes": 1128, "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": 4702128, "totalSubmissionRaw": 8750369}, "122": {"acRate": 66.67981287483617, "difficulty": "Medium", "likes": 13404, "dislikes": 2687, "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": 1920654, "totalSubmissionRaw": 2880415}, "123": {"acRate": 48.164011929118075, "difficulty": "Hard", "likes": 9558, "dislikes": 186, "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": 609019, "totalSubmissionRaw": 1264469}, "124": {"acRate": 40.09715748703473, "difficulty": "Hard", "likes": 16468, "dislikes": 728, "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": 1239920, "totalSubmissionRaw": 3092287}, "125": {"acRate": 47.70706018987704, "difficulty": "Easy", "likes": 9211, "dislikes": 8330, "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": 3024502, "totalSubmissionRaw": 6339731}, "126": {"acRate": 27.262162390664933, "difficulty": "Hard", "likes": 5953, "dislikes": 743, "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": 367596, "totalSubmissionRaw": 1348377}, "127": {"acRate": 39.40780279361084, "difficulty": "Hard", "likes": 11934, "dislikes": 1873, "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": 1077157, "totalSubmissionRaw": 2733371}, "128": {"acRate": 47.278233901815334, "difficulty": "Medium", "likes": 19711, "dislikes": 991, "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": 1789712, "totalSubmissionRaw": 3785496}, "129": {"acRate": 66.01308743203903, "difficulty": "Medium", "likes": 7983, "dislikes": 140, "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": 888649, "totalSubmissionRaw": 1346171}, "130": {"acRate": 39.68254852552921, "difficulty": "Medium", "likes": 8529, "dislikes": 1807, "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": 712295, "totalSubmissionRaw": 1794983}, "131": {"acRate": 69.35542325420033, "difficulty": "Medium", "likes": 12754, "dislikes": 487, "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": 895604, "totalSubmissionRaw": 1291326}, "132": {"acRate": 34.0343771597292, "difficulty": "Hard", "likes": 5402, "dislikes": 139, "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": 282177, "totalSubmissionRaw": 829095}, "133": {"acRate": 57.682362415810196, "difficulty": "Medium", "likes": 9397, "dislikes": 3781, "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": 1250562, "totalSubmissionRaw": 2168016}, "134": {"acRate": 45.508991734004844, "difficulty": "Medium", "likes": 11812, "dislikes": 1122, "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": 814878, "totalSubmissionRaw": 1790586}, "135": {"acRate": 43.36115606746465, "difficulty": "Hard", "likes": 7706, "dislikes": 651, "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": 527786, "totalSubmissionRaw": 1217191}, "136": {"acRate": 73.1431909822144, "difficulty": "Easy", "likes": 16340, "dislikes": 710, "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": 2818199, "totalSubmissionRaw": 3852994}, "137": {"acRate": 62.940318724509815, "difficulty": "Medium", "likes": 7849, "dislikes": 687, "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": 595230, "totalSubmissionRaw": 945706}, "138": {"acRate": 56.425597323183794, "difficulty": "Medium", "likes": 13710, "dislikes": 1457, "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": 1262064, "totalSubmissionRaw": 2236687}, "139": {"acRate": 46.8691006248095, "difficulty": "Medium", "likes": 17036, "dislikes": 776, "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": 1692973, "totalSubmissionRaw": 3612135}, "140": {"acRate": 50.930424179522404, "difficulty": "Hard", "likes": 7161, "dislikes": 537, "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": 659515, "totalSubmissionRaw": 1294940}, "141": {"acRate": 50.53660386563976, "difficulty": "Easy", "likes": 15348, "dislikes": 1346, "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": 2995566, "totalSubmissionRaw": 5927529}, "142": {"acRate": 51.52384944187205, "difficulty": "Medium", "likes": 13461, "dislikes": 944, "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": 1303030, "totalSubmissionRaw": 2528984}, "143": {"acRate": 58.969083024423966, "difficulty": "Medium", "likes": 10992, "dislikes": 397, "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": 996466, "totalSubmissionRaw": 1689813}, "144": {"acRate": 69.7420040898393, "difficulty": "Easy", "likes": 7914, "dislikes": 210, "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": 1627150, "totalSubmissionRaw": 2333099}, "145": {"acRate": 71.20264357305845, "difficulty": "Easy", "likes": 6836, "dislikes": 189, "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": 1203853, "totalSubmissionRaw": 1690742}, "146": {"acRate": 42.61024621967769, "difficulty": "Medium", "likes": 20505, "dislikes": 1006, "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": 1650004, "totalSubmissionRaw": 3872334}, "147": {"acRate": 53.79814434980894, "difficulty": "Medium", "likes": 3081, "dislikes": 864, "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": 373237, "totalSubmissionRaw": 693773}, "148": {"acRate": 58.1967458243282, "difficulty": "Medium", "likes": 11451, "dislikes": 344, "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": 797861, "totalSubmissionRaw": 1370974}, "149": {"acRate": 26.89239497751441, "difficulty": "Hard", "likes": 4138, "dislikes": 486, "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": 394553, "totalSubmissionRaw": 1467158}, "150": {"acRate": 51.67908616217319, "difficulty": "Medium", "likes": 7572, "dislikes": 1070, "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": 1058095, "totalSubmissionRaw": 2047435}, "151": {"acRate": 43.09292664191346, "difficulty": "Medium", "likes": 8275, "dislikes": 5130, "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": 1544409, "totalSubmissionRaw": 3583909}, "152": {"acRate": 35.06834662041082, "difficulty": "Medium", "likes": 18319, "dislikes": 616, "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": 1283174, "totalSubmissionRaw": 3659068}, "153": {"acRate": 50.53046561485838, "difficulty": "Medium", "likes": 13040, "dislikes": 577, "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": 1816728, "totalSubmissionRaw": 3595307}, "154": {"acRate": 43.67982716569927, "difficulty": "Hard", "likes": 4638, "dislikes": 488, "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": 451673, "totalSubmissionRaw": 1034054}, "155": {"acRate": 54.33719442007229, "difficulty": "Medium", "likes": 13944, "dislikes": 868, "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": 1687582, "totalSubmissionRaw": 3105765}, "156": {"acRate": 62.86107967127602, "difficulty": "Medium", "likes": 260, "dislikes": 348, "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": 102192, "totalSubmissionRaw": 162568}, "157": {"acRate": 41.573504629870925, "difficulty": "Easy", "likes": 571, "dislikes": 3488, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191441, "totalSubmissionRaw": 460488}, "158": {"acRate": 42.32738985390544, "difficulty": "Hard", "likes": 866, "dislikes": 1800, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 183976, "totalSubmissionRaw": 434650}, "159": {"acRate": 55.45744080271834, "difficulty": "Medium", "likes": 2207, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 260320, "totalSubmissionRaw": 469405}, "160": {"acRate": 57.72208693203805, "difficulty": "Easy", "likes": 14830, "dislikes": 1341, "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": 1582646, "totalSubmissionRaw": 2741838}, "161": {"acRate": 34.30241723376328, "difficulty": "Medium", "likes": 1390, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206717, "totalSubmissionRaw": 602631}, "162": {"acRate": 45.997975672273675, "difficulty": "Medium", "likes": 11782, "dislikes": 4652, "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": 1387886, "totalSubmissionRaw": 3017280}, "163": {"acRate": 33.84390134024102, "difficulty": "Easy", "likes": 1090, "dislikes": 2977, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243403, "totalSubmissionRaw": 719191}, "164": {"acRate": 46.19240254402284, "difficulty": "Medium", "likes": 3243, "dislikes": 396, "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": 213529, "totalSubmissionRaw": 462260}, "165": {"acRate": 40.78536578102277, "difficulty": "Medium", "likes": 2606, "dislikes": 2719, "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": 493029, "totalSubmissionRaw": 1208838}, "166": {"acRate": 25.10949579166777, "difficulty": "Medium", "likes": 2065, "dislikes": 3666, "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": 228400, "totalSubmissionRaw": 909616}, "167": {"acRate": 61.44690240666455, "difficulty": "Medium", "likes": 11608, "dislikes": 1406, "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": 2048437, "totalSubmissionRaw": 3333676}, "168": {"acRate": 40.80508291454184, "difficulty": "Easy", "likes": 5524, "dislikes": 806, "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": 528749, "totalSubmissionRaw": 1295792}, "169": {"acRate": 64.89446420580806, "difficulty": "Easy", "likes": 18935, "dislikes": 612, "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": 2909134, "totalSubmissionRaw": 4482867}, "170": {"acRate": 38.08403699729666, "difficulty": "Easy", "likes": 667, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155105, "totalSubmissionRaw": 407272}, "171": {"acRate": 63.893099535995944, "difficulty": "Easy", "likes": 4734, "dislikes": 365, "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": 690425, "totalSubmissionRaw": 1080593}, "172": {"acRate": 43.42655402367034, "difficulty": "Medium", "likes": 3157, "dislikes": 1950, "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": 453890, "totalSubmissionRaw": 1045190}, "173": {"acRate": 72.22164972427385, "difficulty": "Medium", "likes": 8468, "dislikes": 498, "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": 791952, "totalSubmissionRaw": 1096558}, "174": {"acRate": 38.18799072859533, "difficulty": "Hard", "likes": 5763, "dislikes": 106, "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": 226210, "totalSubmissionRaw": 592359}, "175": {"acRate": 76.10760963854347, "difficulty": "Easy", "likes": 3478, "dislikes": 226, "categoryTitle": "Database", "frontendQuestionId": "175", "paidOnly": false, "title": "Combine Two Tables", "titleSlug": "combine-two-tables", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1023878, "totalSubmissionRaw": 1345304}, "176": {"acRate": 40.6071206182072, "difficulty": "Medium", "likes": 3537, "dislikes": 954, "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": 873190, "totalSubmissionRaw": 2150342}, "177": {"acRate": 37.943153186417526, "difficulty": "Medium", "likes": 1950, "dislikes": 1022, "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": 396660, "totalSubmissionRaw": 1045405}, "178": {"acRate": 62.52778705337977, "difficulty": "Medium", "likes": 2141, "dislikes": 273, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393230, "totalSubmissionRaw": 628889}, "179": {"acRate": 36.318965929073684, "difficulty": "Medium", "likes": 7980, "dislikes": 661, "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": 478951, "totalSubmissionRaw": 1318739}, "180": {"acRate": 45.865443966515606, "difficulty": "Medium", "likes": 2063, "dislikes": 289, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 378215, "totalSubmissionRaw": 824611}, "181": {"acRate": 69.64551256443194, "difficulty": "Easy", "likes": 2569, "dislikes": 252, "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": 646793, "totalSubmissionRaw": 928693}, "182": {"acRate": 71.15540425892934, "difficulty": "Easy", "likes": 2059, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 670966, "totalSubmissionRaw": 942959}, "183": {"acRate": 69.22729736906628, "difficulty": "Easy", "likes": 2612, "dislikes": 135, "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": 815987, "totalSubmissionRaw": 1178707}, "184": {"acRate": 51.89607622749711, "difficulty": "Medium", "likes": 2030, "dislikes": 185, "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": 388765, "totalSubmissionRaw": 749124}, "185": {"acRate": 53.59242023111348, "difficulty": "Hard", "likes": 2042, "dislikes": 239, "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": 330160, "totalSubmissionRaw": 616059}, "186": {"acRate": 54.70662826540041, "difficulty": "Medium", "likes": 1069, "dislikes": 143, "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": 162215, "totalSubmissionRaw": 296518}, "187": {"acRate": 49.049466387431316, "difficulty": "Medium", "likes": 3305, "dislikes": 531, "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": 380823, "totalSubmissionRaw": 776406}, "188": {"acRate": 43.04990203339302, "difficulty": "Hard", "likes": 7362, "dislikes": 209, "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": 459209, "totalSubmissionRaw": 1066690}, "189": {"acRate": 40.72679885398392, "difficulty": "Medium", "likes": 17704, "dislikes": 1947, "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": 2194224, "totalSubmissionRaw": 5387664}, "190": {"acRate": 58.884761797268595, "difficulty": "Easy", "likes": 5058, "dislikes": 1412, "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": 803438, "totalSubmissionRaw": 1364425}, "191": {"acRate": 71.29018824482117, "difficulty": "Easy", "likes": 6474, "dislikes": 1336, "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": 1482498, "totalSubmissionRaw": 2079526}, "192": {"acRate": 25.80126675741244, "difficulty": "Medium", "likes": 539, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51368, "totalSubmissionRaw": 199089}, "193": {"acRate": 26.075369845228742, "difficulty": "Easy", "likes": 415, "dislikes": 962, "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": 83952, "totalSubmissionRaw": 321959}, "194": {"acRate": 26.40463746854529, "difficulty": "Medium", "likes": 144, "dislikes": 286, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25918, "totalSubmissionRaw": 98157}, "195": {"acRate": 33.40774480389261, "difficulty": "Easy", "likes": 388, "dislikes": 466, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107451, "totalSubmissionRaw": 321635}, "196": {"acRate": 62.06095929233142, "difficulty": "Easy", "likes": 1575, "dislikes": 322, "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": 534325, "totalSubmissionRaw": 860964}, "197": {"acRate": 47.62510141584908, "difficulty": "Easy", "likes": 2839, "dislikes": 609, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 653334, "totalSubmissionRaw": 1371827}, "198": {"acRate": 51.0958803971637, "difficulty": "Medium", "likes": 20862, "dislikes": 414, "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": 2229732, "totalSubmissionRaw": 4363819}, "199": {"acRate": 63.223373259029024, "difficulty": "Medium", "likes": 11854, "dislikes": 936, "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": 1326661, "totalSubmissionRaw": 2098376}, "200": {"acRate": 59.641487228285825, "difficulty": "Medium", "likes": 22643, "dislikes": 511, "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": 2752757, "totalSubmissionRaw": 4615508}, "201": {"acRate": 46.96671584531196, "difficulty": "Medium", "likes": 3975, "dislikes": 300, "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": 395060, "totalSubmissionRaw": 841150}, "202": {"acRate": 56.22863439314622, "difficulty": "Easy", "likes": 10225, "dislikes": 1425, "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": 1474759, "totalSubmissionRaw": 2622789}, "203": {"acRate": 49.00419776019172, "difficulty": "Easy", "likes": 8241, "dislikes": 237, "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": 1140186, "totalSubmissionRaw": 2326714}, "204": {"acRate": 33.66582056513809, "difficulty": "Medium", "likes": 7862, "dislikes": 1435, "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": 870856, "totalSubmissionRaw": 2586766}, "205": {"acRate": 45.225218734980885, "difficulty": "Easy", "likes": 8901, "dislikes": 2068, "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": 1355970, "totalSubmissionRaw": 2998257}, "206": {"acRate": 76.74341290048996, "difficulty": "Easy", "likes": 21336, "dislikes": 431, "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": 4180501, "totalSubmissionRaw": 5447373}, "207": {"acRate": 46.85682810623827, "difficulty": "Medium", "likes": 16027, "dislikes": 698, "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": 1578868, "totalSubmissionRaw": 3369558}, "208": {"acRate": 65.35870615122977, "difficulty": "Medium", "likes": 11411, "dislikes": 141, "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": 1046100, "totalSubmissionRaw": 1600548}, "209": {"acRate": 47.22069997517184, "difficulty": "Medium", "likes": 12468, "dislikes": 422, "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": 1055552, "totalSubmissionRaw": 2235357}, "210": {"acRate": 50.629764377241095, "difficulty": "Medium", "likes": 10657, "dislikes": 344, "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": 1042872, "totalSubmissionRaw": 2059801}, "211": {"acRate": 45.37171078233675, "difficulty": "Medium", "likes": 7528, "dislikes": 448, "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": 641247, "totalSubmissionRaw": 1413324}, "212": {"acRate": 36.33969159437121, "difficulty": "Hard", "likes": 9339, "dislikes": 455, "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": 660866, "totalSubmissionRaw": 1818577}, "213": {"acRate": 42.06950822998972, "difficulty": "Medium", "likes": 9715, "dislikes": 146, "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": 762873, "totalSubmissionRaw": 1813363}, "214": {"acRate": 33.55416962594697, "difficulty": "Hard", "likes": 3573, "dislikes": 244, "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": 181418, "totalSubmissionRaw": 540672}, "215": {"acRate": 66.78526089963964, "difficulty": "Medium", "likes": 16888, "dislikes": 866, "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": 2321068, "totalSubmissionRaw": 3475425}, "216": {"acRate": 69.82606605763233, "difficulty": "Medium", "likes": 5908, "dislikes": 110, "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": 517143, "totalSubmissionRaw": 740619}, "217": {"acRate": 61.81243957994852, "difficulty": "Easy", "likes": 11890, "dislikes": 1291, "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": 4026279, "totalSubmissionRaw": 6513721}, "218": {"acRate": 42.75051747768907, "difficulty": "Hard", "likes": 5859, "dislikes": 263, "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": 289764, "totalSubmissionRaw": 677805}, "219": {"acRate": 45.38549406617997, "difficulty": "Easy", "likes": 6055, "dislikes": 3077, "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": 949992, "totalSubmissionRaw": 2093165}, "220": {"acRate": 22.798404887459345, "difficulty": "Hard", "likes": 967, "dislikes": 79, "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": 253609, "totalSubmissionRaw": 1112399}, "221": {"acRate": 46.69790900922977, "difficulty": "Medium", "likes": 10025, "dislikes": 222, "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": 686067, "totalSubmissionRaw": 1469160}, "222": {"acRate": 65.6055559696232, "difficulty": "Easy", "likes": 8548, "dislikes": 511, "categoryTitle": "Algorithms", "frontendQuestionId": "222", "paidOnly": false, "title": "Count Complete Tree Nodes", "titleSlug": "count-complete-tree-nodes", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 730592, "totalSubmissionRaw": 1113613}, "223": {"acRate": 46.28844366906936, "difficulty": "Medium", "likes": 1985, "dislikes": 1640, "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": 223669, "totalSubmissionRaw": 483207}, "224": {"acRate": 43.532258873023444, "difficulty": "Hard", "likes": 6240, "dislikes": 487, "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": 468946, "totalSubmissionRaw": 1077245}, "225": {"acRate": 63.93684466857892, "difficulty": "Easy", "likes": 5991, "dislikes": 1202, "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": 677401, "totalSubmissionRaw": 1059484}, "226": {"acRate": 77.13042837294289, "difficulty": "Easy", "likes": 13858, "dislikes": 221, "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": 2082302, "totalSubmissionRaw": 2699718}, "227": {"acRate": 43.75202106843955, "difficulty": "Medium", "likes": 6112, "dislikes": 831, "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": 638607, "totalSubmissionRaw": 1459611}, "228": {"acRate": 50.817200469504165, "difficulty": "Easy", "likes": 3899, "dislikes": 2133, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 567586, "totalSubmissionRaw": 1116920}, "229": {"acRate": 51.656489793965065, "difficulty": "Medium", "likes": 9546, "dislikes": 424, "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": 690825, "totalSubmissionRaw": 1337345}, "230": {"acRate": 72.73834199111718, "difficulty": "Medium", "likes": 11350, "dislikes": 225, "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": 1442673, "totalSubmissionRaw": 1983375}, "231": {"acRate": 47.77323174556455, "difficulty": "Easy", "likes": 6761, "dislikes": 428, "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": 1324453, "totalSubmissionRaw": 2772376}, "232": {"acRate": 66.34331475880087, "difficulty": "Easy", "likes": 7546, "dislikes": 424, "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": 938529, "totalSubmissionRaw": 1414655}, "233": {"acRate": 34.62643147736586, "difficulty": "Hard", "likes": 1537, "dislikes": 1462, "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": 93794, "totalSubmissionRaw": 270874}, "234": {"acRate": 53.33367929452473, "difficulty": "Easy", "likes": 16328, "dislikes": 876, "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": 1942427, "totalSubmissionRaw": 3642027}, "235": {"acRate": 64.99093471313503, "difficulty": "Medium", "likes": 10988, "dislikes": 311, "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": 1508749, "totalSubmissionRaw": 2321481}, "236": {"acRate": 62.520667770975436, "difficulty": "Medium", "likes": 16280, "dislikes": 406, "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": 1644472, "totalSubmissionRaw": 2630291}, "237": {"acRate": 79.88919900971331, "difficulty": "Medium", "likes": 4929, "dislikes": 1536, "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": 1403383, "totalSubmissionRaw": 1756662}, "238": {"acRate": 66.33974413242566, "difficulty": "Medium", "likes": 22320, "dislikes": 1383, "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": 2664261, "totalSubmissionRaw": 4016099}, "239": {"acRate": 46.59791783070026, "difficulty": "Hard", "likes": 18019, "dislikes": 668, "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": 1035809, "totalSubmissionRaw": 2222862}, "240": {"acRate": 52.79301956756085, "difficulty": "Medium", "likes": 11785, "dislikes": 198, "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": 935392, "totalSubmissionRaw": 1771810}, "241": {"acRate": 65.52712476053284, "difficulty": "Medium", "likes": 5323, "dislikes": 272, "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": 220620, "totalSubmissionRaw": 336685}, "242": {"acRate": 64.67060315838698, "difficulty": "Easy", "likes": 12011, "dislikes": 397, "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": 3549963, "totalSubmissionRaw": 5489304}, "243": {"acRate": 65.36310464073773, "difficulty": "Easy", "likes": 1263, "dislikes": 112, "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": 214340, "totalSubmissionRaw": 327922}, "244": {"acRate": 61.25928433461439, "difficulty": "Medium", "likes": 1048, "dislikes": 334, "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": 153819, "totalSubmissionRaw": 251095}, "245": {"acRate": 58.49670417092852, "difficulty": "Medium", "likes": 503, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82354, "totalSubmissionRaw": 140784}, "246": {"acRate": 47.69777680549099, "difficulty": "Easy", "likes": 593, "dislikes": 1012, "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": 174426, "totalSubmissionRaw": 365690}, "247": {"acRate": 52.40546955969376, "difficulty": "Medium", "likes": 920, "dislikes": 249, "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": 141073, "totalSubmissionRaw": 269197}, "248": {"acRate": 42.13938785634352, "difficulty": "Hard", "likes": 300, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36526, "totalSubmissionRaw": 86679}, "249": {"acRate": 65.73256918792664, "difficulty": "Medium", "likes": 1664, "dislikes": 381, "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": 240056, "totalSubmissionRaw": 365201}, "250": {"acRate": 56.47085726088127, "difficulty": "Medium", "likes": 1198, "dislikes": 424, "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": 153110, "totalSubmissionRaw": 271131}, "251": {"acRate": 49.53984024936684, "difficulty": "Medium", "likes": 712, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127144, "totalSubmissionRaw": 256650}, "252": {"acRate": 58.121940236049795, "difficulty": "Easy", "likes": 2024, "dislikes": 100, "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": 401401, "totalSubmissionRaw": 690618}, "253": {"acRate": 51.330660901763025, "difficulty": "Medium", "likes": 6920, "dislikes": 159, "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": 899420, "totalSubmissionRaw": 1752209}, "254": {"acRate": 49.55651775095032, "difficulty": "Medium", "likes": 1127, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127500, "totalSubmissionRaw": 257282}, "255": {"acRate": 49.955940078506764, "difficulty": "Medium", "likes": 1195, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81068, "totalSubmissionRaw": 162279}, "256": {"acRate": 62.57193089833366, "difficulty": "Medium", "likes": 2291, "dislikes": 129, "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": 208556, "totalSubmissionRaw": 333306}, "257": {"acRate": 63.858072597078966, "difficulty": "Easy", "likes": 6511, "dislikes": 290, "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": 731090, "totalSubmissionRaw": 1144867}, "258": {"acRate": 66.67487589495998, "difficulty": "Easy", "likes": 4789, "dislikes": 1932, "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": 793243, "totalSubmissionRaw": 1189718}, "259": {"acRate": 50.784603499815276, "difficulty": "Medium", "likes": 1546, "dislikes": 156, "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": 151199, "totalSubmissionRaw": 297728}, "260": {"acRate": 70.75202354672552, "difficulty": "Medium", "likes": 6301, "dislikes": 259, "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": 456721, "totalSubmissionRaw": 645524}, "261": {"acRate": 48.19845600719781, "difficulty": "Medium", "likes": 3253, "dislikes": 101, "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": 403383, "totalSubmissionRaw": 836921}, "262": {"acRate": 36.4027143953115, "difficulty": "Hard", "likes": 1228, "dislikes": 666, "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": 184105, "totalSubmissionRaw": 505745}, "263": {"acRate": 41.942491444105535, "difficulty": "Easy", "likes": 3310, "dislikes": 1698, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 518405, "totalSubmissionRaw": 1235990}, "264": {"acRate": 46.21036771329432, "difficulty": "Medium", "likes": 5929, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 343191, "totalSubmissionRaw": 742671}, "265": {"acRate": 54.76891642792102, "difficulty": "Hard", "likes": 1299, "dislikes": 36, "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": 123304, "totalSubmissionRaw": 225135}, "266": {"acRate": 67.3808635719968, "difficulty": "Easy", "likes": 1050, "dislikes": 70, "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": 204129, "totalSubmissionRaw": 302949}, "267": {"acRate": 41.57619744036313, "difficulty": "Medium", "likes": 878, "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": 68513, "totalSubmissionRaw": 164789}, "268": {"acRate": 67.05504259430015, "difficulty": "Easy", "likes": 11981, "dislikes": 3315, "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": 2241277, "totalSubmissionRaw": 3342448}, "269": {"acRate": 35.80216878495456, "difficulty": "Hard", "likes": 4402, "dislikes": 984, "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": 382619, "totalSubmissionRaw": 1068704}, "270": {"acRate": 51.52010070862959, "difficulty": "Easy", "likes": 1796, "dislikes": 137, "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": 345416, "totalSubmissionRaw": 670449}, "271": {"acRate": 46.785692763404924, "difficulty": "Medium", "likes": 1449, "dislikes": 404, "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": 201854, "totalSubmissionRaw": 431445}, "272": {"acRate": 59.18144787817825, "difficulty": "Hard", "likes": 1288, "dislikes": 44, "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": 118845, "totalSubmissionRaw": 200816}, "273": {"acRate": 30.656994027327023, "difficulty": "Hard", "likes": 3013, "dislikes": 6203, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 382193, "totalSubmissionRaw": 1246673}, "274": {"acRate": 39.02307701836169, "difficulty": "Medium", "likes": 1207, "dislikes": 536, "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": 472541, "totalSubmissionRaw": 1210936}, "275": {"acRate": 38.17258676009657, "difficulty": "Medium", "likes": 321, "dislikes": 84, "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": 205701, "totalSubmissionRaw": 538871}, "276": {"acRate": 46.69309770692867, "difficulty": "Medium", "likes": 1551, "dislikes": 387, "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": 113298, "totalSubmissionRaw": 242644}, "277": {"acRate": 47.29837317607603, "difficulty": "Medium", "likes": 2811, "dislikes": 277, "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": 268526, "totalSubmissionRaw": 567722}, "278": {"acRate": 44.4733976742338, "difficulty": "Easy", "likes": 8324, "dislikes": 3292, "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": 1690151, "totalSubmissionRaw": 3800372}, "279": {"acRate": 54.852867011181104, "difficulty": "Medium", "likes": 11132, "dislikes": 469, "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": 854891, "totalSubmissionRaw": 1558516}, "280": {"acRate": 67.70020670800827, "difficulty": "Medium", "likes": 1203, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "280", "paidOnly": true, "title": "Wiggle Sort", "titleSlug": "wiggle-sort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 142142, "totalSubmissionRaw": 209958}, "281": {"acRate": 63.953202977992305, "difficulty": "Medium", "likes": 675, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "281", "paidOnly": true, "title": "Zigzag Iterator", "titleSlug": "zigzag-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93802, "totalSubmissionRaw": 146673}, "282": {"acRate": 39.93425849264115, "difficulty": "Hard", "likes": 3335, "dislikes": 612, "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": 226212, "totalSubmissionRaw": 566461}, "283": {"acRate": 61.79897878604624, "difficulty": "Easy", "likes": 16511, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "283", "paidOnly": false, "title": "Move Zeroes", "titleSlug": "move-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3007475, "totalSubmissionRaw": 4866546}, "284": {"acRate": 59.567384993903026, "difficulty": "Medium", "likes": 1847, "dislikes": 1033, "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": 220801, "totalSubmissionRaw": 370675}, "285": {"acRate": 49.83667118315485, "difficulty": "Medium", "likes": 2565, "dislikes": 93, "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": 332135, "totalSubmissionRaw": 666447}, "286": {"acRate": 61.48459952185753, "difficulty": "Medium", "likes": 3107, "dislikes": 63, "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": 318129, "totalSubmissionRaw": 517415}, "287": {"acRate": 60.926614354848994, "difficulty": "Medium", "likes": 23102, "dislikes": 4487, "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": 1747562, "totalSubmissionRaw": 2868306}, "288": {"acRate": 26.306793750895803, "difficulty": "Medium", "likes": 201, "dislikes": 1819, "categoryTitle": "Algorithms", "frontendQuestionId": "288", "paidOnly": true, "title": "Unique Word Abbreviation", "titleSlug": "unique-word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73417, "totalSubmissionRaw": 279080}, "289": {"acRate": 69.28125655125703, "difficulty": "Medium", "likes": 6293, "dislikes": 562, "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": 472582, "totalSubmissionRaw": 682121}, "290": {"acRate": 42.09756444934234, "difficulty": "Easy", "likes": 7200, "dislikes": 994, "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": 721216, "totalSubmissionRaw": 1713200}, "291": {"acRate": 48.196384578064254, "difficulty": "Medium", "likes": 911, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76492, "totalSubmissionRaw": 158709}, "292": {"acRate": 56.92536444548472, "difficulty": "Easy", "likes": 1699, "dislikes": 2686, "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": 379403, "totalSubmissionRaw": 666492}, "293": {"acRate": 64.58227225627425, "difficulty": "Easy", "likes": 224, "dislikes": 465, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73544, "totalSubmissionRaw": 113877}, "294": {"acRate": 52.102450411827746, "difficulty": "Medium", "likes": 618, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70975, "totalSubmissionRaw": 136222}, "295": {"acRate": 51.97971870508701, "difficulty": "Hard", "likes": 11760, "dislikes": 237, "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": 791327, "totalSubmissionRaw": 1522379}, "296": {"acRate": 60.95761472406852, "difficulty": "Hard", "likes": 1175, "dislikes": 103, "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": 84191, "totalSubmissionRaw": 138114}, "297": {"acRate": 56.91115911589336, "difficulty": "Hard", "likes": 10055, "dislikes": 388, "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": 874394, "totalSubmissionRaw": 1536420}, "298": {"acRate": 53.55461019544398, "difficulty": "Medium", "likes": 1135, "dislikes": 236, "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": 148297, "totalSubmissionRaw": 276908}, "299": {"acRate": 50.33073324606768, "difficulty": "Medium", "likes": 2415, "dislikes": 1776, "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": 375274, "totalSubmissionRaw": 745616}, "300": {"acRate": 55.50066560528132, "difficulty": "Medium", "likes": 20678, "dislikes": 433, "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": 1693522, "totalSubmissionRaw": 3051352}, "301": {"acRate": 48.29503335804299, "difficulty": "Hard", "likes": 5830, "dislikes": 284, "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": 432596, "totalSubmissionRaw": 895735}, "302": {"acRate": 58.95998020805108, "difficulty": "Hard", "likes": 525, "dislikes": 100, "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": 50047, "totalSubmissionRaw": 84883}, "303": {"acRate": 63.66453376023037, "difficulty": "Easy", "likes": 3191, "dislikes": 1897, "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": 537675, "totalSubmissionRaw": 844544}, "304": {"acRate": 54.72337278326202, "difficulty": "Medium", "likes": 4927, "dislikes": 341, "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": 368476, "totalSubmissionRaw": 673343}, "305": {"acRate": 39.87811573514879, "difficulty": "Hard", "likes": 1855, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145268, "totalSubmissionRaw": 364280}, "306": {"acRate": 31.630636690283932, "difficulty": "Medium", "likes": 1156, "dislikes": 797, "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": 90760, "totalSubmissionRaw": 286937}, "307": {"acRate": 41.01266358900513, "difficulty": "Medium", "likes": 4705, "dislikes": 251, "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": 271138, "totalSubmissionRaw": 661108}, "308": {"acRate": 44.117496458379556, "difficulty": "Hard", "likes": 800, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77544, "totalSubmissionRaw": 175767}, "309": {"acRate": 58.27981160351102, "difficulty": "Medium", "likes": 9316, "dislikes": 313, "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": 511781, "totalSubmissionRaw": 878146}, "310": {"acRate": 41.75874233884146, "difficulty": "Medium", "likes": 8172, "dislikes": 377, "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": 373097, "totalSubmissionRaw": 893460}, "311": {"acRate": 68.10879519187633, "difficulty": "Medium", "likes": 1056, "dislikes": 359, "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": 191288, "totalSubmissionRaw": 280855}, "312": {"acRate": 58.94643999577632, "difficulty": "Hard", "likes": 8884, "dislikes": 246, "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": 284706, "totalSubmissionRaw": 482989}, "313": {"acRate": 45.25974756135271, "difficulty": "Medium", "likes": 2139, "dislikes": 382, "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": 128802, "totalSubmissionRaw": 284584}, "314": {"acRate": 54.55530068840451, "difficulty": "Medium", "likes": 3232, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 414549, "totalSubmissionRaw": 759870}, "315": {"acRate": 42.44849654880596, "difficulty": "Hard", "likes": 8775, "dislikes": 239, "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": 321021, "totalSubmissionRaw": 756260}, "316": {"acRate": 49.72834210600682, "difficulty": "Medium", "likes": 8596, "dislikes": 624, "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": 334350, "totalSubmissionRaw": 672353}, "317": {"acRate": 43.260506996512746, "difficulty": "Hard", "likes": 1865, "dislikes": 296, "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": 176900, "totalSubmissionRaw": 408918}, "318": {"acRate": 60.03239147888898, "difficulty": "Medium", "likes": 3493, "dislikes": 139, "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": 217582, "totalSubmissionRaw": 362441}, "319": {"acRate": 52.801967676631676, "difficulty": "Medium", "likes": 2612, "dislikes": 3102, "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": 219615, "totalSubmissionRaw": 415922}, "320": {"acRate": 58.45849531605898, "difficulty": "Medium", "likes": 682, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68269, "totalSubmissionRaw": 116782}, "321": {"acRate": 30.271866206951216, "difficulty": "Hard", "likes": 1907, "dislikes": 351, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61108, "totalSubmissionRaw": 201864}, "322": {"acRate": 44.087155703032984, "difficulty": "Medium", "likes": 18738, "dislikes": 443, "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": 1802676, "totalSubmissionRaw": 4088894}, "323": {"acRate": 62.887604912535835, "difficulty": "Medium", "likes": 2658, "dislikes": 100, "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": 403041, "totalSubmissionRaw": 640891}, "324": {"acRate": 34.398117086661905, "difficulty": "Medium", "likes": 3042, "dislikes": 955, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159448, "totalSubmissionRaw": 463537}, "325": {"acRate": 49.50639599555061, "difficulty": "Medium", "likes": 2033, "dislikes": 63, "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": 185146, "totalSubmissionRaw": 373984}, "326": {"acRate": 46.65570950661173, "difficulty": "Easy", "likes": 3065, "dislikes": 274, "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": 841382, "totalSubmissionRaw": 1803386}, "327": {"acRate": 35.94742963479879, "difficulty": "Hard", "likes": 2281, "dislikes": 239, "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": 77269, "totalSubmissionRaw": 214950}, "328": {"acRate": 61.41724710789423, "difficulty": "Medium", "likes": 9823, "dislikes": 524, "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": 932373, "totalSubmissionRaw": 1518097}, "329": {"acRate": 53.702740527748794, "difficulty": "Hard", "likes": 8891, "dislikes": 131, "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": 527614, "totalSubmissionRaw": 982472}, "330": {"acRate": 41.933629382813095, "difficulty": "Hard", "likes": 1565, "dislikes": 136, "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": 71483, "totalSubmissionRaw": 170467}, "331": {"acRate": 45.26530664482441, "difficulty": "Medium", "likes": 2317, "dislikes": 121, "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": 141474, "totalSubmissionRaw": 312544}, "332": {"acRate": 43.24099388871019, "difficulty": "Hard", "likes": 5845, "dislikes": 1862, "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": 430196, "totalSubmissionRaw": 994879}, "333": {"acRate": 43.907853096069175, "difficulty": "Medium", "likes": 1481, "dislikes": 126, "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": 107803, "totalSubmissionRaw": 245521}, "334": {"acRate": 39.77064172548314, "difficulty": "Medium", "likes": 8006, "dislikes": 501, "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": 574473, "totalSubmissionRaw": 1444465}, "335": {"acRate": 30.574566850760597, "difficulty": "Hard", "likes": 381, "dislikes": 509, "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": 34711, "totalSubmissionRaw": 113529}, "336": {"acRate": 35.3772841570116, "difficulty": "Hard", "likes": 4447, "dislikes": 463, "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": 206534, "totalSubmissionRaw": 583804}, "337": {"acRate": 54.27570113332521, "difficulty": "Medium", "likes": 8473, "dislikes": 140, "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": 382838, "totalSubmissionRaw": 705358}, "338": {"acRate": 78.37778501770772, "difficulty": "Easy", "likes": 11016, "dislikes": 529, "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": 1113850, "totalSubmissionRaw": 1421130}, "339": {"acRate": 83.78612119602113, "difficulty": "Medium", "likes": 1715, "dislikes": 418, "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": 283858, "totalSubmissionRaw": 338789}, "340": {"acRate": 48.86828473986988, "difficulty": "Medium", "likes": 2822, "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": 346330, "totalSubmissionRaw": 708702}, "341": {"acRate": 64.53348265621408, "difficulty": "Medium", "likes": 4861, "dislikes": 1746, "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": 451762, "totalSubmissionRaw": 700041}, "342": {"acRate": 48.07135151906025, "difficulty": "Easy", "likes": 3901, "dislikes": 394, "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": 669333, "totalSubmissionRaw": 1392374}, "343": {"acRate": 60.39439908221386, "difficulty": "Medium", "likes": 5083, "dislikes": 446, "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": 359029, "totalSubmissionRaw": 594474}, "344": {"acRate": 78.59970335739081, "difficulty": "Easy", "likes": 8564, "dislikes": 1170, "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": 2672416, "totalSubmissionRaw": 3400037}, "345": {"acRate": 53.29619955370271, "difficulty": "Easy", "likes": 4497, "dislikes": 2777, "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": 862661, "totalSubmissionRaw": 1618624}, "346": {"acRate": 78.47542998041212, "difficulty": "Easy", "likes": 1648, "dislikes": 165, "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": 387009, "totalSubmissionRaw": 493160}, "347": {"acRate": 62.83229467682172, "difficulty": "Medium", "likes": 17142, "dislikes": 650, "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": 2138626, "totalSubmissionRaw": 3403713}, "348": {"acRate": 58.04285545163963, "difficulty": "Medium", "likes": 2059, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245144, "totalSubmissionRaw": 422350}, "349": {"acRate": 74.59573824996222, "difficulty": "Easy", "likes": 5979, "dislikes": 2290, "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": 1219191, "totalSubmissionRaw": 1634398}, "350": {"acRate": 56.52569222484106, "difficulty": "Easy", "likes": 7137, "dislikes": 937, "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": 1212314, "totalSubmissionRaw": 2144714}, "351": {"acRate": 51.85307316233925, "difficulty": "Medium", "likes": 159, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72334, "totalSubmissionRaw": 139498}, "352": {"acRate": 60.053394523751734, "difficulty": "Hard", "likes": 1727, "dislikes": 362, "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": 108872, "totalSubmissionRaw": 181292}, "353": {"acRate": 38.77436557557925, "difficulty": "Medium", "likes": 936, "dislikes": 332, "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": 84342, "totalSubmissionRaw": 217520}, "354": {"acRate": 37.08620751186634, "difficulty": "Hard", "likes": 5917, "dislikes": 145, "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": 218226, "totalSubmissionRaw": 588428}, "355": {"acRate": 39.628441357548624, "difficulty": "Medium", "likes": 3822, "dislikes": 516, "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": 179841, "totalSubmissionRaw": 453818}, "356": {"acRate": 35.57416642051674, "difficulty": "Medium", "likes": 297, "dislikes": 618, "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": 40948, "totalSubmissionRaw": 115106}, "357": {"acRate": 53.06083519636194, "difficulty": "Medium", "likes": 1509, "dislikes": 1490, "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": 139082, "totalSubmissionRaw": 262118}, "358": {"acRate": 38.77845087926801, "difficulty": "Hard", "likes": 957, "dislikes": 38, "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": 64589, "totalSubmissionRaw": 166559}, "359": {"acRate": 75.91547690290957, "difficulty": "Easy", "likes": 1715, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 319674, "totalSubmissionRaw": 421092}, "360": {"acRate": 55.83199367169359, "difficulty": "Medium", "likes": 668, "dislikes": 210, "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": 65639, "totalSubmissionRaw": 117566}, "361": {"acRate": 51.787205280108154, "difficulty": "Medium", "likes": 957, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78150, "totalSubmissionRaw": 150906}, "362": {"acRate": 68.72034020755834, "difficulty": "Medium", "likes": 2024, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242553, "totalSubmissionRaw": 352958}, "363": {"acRate": 44.16505253684962, "difficulty": "Hard", "likes": 3440, "dislikes": 171, "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": 125635, "totalSubmissionRaw": 284466}, "364": {"acRate": 65.07591778543424, "difficulty": "Medium", "likes": 1122, "dislikes": 449, "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": 136935, "totalSubmissionRaw": 210424}, "365": {"acRate": 40.74549060121359, "difficulty": "Medium", "likes": 1484, "dislikes": 1467, "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": 102938, "totalSubmissionRaw": 252637}, "366": {"acRate": 80.60674002059939, "difficulty": "Medium", "likes": 3212, "dislikes": 56, "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": 256697, "totalSubmissionRaw": 318456}, "367": {"acRate": 43.67612191969597, "difficulty": "Easy", "likes": 4190, "dislikes": 305, "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": 612323, "totalSubmissionRaw": 1401968}, "368": {"acRate": 45.32386072116962, "difficulty": "Medium", "likes": 5869, "dislikes": 273, "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": 294165, "totalSubmissionRaw": 649029}, "369": {"acRate": 61.05358598672732, "difficulty": "Medium", "likes": 939, "dislikes": 45, "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": 80131, "totalSubmissionRaw": 131247}, "370": {"acRate": 71.62988323042123, "difficulty": "Medium", "likes": 1632, "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": 93732, "totalSubmissionRaw": 130856}, "371": {"acRate": 51.984013917396645, "difficulty": "Medium", "likes": 4139, "dislikes": 5484, "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": 483482, "totalSubmissionRaw": 930059}, "372": {"acRate": 35.135994987983885, "difficulty": "Medium", "likes": 916, "dislikes": 1427, "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": 71785, "totalSubmissionRaw": 204307}, "373": {"acRate": 39.97422749604016, "difficulty": "Medium", "likes": 6166, "dislikes": 444, "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": 297798, "totalSubmissionRaw": 744977}, "374": {"acRate": 53.63787273286197, "difficulty": "Easy", "likes": 3684, "dislikes": 516, "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": 654304, "totalSubmissionRaw": 1219854}, "375": {"acRate": 49.103449366838305, "difficulty": "Medium", "likes": 2128, "dislikes": 2111, "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": 124162, "totalSubmissionRaw": 252858}, "376": {"acRate": 48.54317206868382, "difficulty": "Medium", "likes": 5076, "dislikes": 163, "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": 246010, "totalSubmissionRaw": 506786}, "377": {"acRate": 54.191462689033045, "difficulty": "Medium", "likes": 7329, "dislikes": 658, "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": 485452, "totalSubmissionRaw": 895809}, "378": {"acRate": 62.50751939852913, "difficulty": "Medium", "likes": 9862, "dislikes": 350, "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": 617227, "totalSubmissionRaw": 987445}, "379": {"acRate": 51.72448859858412, "difficulty": "Medium", "likes": 351, "dislikes": 469, "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": 66121, "totalSubmissionRaw": 127834}, "380": {"acRate": 54.458611758719286, "difficulty": "Medium", "likes": 9149, "dislikes": 612, "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": 918234, "totalSubmissionRaw": 1686114}, "381": {"acRate": 35.46850290258134, "difficulty": "Hard", "likes": 2276, "dislikes": 150, "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": 143092, "totalSubmissionRaw": 403434}, "382": {"acRate": 63.21076583019113, "difficulty": "Medium", "likes": 3062, "dislikes": 704, "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": 243077, "totalSubmissionRaw": 384550}, "383": {"acRate": 61.605005972649096, "difficulty": "Easy", "likes": 4930, "dislikes": 497, "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": 1159334, "totalSubmissionRaw": 1881890}, "384": {"acRate": 58.357001910825815, "difficulty": "Medium", "likes": 1336, "dislikes": 924, "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": 336553, "totalSubmissionRaw": 576714}, "385": {"acRate": 38.25312656328164, "difficulty": "Medium", "likes": 454, "dislikes": 1367, "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": 57351, "totalSubmissionRaw": 149925}, "386": {"acRate": 64.08317678981423, "difficulty": "Medium", "likes": 1945, "dislikes": 143, "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": 122809, "totalSubmissionRaw": 191640}, "387": {"acRate": 62.196894031449105, "difficulty": "Easy", "likes": 8915, "dislikes": 292, "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": 1724949, "totalSubmissionRaw": 2773369}, "388": {"acRate": 47.44602406255532, "difficulty": "Medium", "likes": 1270, "dislikes": 2487, "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": 155455, "totalSubmissionRaw": 327646}, "389": {"acRate": 59.65094927237282, "difficulty": "Easy", "likes": 4963, "dislikes": 478, "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": 737410, "totalSubmissionRaw": 1236209}, "390": {"acRate": 45.72724057795291, "difficulty": "Medium", "likes": 1532, "dislikes": 700, "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": 72409, "totalSubmissionRaw": 158351}, "391": {"acRate": 33.77064150369074, "difficulty": "Hard", "likes": 869, "dislikes": 118, "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": 44378, "totalSubmissionRaw": 131410}, "392": {"acRate": 48.01589054802061, "difficulty": "Easy", "likes": 9515, "dislikes": 520, "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": 1445439, "totalSubmissionRaw": 3010335}, "393": {"acRate": 45.17031941751125, "difficulty": "Medium", "likes": 901, "dislikes": 2864, "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": 123455, "totalSubmissionRaw": 273308}, "394": {"acRate": 59.27378898824192, "difficulty": "Medium", "likes": 12535, "dislikes": 597, "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": 808167, "totalSubmissionRaw": 1363456}, "395": {"acRate": 44.982691350074695, "difficulty": "Medium", "likes": 6177, "dislikes": 505, "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": 224931, "totalSubmissionRaw": 500039}, "396": {"acRate": 42.6238775034586, "difficulty": "Medium", "likes": 1553, "dislikes": 266, "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": 85960, "totalSubmissionRaw": 201671}, "397": {"acRate": 35.76629790775298, "difficulty": "Medium", "likes": 1321, "dislikes": 477, "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": 118620, "totalSubmissionRaw": 331652}, "398": {"acRate": 63.41528840753439, "difficulty": "Medium", "likes": 1274, "dislikes": 1283, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 226948, "totalSubmissionRaw": 357877}, "399": {"acRate": 61.749239910648576, "difficulty": "Medium", "likes": 9144, "dislikes": 914, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 471591, "totalSubmissionRaw": 763721}, "400": {"acRate": 34.833875006277665, "difficulty": "Medium", "likes": 1061, "dislikes": 2043, "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": 97105, "totalSubmissionRaw": 278766}, "401": {"acRate": 54.55490245546388, "difficulty": "Easy", "likes": 1371, "dislikes": 2538, "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": 144882, "totalSubmissionRaw": 265571}, "402": {"acRate": 33.584125969756556, "difficulty": "Medium", "likes": 9393, "dislikes": 482, "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": 484538, "totalSubmissionRaw": 1442759}, "403": {"acRate": 46.099444374180294, "difficulty": "Hard", "likes": 5530, "dislikes": 252, "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": 266080, "totalSubmissionRaw": 577187}, "404": {"acRate": 60.6643985689337, "difficulty": "Easy", "likes": 5449, "dislikes": 306, "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": 622130, "totalSubmissionRaw": 1025528}, "405": {"acRate": 48.582384382988614, "difficulty": "Easy", "likes": 1306, "dislikes": 217, "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": 146335, "totalSubmissionRaw": 301210}, "406": {"acRate": 73.50754783858453, "difficulty": "Medium", "likes": 7052, "dislikes": 713, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302782, "totalSubmissionRaw": 411906}, "407": {"acRate": 47.97543886247712, "difficulty": "Hard", "likes": 3717, "dislikes": 94, "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": 88602, "totalSubmissionRaw": 184682}, "408": {"acRate": 35.86452240616982, "difficulty": "Easy", "likes": 721, "dislikes": 2193, "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": 190942, "totalSubmissionRaw": 532395}, "409": {"acRate": 55.25265150726513, "difficulty": "Easy", "likes": 5820, "dislikes": 403, "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": 769413, "totalSubmissionRaw": 1392599}, "410": {"acRate": 55.47077613385597, "difficulty": "Hard", "likes": 9660, "dislikes": 217, "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": 347138, "totalSubmissionRaw": 625804}, "411": {"acRate": 39.7585480473181, "difficulty": "Hard", "likes": 179, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14721, "totalSubmissionRaw": 37026}, "412": {"acRate": 72.29790520197459, "difficulty": "Easy", "likes": 2704, "dislikes": 364, "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": 1247954, "totalSubmissionRaw": 1726129}, "413": {"acRate": 65.04989394625764, "difficulty": "Medium", "likes": 5319, "dislikes": 294, "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": 307296, "totalSubmissionRaw": 472401}, "414": {"acRate": 35.01148130496946, "difficulty": "Easy", "likes": 3001, "dislikes": 3141, "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": 541420, "totalSubmissionRaw": 1546411}, "415": {"acRate": 51.67155510470744, "difficulty": "Easy", "likes": 4996, "dislikes": 745, "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": 675428, "totalSubmissionRaw": 1307160}, "416": {"acRate": 46.34837865049801, "difficulty": "Medium", "likes": 12136, "dislikes": 242, "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": 835506, "totalSubmissionRaw": 1802664}, "417": {"acRate": 55.34361950182367, "difficulty": "Medium", "likes": 7289, "dislikes": 1451, "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": 471143, "totalSubmissionRaw": 851305}, "418": {"acRate": 36.171071140402866, "difficulty": "Medium", "likes": 1112, "dislikes": 542, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101313, "totalSubmissionRaw": 280094}, "419": {"acRate": 75.42686701151464, "difficulty": "Medium", "likes": 2275, "dislikes": 968, "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": 208372, "totalSubmissionRaw": 276257}, "420": {"acRate": 13.681610018594323, "difficulty": "Hard", "likes": 861, "dislikes": 1724, "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": 41646, "totalSubmissionRaw": 304393}, "421": {"acRate": 53.22438540084554, "difficulty": "Medium", "likes": 5430, "dislikes": 394, "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": 161899, "totalSubmissionRaw": 304182}, "422": {"acRate": 41.11805289925907, "difficulty": "Easy", "likes": 424, "dislikes": 269, "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": 58047, "totalSubmissionRaw": 141173}, "423": {"acRate": 51.091039681682105, "difficulty": "Medium", "likes": 824, "dislikes": 2706, "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": 80380, "totalSubmissionRaw": 157327}, "424": {"acRate": 54.10128729233713, "difficulty": "Medium", "likes": 10461, "dislikes": 497, "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": 746387, "totalSubmissionRaw": 1379619}, "425": {"acRate": 53.382158843107995, "difficulty": "Hard", "likes": 1086, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74419, "totalSubmissionRaw": 139408}, "426": {"acRate": 64.81642385176504, "difficulty": "Medium", "likes": 2589, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "426", "paidOnly": true, "title": "Convert Binary Search Tree to Sorted Doubly Linked List", "titleSlug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288688, "totalSubmissionRaw": 445393}, "427": {"acRate": 75.47710392995917, "difficulty": "Medium", "likes": 1487, "dislikes": 1823, "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": 122761, "totalSubmissionRaw": 162647}, "428": {"acRate": 67.24748785925904, "difficulty": "Hard", "likes": 1047, "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": 88070, "totalSubmissionRaw": 130964}, "429": {"acRate": 70.84391595474486, "difficulty": "Medium", "likes": 3603, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 306825, "totalSubmissionRaw": 433100}, "430": {"acRate": 60.13078507836068, "difficulty": "Medium", "likes": 4979, "dislikes": 323, "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": 326894, "totalSubmissionRaw": 543638}, "431": {"acRate": 79.5071763327475, "difficulty": "Hard", "likes": 518, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21715, "totalSubmissionRaw": 27312}, "432": {"acRate": 36.80877796979965, "difficulty": "Hard", "likes": 1562, "dislikes": 171, "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": 81149, "totalSubmissionRaw": 220461}, "433": {"acRate": 53.836112704746306, "difficulty": "Medium", "likes": 2933, "dislikes": 317, "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": 167033, "totalSubmissionRaw": 310262}, "434": {"acRate": 36.34183721961728, "difficulty": "Easy", "likes": 783, "dislikes": 1256, "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": 183529, "totalSubmissionRaw": 505013}, "435": {"acRate": 53.391768860544474, "difficulty": "Medium", "likes": 8046, "dislikes": 219, "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": 573307, "totalSubmissionRaw": 1073772}, "436": {"acRate": 52.190262867965075, "difficulty": "Medium", "likes": 2121, "dislikes": 351, "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": 114638, "totalSubmissionRaw": 219654}, "437": {"acRate": 46.267537700313675, "difficulty": "Medium", "likes": 10848, "dislikes": 516, "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": 564038, "totalSubmissionRaw": 1219078}, "438": {"acRate": 50.97788429732882, "difficulty": "Medium", "likes": 12256, "dislikes": 339, "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": 878456, "totalSubmissionRaw": 1723210}, "439": {"acRate": 60.881982048809434, "difficulty": "Medium", "likes": 484, "dislikes": 67, "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": 32830, "totalSubmissionRaw": 53924}, "440": {"acRate": 32.338771259979175, "difficulty": "Hard", "likes": 758, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "440", "paidOnly": false, "title": "K-th Smallest in Lexicographical Order", "titleSlug": "k-th-smallest-in-lexicographical-order", "topicTags": [{"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23292, "totalSubmissionRaw": 72025}, "441": {"acRate": 46.63821098728469, "difficulty": "Easy", "likes": 3840, "dislikes": 1322, "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": 441756, "totalSubmissionRaw": 947196}, "442": {"acRate": 75.71452767696388, "difficulty": "Medium", "likes": 10358, "dislikes": 397, "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": 773350, "totalSubmissionRaw": 1021404}, "443": {"acRate": 54.667056112922, "difficulty": "Medium", "likes": 4972, "dislikes": 7814, "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": 585815, "totalSubmissionRaw": 1071606}, "444": {"acRate": 28.244678955593905, "difficulty": "Medium", "likes": 567, "dislikes": 1506, "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": 55483, "totalSubmissionRaw": 196437}, "445": {"acRate": 61.17912740297646, "difficulty": "Medium", "likes": 5848, "dislikes": 287, "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": 475172, "totalSubmissionRaw": 776689}, "446": {"acRate": 54.575111889829294, "difficulty": "Hard", "likes": 3327, "dislikes": 153, "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": 148888, "totalSubmissionRaw": 272811}, "447": {"acRate": 55.482387026501016, "difficulty": "Medium", "likes": 828, "dislikes": 1013, "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": 100346, "totalSubmissionRaw": 180861}, "448": {"acRate": 61.02942687110935, "difficulty": "Easy", "likes": 9354, "dislikes": 487, "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": 891170, "totalSubmissionRaw": 1460230}, "449": {"acRate": 57.70342298288509, "difficulty": "Medium", "likes": 3475, "dislikes": 168, "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": 236007, "totalSubmissionRaw": 409000}, "450": {"acRate": 51.328831320690746, "difficulty": "Medium", "likes": 8984, "dislikes": 273, "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": 505686, "totalSubmissionRaw": 985177}, "451": {"acRate": 72.61605692834145, "difficulty": "Medium", "likes": 8194, "dislikes": 285, "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": 739116, "totalSubmissionRaw": 1017841}, "452": {"acRate": 59.014220648689765, "difficulty": "Medium", "likes": 7400, "dislikes": 234, "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": 521390, "totalSubmissionRaw": 883501}, "453": {"acRate": 56.759392896920325, "difficulty": "Medium", "likes": 2543, "dislikes": 1891, "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": 172250, "totalSubmissionRaw": 303474}, "454": {"acRate": 57.27785358417935, "difficulty": "Medium", "likes": 4885, "dislikes": 140, "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": 326159, "totalSubmissionRaw": 569433}, "455": {"acRate": 52.61657949221515, "difficulty": "Easy", "likes": 3817, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "455", "paidOnly": false, "title": "Assign Cookies", "titleSlug": "assign-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 449565, "totalSubmissionRaw": 854417}, "456": {"acRate": 33.75957675387579, "difficulty": "Medium", "likes": 7159, "dislikes": 433, "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": 258306, "totalSubmissionRaw": 765134}, "457": {"acRate": 34.115781593048396, "difficulty": "Medium", "likes": 674, "dislikes": 766, "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": 81113, "totalSubmissionRaw": 237758}, "458": {"acRate": 59.63540496412468, "difficulty": "Hard", "likes": 1779, "dislikes": 3353, "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": 119436, "totalSubmissionRaw": 200277}, "459": {"acRate": 46.0765993851746, "difficulty": "Easy", "likes": 6362, "dislikes": 518, "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": 450254, "totalSubmissionRaw": 977186}, "460": {"acRate": 44.28848390849166, "difficulty": "Hard", "likes": 5604, "dislikes": 326, "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": 251284, "totalSubmissionRaw": 567380}, "461": {"acRate": 75.42833537692857, "difficulty": "Easy", "likes": 3820, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "461", "paidOnly": false, "title": "Hamming Distance", "titleSlug": "hamming-distance", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575175, "totalSubmissionRaw": 762545}, "462": {"acRate": 60.100827275172776, "difficulty": "Medium", "likes": 3330, "dislikes": 123, "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": 180969, "totalSubmissionRaw": 301109}, "463": {"acRate": 72.7548580709996, "difficulty": "Easy", "likes": 6800, "dislikes": 376, "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": 632025, "totalSubmissionRaw": 868706}, "464": {"acRate": 29.705641380298626, "difficulty": "Medium", "likes": 2643, "dislikes": 394, "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": 95356, "totalSubmissionRaw": 321003}, "465": {"acRate": 49.54705599887775, "difficulty": "Hard", "likes": 1445, "dislikes": 147, "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": 91832, "totalSubmissionRaw": 185343}, "466": {"acRate": 30.25749003471776, "difficulty": "Hard", "likes": 402, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18825, "totalSubmissionRaw": 62216}, "467": {"acRate": 39.75175132514717, "difficulty": "Medium", "likes": 1435, "dislikes": 174, "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": 44772, "totalSubmissionRaw": 112629}, "468": {"acRate": 27.08495330324005, "difficulty": "Medium", "likes": 1003, "dislikes": 2699, "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": 162666, "totalSubmissionRaw": 600577}, "469": {"acRate": 39.47030084854718, "difficulty": "Medium", "likes": 98, "dislikes": 237, "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": 10745, "totalSubmissionRaw": 27223}, "470": {"acRate": 45.889976910911386, "difficulty": "Medium", "likes": 1100, "dislikes": 369, "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": 83277, "totalSubmissionRaw": 181469}, "471": {"acRate": 50.44059357290268, "difficulty": "Hard", "likes": 622, "dislikes": 52, "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": 30796, "totalSubmissionRaw": 61054}, "472": {"acRate": 49.412245507797905, "difficulty": "Hard", "likes": 3843, "dislikes": 281, "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": 224886, "totalSubmissionRaw": 455122}, "473": {"acRate": 40.27277809928299, "difficulty": "Medium", "likes": 3797, "dislikes": 294, "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": 164234, "totalSubmissionRaw": 407804}, "474": {"acRate": 47.632464128067525, "difficulty": "Medium", "likes": 5385, "dislikes": 453, "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": 204057, "totalSubmissionRaw": 428399}, "475": {"acRate": 37.95595661627434, "difficulty": "Medium", "likes": 2078, "dislikes": 1162, "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": 118530, "totalSubmissionRaw": 312283}, "476": {"acRate": 67.66318603968118, "difficulty": "Easy", "likes": 2661, "dislikes": 123, "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": 334043, "totalSubmissionRaw": 493685}, "477": {"acRate": 52.71950814384, "difficulty": "Medium", "likes": 2199, "dislikes": 90, "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": 109500, "totalSubmissionRaw": 207703}, "478": {"acRate": 39.900249376558605, "difficulty": "Medium", "likes": 452, "dislikes": 767, "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": 41120, "totalSubmissionRaw": 103057}, "479": {"acRate": 33.3759104250462, "difficulty": "Hard", "likes": 176, "dislikes": 1557, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24562, "totalSubmissionRaw": 73592}, "480": {"acRate": 39.09294105007743, "difficulty": "Hard", "likes": 3184, "dislikes": 199, "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": 149190, "totalSubmissionRaw": 381629}, "481": {"acRate": 51.34954271693063, "difficulty": "Medium", "likes": 313, "dislikes": 1280, "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": 36832, "totalSubmissionRaw": 71728}, "482": {"acRate": 43.82569444336576, "difficulty": "Easy", "likes": 1089, "dislikes": 1406, "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": 282144, "totalSubmissionRaw": 643785}, "483": {"acRate": 40.73842877338572, "difficulty": "Hard", "likes": 383, "dislikes": 499, "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": 22189, "totalSubmissionRaw": 54467}, "484": {"acRate": 66.8918918918919, "difficulty": "Medium", "likes": 698, "dislikes": 146, "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": 39105, "totalSubmissionRaw": 58460}, "485": {"acRate": 59.29039897702842, "difficulty": "Easy", "likes": 5657, "dislikes": 454, "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": 1178653, "totalSubmissionRaw": 1987933}, "486": {"acRate": 55.40773717493267, "difficulty": "Medium", "likes": 5795, "dislikes": 283, "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": 234731, "totalSubmissionRaw": 423643}, "487": {"acRate": 50.37634520082111, "difficulty": "Medium", "likes": 1534, "dislikes": 25, "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": 145769, "totalSubmissionRaw": 289361}, "488": {"acRate": 32.70285239545832, "difficulty": "Hard", "likes": 451, "dislikes": 492, "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": 23618, "totalSubmissionRaw": 72220}, "489": {"acRate": 76.71552236587902, "difficulty": "Hard", "likes": 2759, "dislikes": 176, "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": 165190, "totalSubmissionRaw": 215328}, "490": {"acRate": 57.99217115475468, "difficulty": "Medium", "likes": 1838, "dislikes": 181, "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": 171854, "totalSubmissionRaw": 296340}, "491": {"acRate": 60.77248299650739, "difficulty": "Medium", "likes": 3623, "dislikes": 228, "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": 168608, "totalSubmissionRaw": 277442}, "492": {"acRate": 57.77254571797784, "difficulty": "Easy", "likes": 694, "dislikes": 388, "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": 118027, "totalSubmissionRaw": 204296}, "493": {"acRate": 30.6395901788504, "difficulty": "Hard", "likes": 6034, "dislikes": 260, "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": 178475, "totalSubmissionRaw": 582498}, "494": {"acRate": 46.92431640166237, "difficulty": "Medium", "likes": 10766, "dislikes": 358, "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": 599321, "totalSubmissionRaw": 1277208}, "495": {"acRate": 56.60801323614899, "difficulty": "Easy", "likes": 1130, "dislikes": 121, "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": 151911, "totalSubmissionRaw": 268356}, "496": {"acRate": 72.31019876831726, "difficulty": "Easy", "likes": 7852, "dislikes": 713, "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": 724339, "totalSubmissionRaw": 1001711}, "497": {"acRate": 40.010112894913405, "difficulty": "Medium", "likes": 473, "dislikes": 669, "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": 41146, "totalSubmissionRaw": 102839}, "498": {"acRate": 60.4036813255635, "difficulty": "Medium", "likes": 3414, "dislikes": 684, "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": 303813, "totalSubmissionRaw": 502971}, "499": {"acRate": 48.856348701066786, "difficulty": "Hard", "likes": 479, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31463, "totalSubmissionRaw": 64399}, "500": {"acRate": 70.78085097841829, "difficulty": "Easy", "likes": 1588, "dislikes": 1130, "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": 229216, "totalSubmissionRaw": 323839}, "501": {"acRate": 56.17210980678756, "difficulty": "Easy", "likes": 3870, "dislikes": 781, "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": 307444, "totalSubmissionRaw": 547325}, "502": {"acRate": 49.541388335481855, "difficulty": "Hard", "likes": 3071, "dislikes": 196, "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": 126821, "totalSubmissionRaw": 255990}, "503": {"acRate": 63.951169829725586, "difficulty": "Medium", "likes": 7862, "dislikes": 195, "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": 401225, "totalSubmissionRaw": 627394}, "504": {"acRate": 50.11442249519952, "difficulty": "Easy", "likes": 791, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133364, "totalSubmissionRaw": 266119}, "505": {"acRate": 53.43773873185638, "difficulty": "Medium", "likes": 1320, "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": 107722, "totalSubmissionRaw": 201585}, "506": {"acRate": 71.65219539307108, "difficulty": "Easy", "likes": 1885, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290065, "totalSubmissionRaw": 404824}, "507": {"acRate": 40.68292078785083, "difficulty": "Easy", "likes": 1067, "dislikes": 1220, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190523, "totalSubmissionRaw": 468312}, "508": {"acRate": 66.48955028923307, "difficulty": "Medium", "likes": 2234, "dislikes": 315, "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": 142527, "totalSubmissionRaw": 214360}, "509": {"acRate": 71.16844856073243, "difficulty": "Easy", "likes": 8072, "dislikes": 355, "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": 1806938, "totalSubmissionRaw": 2538959}, "510": {"acRate": 60.90155967973342, "difficulty": "Medium", "likes": 860, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65795, "totalSubmissionRaw": 108035}, "511": {"acRate": 74.70359469970299, "difficulty": "Easy", "likes": 840, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "511", "paidOnly": false, "title": "Game Play Analysis I", "titleSlug": "game-play-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276415, "totalSubmissionRaw": 370016}, "512": {"acRate": 52.85277386996147, "difficulty": "Easy", "likes": 265, "dislikes": 43, "categoryTitle": "Database", "frontendQuestionId": "512", "paidOnly": true, "title": "Game Play Analysis II", "titleSlug": "game-play-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86408, "totalSubmissionRaw": 163489}, "513": {"acRate": 71.17795479726556, "difficulty": "Medium", "likes": 3768, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359112, "totalSubmissionRaw": 504527}, "514": {"acRate": 58.961627272576976, "difficulty": "Hard", "likes": 1459, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106990, "totalSubmissionRaw": 181457}, "515": {"acRate": 65.66914487492146, "difficulty": "Medium", "likes": 3592, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "515", "paidOnly": false, "title": "Find Largest Value in Each Tree Row", "titleSlug": "find-largest-value-in-each-tree-row", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343861, "totalSubmissionRaw": 523627}, "516": {"acRate": 62.674763306629465, "difficulty": "Medium", "likes": 9453, "dislikes": 322, "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": 488804, "totalSubmissionRaw": 779906}, "517": {"acRate": 41.26901919066083, "difficulty": "Hard", "likes": 763, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29483, "totalSubmissionRaw": 71441}, "518": {"acRate": 64.00817701658117, "difficulty": "Medium", "likes": 9261, "dislikes": 165, "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": 622779, "totalSubmissionRaw": 972969}, "519": {"acRate": 42.018939763741095, "difficulty": "Medium", "likes": 430, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21520, "totalSubmissionRaw": 51215}, "520": {"acRate": 56.43079713969591, "difficulty": "Easy", "likes": 3386, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433011, "totalSubmissionRaw": 767331}, "521": {"acRate": 60.7639971194256, "difficulty": "Easy", "likes": 27, "dislikes": 78, "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": 113065, "totalSubmissionRaw": 186073}, "522": {"acRate": 41.537351994801, "difficulty": "Medium", "likes": 502, "dislikes": 1291, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52411, "totalSubmissionRaw": 126177}, "523": {"acRate": 28.97296755040174, "difficulty": "Medium", "likes": 5518, "dislikes": 551, "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": 462100, "totalSubmissionRaw": 1594935}, "524": {"acRate": 51.20376739510027, "difficulty": "Medium", "likes": 1784, "dislikes": 358, "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": 154832, "totalSubmissionRaw": 302384}, "525": {"acRate": 48.92435658770921, "difficulty": "Medium", "likes": 7865, "dislikes": 371, "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": 453604, "totalSubmissionRaw": 927158}, "526": {"acRate": 64.21229662941195, "difficulty": "Medium", "likes": 3185, "dislikes": 368, "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": 174486, "totalSubmissionRaw": 271733}, "527": {"acRate": 61.03322021789606, "difficulty": "Hard", "likes": 386, "dislikes": 290, "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": 27338, "totalSubmissionRaw": 44792}, "528": {"acRate": 46.907337483416676, "difficulty": "Medium", "likes": 1865, "dislikes": 806, "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": 459645, "totalSubmissionRaw": 979894}, "529": {"acRate": 66.74174427024569, "difficulty": "Medium", "likes": 1945, "dislikes": 1062, "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": 158531, "totalSubmissionRaw": 237530}, "530": {"acRate": 58.361537979625425, "difficulty": "Easy", "likes": 4346, "dislikes": 222, "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": 381943, "totalSubmissionRaw": 654443}, "531": {"acRate": 62.273030030986654, "difficulty": "Medium", "likes": 430, "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": 43007, "totalSubmissionRaw": 69062}, "532": {"acRate": 42.882694623503575, "difficulty": "Medium", "likes": 3833, "dislikes": 2248, "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": 339009, "totalSubmissionRaw": 790551}, "533": {"acRate": 48.5869922860381, "difficulty": "Medium", "likes": 86, "dislikes": 772, "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": 13290, "totalSubmissionRaw": 27353}, "534": {"acRate": 80.82760080431791, "difficulty": "Medium", "likes": 395, "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": 76374, "totalSubmissionRaw": 94490}, "535": {"acRate": 86.39996009377961, "difficulty": "Medium", "likes": 1996, "dislikes": 3776, "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": 259807, "totalSubmissionRaw": 300703}, "536": {"acRate": 56.966106870229005, "difficulty": "Medium", "likes": 1058, "dislikes": 164, "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": 93282, "totalSubmissionRaw": 163750}, "537": {"acRate": 71.83486996836561, "difficulty": "Medium", "likes": 705, "dislikes": 1248, "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": 95600, "totalSubmissionRaw": 133083}, "538": {"acRate": 69.07886107259303, "difficulty": "Medium", "likes": 5155, "dislikes": 172, "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": 294914, "totalSubmissionRaw": 426925}, "539": {"acRate": 56.85776738121716, "difficulty": "Medium", "likes": 1850, "dislikes": 261, "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": 148268, "totalSubmissionRaw": 260770}, "540": {"acRate": 59.07448433293224, "difficulty": "Medium", "likes": 11044, "dislikes": 188, "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": 649036, "totalSubmissionRaw": 1098669}, "541": {"acRate": 50.804936974143075, "difficulty": "Easy", "likes": 1963, "dislikes": 3777, "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": 247505, "totalSubmissionRaw": 487174}, "542": {"acRate": 48.58462251289467, "difficulty": "Medium", "likes": 9358, "dislikes": 412, "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": 564135, "totalSubmissionRaw": 1161139}, "543": {"acRate": 60.55621116858215, "difficulty": "Easy", "likes": 13691, "dislikes": 994, "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": 1515298, "totalSubmissionRaw": 2502303}, "544": {"acRate": 77.1618120212978, "difficulty": "Medium", "likes": 390, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27100, "totalSubmissionRaw": 35121}, "545": {"acRate": 45.49225334634359, "difficulty": "Medium", "likes": 1317, "dislikes": 2179, "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": 133805, "totalSubmissionRaw": 294125}, "546": {"acRate": 47.7890818599107, "difficulty": "Hard", "likes": 2249, "dislikes": 123, "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": 45705, "totalSubmissionRaw": 95639}, "547": {"acRate": 66.31952281393664, "difficulty": "Medium", "likes": 9589, "dislikes": 357, "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": 893253, "totalSubmissionRaw": 1346894}, "548": {"acRate": 50.08486829697617, "difficulty": "Hard", "likes": 414, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "548", "paidOnly": true, "title": "Split Array with Equal Sum", "titleSlug": "split-array-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23901, "totalSubmissionRaw": 47721}, "549": {"acRate": 49.48200078915734, "difficulty": "Medium", "likes": 1151, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "549", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence II", "titleSlug": "binary-tree-longest-consecutive-sequence-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53924, "totalSubmissionRaw": 108977}, "550": {"acRate": 36.43671322525251, "difficulty": "Medium", "likes": 841, "dislikes": 185, "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": 161684, "totalSubmissionRaw": 443739}, "551": {"acRate": 49.086774885804815, "difficulty": "Easy", "likes": 757, "dislikes": 48, "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": 218901, "totalSubmissionRaw": 445947}, "552": {"acRate": 55.00171935999353, "difficulty": "Hard", "likes": 2250, "dislikes": 285, "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": 135956, "totalSubmissionRaw": 247185}, "553": {"acRate": 60.79277924031591, "difficulty": "Medium", "likes": 370, "dislikes": 1595, "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": 40412, "totalSubmissionRaw": 66475}, "554": {"acRate": 54.91306934359771, "difficulty": "Medium", "likes": 2505, "dislikes": 167, "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": 139382, "totalSubmissionRaw": 253823}, "555": {"acRate": 43.43563785480874, "difficulty": "Medium", "likes": 75, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6779, "totalSubmissionRaw": 15607}, "556": {"acRate": 34.056604606797144, "difficulty": "Medium", "likes": 3638, "dislikes": 461, "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": 154241, "totalSubmissionRaw": 452896}, "557": {"acRate": 83.10041182514709, "difficulty": "Easy", "likes": 5882, "dislikes": 248, "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": 906623, "totalSubmissionRaw": 1090997}, "558": {"acRate": 49.67219177621625, "difficulty": "Medium", "likes": 188, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14774, "totalSubmissionRaw": 29743}, "559": {"acRate": 72.19387106129447, "difficulty": "Easy", "likes": 2752, "dislikes": 87, "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": 283782, "totalSubmissionRaw": 393084}, "560": {"acRate": 43.668782982247656, "difficulty": "Medium", "likes": 21308, "dislikes": 650, "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": 1254901, "totalSubmissionRaw": 2873688}, "561": {"acRate": 78.90535655980455, "difficulty": "Easy", "likes": 2029, "dislikes": 257, "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": 480910, "totalSubmissionRaw": 609477}, "562": {"acRate": 50.40104838922108, "difficulty": "Medium", "likes": 888, "dislikes": 116, "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": 76535, "totalSubmissionRaw": 151852}, "563": {"acRate": 61.957087182825575, "difficulty": "Easy", "likes": 2224, "dislikes": 2176, "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": 213190, "totalSubmissionRaw": 344093}, "564": {"acRate": 22.421845006973566, "difficulty": "Hard", "likes": 762, "dislikes": 1442, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46139, "totalSubmissionRaw": 205777}, "565": {"acRate": 56.348116677892335, "difficulty": "Medium", "likes": 2197, "dislikes": 152, "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": 130509, "totalSubmissionRaw": 231612}, "566": {"acRate": 63.12397019485414, "difficulty": "Easy", "likes": 3479, "dislikes": 407, "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": 378508, "totalSubmissionRaw": 599627}, "567": {"acRate": 44.42634085702177, "difficulty": "Medium", "likes": 11198, "dislikes": 404, "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": 862715, "totalSubmissionRaw": 1941900}, "568": {"acRate": 45.678222779983344, "difficulty": "Hard", "likes": 566, "dislikes": 112, "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": 37854, "totalSubmissionRaw": 82871}, "569": {"acRate": 65.92535828999071, "difficulty": "Hard", "likes": 322, "dislikes": 151, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40434, "totalSubmissionRaw": 61333}, "570": {"acRate": 50.1237697318372, "difficulty": "Medium", "likes": 1050, "dislikes": 119, "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": 337334, "totalSubmissionRaw": 673001}, "571": {"acRate": 42.45445321805108, "difficulty": "Hard", "likes": 307, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28872, "totalSubmissionRaw": 68007}, "572": {"acRate": 48.02832059794898, "difficulty": "Easy", "likes": 8134, "dislikes": 505, "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": 857708, "totalSubmissionRaw": 1785837}, "573": {"acRate": 57.152728017197255, "difficulty": "Medium", "likes": 411, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "573", "paidOnly": true, "title": "Squirrel Simulation", "titleSlug": "squirrel-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 22333, "totalSubmissionRaw": 39076}, "574": {"acRate": 60.782593933906746, "difficulty": "Medium", "likes": 172, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64449, "totalSubmissionRaw": 106032}, "575": {"acRate": 67.80271385082627, "difficulty": "Easy", "likes": 1517, "dislikes": 1356, "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": 284866, "totalSubmissionRaw": 420140}, "576": {"acRate": 48.06408544726302, "difficulty": "Medium", "likes": 3862, "dislikes": 290, "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": 207000, "totalSubmissionRaw": 430675}, "577": {"acRate": 75.22205014440584, "difficulty": "Easy", "likes": 872, "dislikes": 212, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359422, "totalSubmissionRaw": 477815}, "578": {"acRate": 40.28646489365531, "difficulty": "Medium", "likes": 127, "dislikes": 913, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55972, "totalSubmissionRaw": 138935}, "579": {"acRate": 46.97855227882037, "difficulty": "Hard", "likes": 237, "dislikes": 402, "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": 35046, "totalSubmissionRaw": 74600}, "580": {"acRate": 58.990561159654, "difficulty": "Medium", "likes": 243, "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": 67310, "totalSubmissionRaw": 114103}, "581": {"acRate": 36.88501883622522, "difficulty": "Medium", "likes": 7715, "dislikes": 259, "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": 328879, "totalSubmissionRaw": 891633}, "582": {"acRate": 69.42902426138903, "difficulty": "Medium", "likes": 1105, "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": 85422, "totalSubmissionRaw": 123035}, "583": {"acRate": 61.70525731601604, "difficulty": "Medium", "likes": 5699, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "583", "paidOnly": false, "title": "Delete Operation for Two Strings", "titleSlug": "delete-operation-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251278, "totalSubmissionRaw": 407223}, "584": {"acRate": 69.93283706667833, "difficulty": "Easy", "likes": 1975, "dislikes": 355, "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": 862958, "totalSubmissionRaw": 1233982}, "585": {"acRate": 47.78960743077462, "difficulty": "Medium", "likes": 528, "dislikes": 468, "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": 109072, "totalSubmissionRaw": 228235}, "586": {"acRate": 64.75313152270681, "difficulty": "Easy", "likes": 976, "dislikes": 72, "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": 259661, "totalSubmissionRaw": 401002}, "587": {"acRate": 51.950443813562366, "difficulty": "Hard", "likes": 1459, "dislikes": 643, "categoryTitle": "Algorithms", "frontendQuestionId": "587", "paidOnly": false, "title": "Erect the Fence", "titleSlug": "erect-the-fence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57825, "totalSubmissionRaw": 111308}, "588": {"acRate": 48.09566724436742, "difficulty": "Hard", "likes": 1477, "dislikes": 166, "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": 104066, "totalSubmissionRaw": 216372}, "589": {"acRate": 75.52939267141315, "difficulty": "Easy", "likes": 3122, "dislikes": 200, "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": 428158, "totalSubmissionRaw": 566876}, "590": {"acRate": 77.92797171358792, "difficulty": "Easy", "likes": 2324, "dislikes": 98, "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": 256542, "totalSubmissionRaw": 329204}, "591": {"acRate": 38.268361082337485, "difficulty": "Hard", "likes": 167, "dislikes": 644, "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": 15147, "totalSubmissionRaw": 39581}, "592": {"acRate": 53.311302243925475, "difficulty": "Medium", "likes": 392, "dislikes": 505, "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": 36136, "totalSubmissionRaw": 67783}, "593": {"acRate": 44.02055662001104, "difficulty": "Medium", "likes": 1038, "dislikes": 907, "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": 108441, "totalSubmissionRaw": 246343}, "594": {"acRate": 54.72794360612402, "difficulty": "Easy", "likes": 2132, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "594", "paidOnly": false, "title": "Longest Harmonious Subsequence", "titleSlug": "longest-harmonious-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158999, "totalSubmissionRaw": 290526}, "595": {"acRate": 68.13787115031533, "difficulty": "Easy", "likes": 2635, "dislikes": 1308, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1172346, "totalSubmissionRaw": 1720548}, "596": {"acRate": 55.196544660425616, "difficulty": "Easy", "likes": 1014, "dislikes": 1075, "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": 409834, "totalSubmissionRaw": 742501}, "597": {"acRate": 41.90249821873886, "difficulty": "Easy", "likes": 304, "dislikes": 764, "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": 75277, "totalSubmissionRaw": 179648}, "598": {"acRate": 56.13877147719163, "difficulty": "Easy", "likes": 931, "dislikes": 966, "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": 102268, "totalSubmissionRaw": 182170}, "599": {"acRate": 55.58014787609336, "difficulty": "Easy", "likes": 1934, "dislikes": 392, "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": 230024, "totalSubmissionRaw": 413860}, "600": {"acRate": 39.839431429323504, "difficulty": "Hard", "likes": 1512, "dislikes": 133, "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": 39351, "totalSubmissionRaw": 98774}, "601": {"acRate": 48.62672494417193, "difficulty": "Hard", "likes": 665, "dislikes": 563, "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": 101908, "totalSubmissionRaw": 209572}, "602": {"acRate": 57.370563015517206, "difficulty": "Medium", "likes": 611, "dislikes": 115, "categoryTitle": "Database", "frontendQuestionId": "602", "paidOnly": false, "title": "Friend Requests II: Who Has the Most Friends", "titleSlug": "friend-requests-ii-who-has-the-most-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131803, "totalSubmissionRaw": 229736}, "603": {"acRate": 66.02420302461506, "difficulty": "Easy", "likes": 640, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "603", "paidOnly": true, "title": "Consecutive Available Seats", "titleSlug": "consecutive-available-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86530, "totalSubmissionRaw": 131058}, "604": {"acRate": 39.78060804278024, "difficulty": "Easy", "likes": 437, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33327, "totalSubmissionRaw": 83777}, "605": {"acRate": 29.12376996580593, "difficulty": "Easy", "likes": 6450, "dislikes": 1151, "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": 787401, "totalSubmissionRaw": 2703620}, "606": {"acRate": 69.26521372029372, "difficulty": "Medium", "likes": 50, "dislikes": 24, "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": 319118, "totalSubmissionRaw": 460719}, "607": {"acRate": 65.7385311379949, "difficulty": "Easy", "likes": 1154, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214043, "totalSubmissionRaw": 325598}, "608": {"acRate": 72.31172024405792, "difficulty": "Medium", "likes": 1220, "dislikes": 127, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158811, "totalSubmissionRaw": 219620}, "609": {"acRate": 67.64282306570774, "difficulty": "Medium", "likes": 1504, "dislikes": 1648, "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": 151710, "totalSubmissionRaw": 224281}, "610": {"acRate": 71.57870614202606, "difficulty": "Easy", "likes": 564, "dislikes": 157, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178035, "totalSubmissionRaw": 248727}, "611": {"acRate": 51.1864619602324, "difficulty": "Medium", "likes": 3789, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "611", "paidOnly": false, "title": "Valid Triangle Number", "titleSlug": "valid-triangle-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195671, "totalSubmissionRaw": 382271}, "612": {"acRate": 61.356658229364804, "difficulty": "Medium", "likes": 217, "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": 40966, "totalSubmissionRaw": 66767}, "613": {"acRate": 80.17050412834799, "difficulty": "Easy", "likes": 328, "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": 71658, "totalSubmissionRaw": 89382}, "614": {"acRate": 38.65996649916248, "difficulty": "Medium", "likes": 158, "dislikes": 742, "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": 53084, "totalSubmissionRaw": 137310}, "615": {"acRate": 56.09590310819996, "difficulty": "Hard", "likes": 236, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "615", "paidOnly": true, "title": "Average Salary: Departments VS Company", "titleSlug": "average-salary-departments-vs-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36312, "totalSubmissionRaw": 64732}, "616": {"acRate": 49.80074651443627, "difficulty": "Medium", "likes": 1068, "dislikes": 191, "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": 90727, "totalSubmissionRaw": 182180}, "617": {"acRate": 78.95924542681365, "difficulty": "Easy", "likes": 8741, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "617", "paidOnly": false, "title": "Merge Two Binary Trees", "titleSlug": "merge-two-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 770824, "totalSubmissionRaw": 976231}, "618": {"acRate": 63.45449273834313, "difficulty": "Hard", "likes": 184, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24074, "totalSubmissionRaw": 37939}, "619": {"acRate": 63.11946642794333, "difficulty": "Easy", "likes": 589, "dislikes": 179, "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": 198827, "totalSubmissionRaw": 315004}, "620": {"acRate": 73.71906990097064, "difficulty": "Easy", "likes": 1092, "dislikes": 541, "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": 472479, "totalSubmissionRaw": 640919}, "621": {"acRate": 59.975390572827514, "difficulty": "Medium", "likes": 10368, "dislikes": 2056, "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": 633155, "totalSubmissionRaw": 1055691}, "622": {"acRate": 51.47089407223028, "difficulty": "Medium", "likes": 3505, "dislikes": 287, "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": 316791, "totalSubmissionRaw": 615476}, "623": {"acRate": 64.02595453500861, "difficulty": "Medium", "likes": 3531, "dislikes": 264, "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": 273031, "totalSubmissionRaw": 426438}, "624": {"acRate": 42.406778498164726, "difficulty": "Medium", "likes": 761, "dislikes": 72, "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": 49448, "totalSubmissionRaw": 116604}, "625": {"acRate": 33.60351533505537, "difficulty": "Medium", "likes": 127, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11318, "totalSubmissionRaw": 33681}, "626": {"acRate": 69.80483498923982, "difficulty": "Medium", "likes": 1386, "dislikes": 581, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216675, "totalSubmissionRaw": 310402}, "627": {"acRate": 83.28880774887165, "difficulty": "Easy", "likes": 1713, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 410592, "totalSubmissionRaw": 492974}, "628": {"acRate": 45.23240497323855, "difficulty": "Easy", "likes": 4179, "dislikes": 668, "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": 325533, "totalSubmissionRaw": 719689}, "629": {"acRate": 49.855600323580326, "difficulty": "Hard", "likes": 2640, "dislikes": 320, "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": 127574, "totalSubmissionRaw": 255887}, "630": {"acRate": 40.208485511444394, "difficulty": "Hard", "likes": 3759, "dislikes": 96, "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": 111743, "totalSubmissionRaw": 277909}, "631": {"acRate": 43.811349693251536, "difficulty": "Hard", "likes": 232, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17139, "totalSubmissionRaw": 39120}, "632": {"acRate": 62.63027847389746, "difficulty": "Hard", "likes": 3428, "dislikes": 72, "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": 106965, "totalSubmissionRaw": 170788}, "633": {"acRate": 33.94855545576556, "difficulty": "Medium", "likes": 2520, "dislikes": 545, "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": 201852, "totalSubmissionRaw": 594580}, "634": {"acRate": 41.928587502812995, "difficulty": "Medium", "likes": 218, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "634", "paidOnly": true, "title": "Find the Derangement of An Array", "titleSlug": "find-the-derangement-of-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11179, "totalSubmissionRaw": 26662}, "635": {"acRate": 61.06220913004828, "difficulty": "Medium", "likes": 470, "dislikes": 210, "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": 35032, "totalSubmissionRaw": 57371}, "636": {"acRate": 62.16169038669989, "difficulty": "Medium", "likes": 1937, "dislikes": 2770, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 220788, "totalSubmissionRaw": 355184}, "637": {"acRate": 72.75891784021589, "difficulty": "Easy", "likes": 5236, "dislikes": 325, "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": 513352, "totalSubmissionRaw": 705552}, "638": {"acRate": 52.06927191018915, "difficulty": "Medium", "likes": 1494, "dislikes": 754, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60945, "totalSubmissionRaw": 117046}, "639": {"acRate": 30.7124223679276, "difficulty": "Hard", "likes": 1557, "dislikes": 816, "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": 74524, "totalSubmissionRaw": 242651}, "640": {"acRate": 43.790111981587216, "difficulty": "Medium", "likes": 490, "dislikes": 831, "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": 39574, "totalSubmissionRaw": 90372}, "641": {"acRate": 56.918332916266415, "difficulty": "Medium", "likes": 1163, "dislikes": 75, "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": 70511, "totalSubmissionRaw": 123881}, "642": {"acRate": 48.942225104432204, "difficulty": "Hard", "likes": 2100, "dislikes": 168, "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": "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": 141884, "totalSubmissionRaw": 289901}, "643": {"acRate": 43.372510158663374, "difficulty": "Easy", "likes": 3440, "dislikes": 312, "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": 470059, "totalSubmissionRaw": 1083774}, "644": {"acRate": 36.725568365477855, "difficulty": "Hard", "likes": 616, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20451, "totalSubmissionRaw": 55686}, "645": {"acRate": 44.51978937381781, "difficulty": "Easy", "likes": 4685, "dislikes": 1138, "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": 448609, "totalSubmissionRaw": 1007662}, "646": {"acRate": 59.9016356699319, "difficulty": "Medium", "likes": 4545, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "646", "paidOnly": false, "title": "Maximum Length of Pair Chain", "titleSlug": "maximum-length-of-pair-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235187, "totalSubmissionRaw": 392622}, "647": {"acRate": 70.21046797382016, "difficulty": "Medium", "likes": 10682, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 814533, "totalSubmissionRaw": 1160131}, "648": {"acRate": 62.93362444626891, "difficulty": "Medium", "likes": 2232, "dislikes": 174, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 139510, "totalSubmissionRaw": 221678}, "649": {"acRate": 47.610099444659696, "difficulty": "Medium", "likes": 2306, "dislikes": 1780, "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": 147457, "totalSubmissionRaw": 309719}, "650": {"acRate": 54.15647726364581, "difficulty": "Medium", "likes": 3478, "dislikes": 209, "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": 135531, "totalSubmissionRaw": 250259}, "651": {"acRate": 55.79276328175007, "difficulty": "Medium", "likes": 705, "dislikes": 92, "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": 29636, "totalSubmissionRaw": 53118}, "652": {"acRate": 59.45413147197552, "difficulty": "Medium", "likes": 5781, "dislikes": 464, "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": 262685, "totalSubmissionRaw": 441828}, "653": {"acRate": 61.254833008482464, "difficulty": "Easy", "likes": 6673, "dislikes": 265, "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": 539289, "totalSubmissionRaw": 880403}, "654": {"acRate": 85.38120557061582, "difficulty": "Medium", "likes": 5182, "dislikes": 340, "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": 293544, "totalSubmissionRaw": 343804}, "655": {"acRate": 63.83087158768694, "difficulty": "Medium", "likes": 479, "dislikes": 450, "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": 68885, "totalSubmissionRaw": 107918}, "656": {"acRate": 32.11539770021093, "difficulty": "Hard", "likes": 246, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "656", "paidOnly": true, "title": "Coin Path", "titleSlug": "coin-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14160, "totalSubmissionRaw": 44091}, "657": {"acRate": 75.75040678067691, "difficulty": "Easy", "likes": 2409, "dislikes": 744, "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": 429695, "totalSubmissionRaw": 567253}, "658": {"acRate": 47.463900143421355, "difficulty": "Medium", "likes": 8098, "dislikes": 678, "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": 548366, "totalSubmissionRaw": 1155335}, "659": {"acRate": 51.076769651782314, "difficulty": "Medium", "likes": 4401, "dislikes": 799, "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": 130091, "totalSubmissionRaw": 254697}, "660": {"acRate": 57.3932560252231, "difficulty": "Hard", "likes": 162, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10740, "totalSubmissionRaw": 18713}, "661": {"acRate": 67.33291464921699, "difficulty": "Easy", "likes": 1116, "dislikes": 2899, "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": 166181, "totalSubmissionRaw": 246805}, "662": {"acRate": 43.0017333557287, "difficulty": "Medium", "likes": 8626, "dislikes": 1191, "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": 376343, "totalSubmissionRaw": 875181}, "663": {"acRate": 41.530355035932644, "difficulty": "Medium", "likes": 482, "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": 30975, "totalSubmissionRaw": 74584}, "664": {"acRate": 54.955840519488255, "difficulty": "Hard", "likes": 2194, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "664", "paidOnly": false, "title": "Strange Printer", "titleSlug": "strange-printer", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73798, "totalSubmissionRaw": 134286}, "665": {"acRate": 24.719068410657417, "difficulty": "Medium", "likes": 5690, "dislikes": 778, "categoryTitle": "Algorithms", "frontendQuestionId": "665", "paidOnly": false, "title": "Non-decreasing Array", "titleSlug": "non-decreasing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263199, "totalSubmissionRaw": 1064761}, "666": {"acRate": 61.24323844994236, "difficulty": "Medium", "likes": 397, "dislikes": 507, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34532, "totalSubmissionRaw": 56385}, "667": {"acRate": 60.18443997317237, "difficulty": "Medium", "likes": 793, "dislikes": 1051, "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": 53841, "totalSubmissionRaw": 89460}, "668": {"acRate": 51.719243919747115, "difficulty": "Hard", "likes": 2131, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "668", "paidOnly": false, "title": "Kth Smallest Number in Multiplication Table", "titleSlug": "kth-smallest-number-in-multiplication-table", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64136, "totalSubmissionRaw": 124008}, "669": {"acRate": 66.26168708457496, "difficulty": "Medium", "likes": 5808, "dislikes": 255, "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": 294184, "totalSubmissionRaw": 443973}, "670": {"acRate": 48.78237370587744, "difficulty": "Medium", "likes": 3365, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "670", "paidOnly": false, "title": "Maximum Swap", "titleSlug": "maximum-swap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251095, "totalSubmissionRaw": 514725}, "671": {"acRate": 44.55557892255534, "difficulty": "Easy", "likes": 1832, "dislikes": 1868, "categoryTitle": "Algorithms", "frontendQuestionId": "671", "paidOnly": false, "title": "Second Minimum Node In a Binary Tree", "titleSlug": "second-minimum-node-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 192796, "totalSubmissionRaw": 432709}, "672": {"acRate": 50.12262415695892, "difficulty": "Medium", "likes": 156, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22890, "totalSubmissionRaw": 45668}, "673": {"acRate": 48.061486124145326, "difficulty": "Medium", "likes": 6698, "dislikes": 266, "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": 229434, "totalSubmissionRaw": 477376}, "674": {"acRate": 50.276142777164125, "difficulty": "Easy", "likes": 2335, "dislikes": 179, "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": 265815, "totalSubmissionRaw": 528711}, "675": {"acRate": 34.37941079311691, "difficulty": "Hard", "likes": 1218, "dislikes": 670, "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": 68688, "totalSubmissionRaw": 199794}, "676": {"acRate": 57.46129479039534, "difficulty": "Medium", "likes": 1392, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83805, "totalSubmissionRaw": 145846}, "677": {"acRate": 56.70832396939702, "difficulty": "Medium", "likes": 1634, "dislikes": 154, "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": 116074, "totalSubmissionRaw": 204686}, "678": {"acRate": 37.99543461039014, "difficulty": "Medium", "likes": 6054, "dislikes": 184, "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": 372182, "totalSubmissionRaw": 979544}, "679": {"acRate": 49.36678718911162, "difficulty": "Hard", "likes": 1463, "dislikes": 249, "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": 78781, "totalSubmissionRaw": 159583}, "680": {"acRate": 40.79776234996855, "difficulty": "Easy", "likes": 8147, "dislikes": 433, "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": 748546, "totalSubmissionRaw": 1834776}, "681": {"acRate": 46.66855575161968, "difficulty": "Medium", "likes": 726, "dislikes": 1063, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108699, "totalSubmissionRaw": 232917}, "682": {"acRate": 76.37927507993068, "difficulty": "Easy", "likes": 2795, "dislikes": 1897, "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": 354751, "totalSubmissionRaw": 464461}, "683": {"acRate": 37.083704552203976, "difficulty": "Hard", "likes": 796, "dislikes": 692, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 61187, "totalSubmissionRaw": 164997}, "684": {"acRate": 62.9551255862028, "difficulty": "Medium", "likes": 6122, "dislikes": 395, "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": 360577, "totalSubmissionRaw": 572751}, "685": {"acRate": 34.481257581093246, "difficulty": "Hard", "likes": 2313, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70499, "totalSubmissionRaw": 204456}, "686": {"acRate": 35.046746556727236, "difficulty": "Medium", "likes": 2506, "dislikes": 978, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167637, "totalSubmissionRaw": 478324}, "687": {"acRate": 41.57034441180389, "difficulty": "Medium", "likes": 4218, "dislikes": 672, "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": 184103, "totalSubmissionRaw": 442871}, "688": {"acRate": 56.19521517298573, "difficulty": "Medium", "likes": 3822, "dislikes": 469, "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": 155847, "totalSubmissionRaw": 277333}, "689": {"acRate": 50.05045474372245, "difficulty": "Hard", "likes": 1962, "dislikes": 115, "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": 76879, "totalSubmissionRaw": 153603}, "690": {"acRate": 66.94767441860465, "difficulty": "Medium", "likes": 2082, "dislikes": 1335, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211875, "totalSubmissionRaw": 316479}, "691": {"acRate": 48.74092895759827, "difficulty": "Hard", "likes": 1206, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70590, "totalSubmissionRaw": 144821}, "692": {"acRate": 58.07737706151509, "difficulty": "Medium", "likes": 7613, "dislikes": 344, "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": 617498, "totalSubmissionRaw": 1063233}, "693": {"acRate": 62.51999330456778, "difficulty": "Easy", "likes": 1350, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "693", "paidOnly": false, "title": "Binary Number with Alternating Bits", "titleSlug": "binary-number-with-alternating-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134463, "totalSubmissionRaw": 215072}, "694": {"acRate": 61.32068191255967, "difficulty": "Medium", "likes": 2212, "dislikes": 139, "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": 166864, "totalSubmissionRaw": 272117}, "695": {"acRate": 72.02721480995068, "difficulty": "Medium", "likes": 9881, "dislikes": 200, "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": 868723, "totalSubmissionRaw": 1206105}, "696": {"acRate": 65.564942054804, "difficulty": "Easy", "likes": 3943, "dislikes": 859, "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": 208309, "totalSubmissionRaw": 317714}, "697": {"acRate": 56.59370937845242, "difficulty": "Easy", "likes": 3011, "dislikes": 1728, "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": 214637, "totalSubmissionRaw": 379261}, "698": {"acRate": 38.323939268331245, "difficulty": "Medium", "likes": 7071, "dislikes": 502, "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": 269049, "totalSubmissionRaw": 702038}, "699": {"acRate": 45.023194836627674, "difficulty": "Hard", "likes": 626, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "699", "paidOnly": false, "title": "Falling Squares", "titleSlug": "falling-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26786, "totalSubmissionRaw": 59494}, "700": {"acRate": 79.83743021338992, "difficulty": "Easy", "likes": 5879, "dislikes": 191, "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": 876606, "totalSubmissionRaw": 1097989}, "701": {"acRate": 73.75904451079786, "difficulty": "Medium", "likes": 5765, "dislikes": 172, "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": 531101, "totalSubmissionRaw": 720048}, "702": {"acRate": 72.1373453941296, "difficulty": "Medium", "likes": 907, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97692, "totalSubmissionRaw": 135424}, "703": {"acRate": 56.85000083088223, "difficulty": "Easy", "likes": 5409, "dislikes": 3469, "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": 547370, "totalSubmissionRaw": 962832}, "704": {"acRate": 57.64967715201892, "difficulty": "Easy", "likes": 11685, "dislikes": 246, "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": 2426346, "totalSubmissionRaw": 4208778}, "705": {"acRate": 66.81908804424722, "difficulty": "Easy", "likes": 3759, "dislikes": 307, "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": 415588, "totalSubmissionRaw": 621957}, "706": {"acRate": 65.58367093882218, "difficulty": "Easy", "likes": 5077, "dislikes": 462, "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": 583915, "totalSubmissionRaw": 890337}, "707": {"acRate": 28.2234623930452, "difficulty": "Medium", "likes": 2620, "dislikes": 1609, "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": 331400, "totalSubmissionRaw": 1174202}, "708": {"acRate": 36.24510918374396, "difficulty": "Medium", "likes": 1207, "dislikes": 771, "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": 173136, "totalSubmissionRaw": 477681}, "709": {"acRate": 83.39846745743648, "difficulty": "Easy", "likes": 1827, "dislikes": 2768, "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": 521979, "totalSubmissionRaw": 625886}, "710": {"acRate": 33.41881839468612, "difficulty": "Hard", "likes": 854, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "710", "paidOnly": false, "title": "Random Pick with Blacklist", "titleSlug": "random-pick-with-blacklist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41960, "totalSubmissionRaw": 125558}, "711": {"acRate": 53.014057660233505, "difficulty": "Hard", "likes": 259, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "711", "paidOnly": true, "title": "Number of Distinct Islands II", "titleSlug": "number-of-distinct-islands-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11125, "totalSubmissionRaw": 20985}, "712": {"acRate": 65.10512027274449, "difficulty": "Medium", "likes": 3953, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "712", "paidOnly": false, "title": "Minimum ASCII Delete Sum for Two Strings", "titleSlug": "minimum-ascii-delete-sum-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144368, "totalSubmissionRaw": 221746}, "713": {"acRate": 51.39587359729628, "difficulty": "Medium", "likes": 6789, "dislikes": 215, "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": 406342, "totalSubmissionRaw": 790613}, "714": {"acRate": 68.61844558498089, "difficulty": "Medium", "likes": 7073, "dislikes": 209, "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": 366192, "totalSubmissionRaw": 533665}, "715": {"acRate": 43.9955660314154, "difficulty": "Hard", "likes": 1470, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72235, "totalSubmissionRaw": 164187}, "716": {"acRate": 45.04630055181125, "difficulty": "Hard", "likes": 1909, "dislikes": 509, "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": 151920, "totalSubmissionRaw": 337249}, "717": {"acRate": 45.25582084127059, "difficulty": "Easy", "likes": 862, "dislikes": 2092, "categoryTitle": "Algorithms", "frontendQuestionId": "717", "paidOnly": false, "title": "1-bit and 2-bit Characters", "titleSlug": "1-bit-and-2-bit-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134465, "totalSubmissionRaw": 297122}, "718": {"acRate": 50.9543782579987, "difficulty": "Medium", "likes": 6749, "dislikes": 167, "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": 300186, "totalSubmissionRaw": 589127}, "719": {"acRate": 38.08177577933626, "difficulty": "Hard", "likes": 2957, "dislikes": 96, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 90790, "totalSubmissionRaw": 238408}, "720": {"acRate": 52.47171324615242, "difficulty": "Medium", "likes": 1948, "dislikes": 1484, "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": 152434, "totalSubmissionRaw": 290507}, "721": {"acRate": 57.28496675821685, "difficulty": "Medium", "likes": 6634, "dislikes": 1146, "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": 391700, "totalSubmissionRaw": 683776}, "722": {"acRate": 38.69508626995396, "difficulty": "Medium", "likes": 708, "dislikes": 1799, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71945, "totalSubmissionRaw": 185928}, "723": {"acRate": 76.87634974840158, "difficulty": "Medium", "likes": 1014, "dislikes": 524, "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": 72263, "totalSubmissionRaw": 93999}, "724": {"acRate": 57.74409596861351, "difficulty": "Easy", "likes": 8264, "dislikes": 839, "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": 1097971, "totalSubmissionRaw": 1901448}, "725": {"acRate": 64.08971536708763, "difficulty": "Medium", "likes": 3907, "dislikes": 312, "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": 199137, "totalSubmissionRaw": 310716}, "726": {"acRate": 52.88939031865467, "difficulty": "Hard", "likes": 1256, "dislikes": 291, "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": 59536, "totalSubmissionRaw": 112567}, "727": {"acRate": 43.48172681806535, "difficulty": "Hard", "likes": 1450, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91634, "totalSubmissionRaw": 210744}, "728": {"acRate": 78.6245490733679, "difficulty": "Easy", "likes": 1773, "dislikes": 372, "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": 244324, "totalSubmissionRaw": 310748}, "729": {"acRate": 56.5965353953126, "difficulty": "Medium", "likes": 4187, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 283257, "totalSubmissionRaw": 500486}, "730": {"acRate": 45.4681416476114, "difficulty": "Hard", "likes": 1914, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36786, "totalSubmissionRaw": 80905}, "731": {"acRate": 55.52970878281912, "difficulty": "Medium", "likes": 1734, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100737, "totalSubmissionRaw": 181411}, "732": {"acRate": 71.60042709692728, "difficulty": "Hard", "likes": 1950, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90528, "totalSubmissionRaw": 126435}, "733": {"acRate": 64.03343894759355, "difficulty": "Easy", "likes": 8304, "dislikes": 856, "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": 907217, "totalSubmissionRaw": 1416785}, "734": {"acRate": 44.29473011477113, "difficulty": "Easy", "likes": 42, "dislikes": 55, "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": 66535, "totalSubmissionRaw": 150210}, "735": {"acRate": 44.46755385925293, "difficulty": "Medium", "likes": 7796, "dislikes": 1035, "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": 510768, "totalSubmissionRaw": 1148634}, "736": {"acRate": 51.80453231371818, "difficulty": "Hard", "likes": 473, "dislikes": 359, "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": 22220, "totalSubmissionRaw": 42892}, "737": {"acRate": 50.0154733436489, "difficulty": "Medium", "likes": 838, "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": 71112, "totalSubmissionRaw": 142180}, "738": {"acRate": 48.08951229806302, "difficulty": "Medium", "likes": 1311, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53552, "totalSubmissionRaw": 111359}, "739": {"acRate": 66.06549293693084, "difficulty": "Medium", "likes": 13042, "dislikes": 315, "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": 983437, "totalSubmissionRaw": 1488577}, "740": {"acRate": 56.5027647145729, "difficulty": "Medium", "likes": 7469, "dislikes": 375, "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": 340380, "totalSubmissionRaw": 602413}, "741": {"acRate": 36.85828466031356, "difficulty": "Hard", "likes": 4226, "dislikes": 158, "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": 80333, "totalSubmissionRaw": 217951}, "742": {"acRate": 46.282424816767644, "difficulty": "Medium", "likes": 857, "dislikes": 177, "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": 45908, "totalSubmissionRaw": 99191}, "743": {"acRate": 53.96172318645921, "difficulty": "Medium", "likes": 7324, "dislikes": 363, "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": 495367, "totalSubmissionRaw": 917997}, "744": {"acRate": 52.17797604210167, "difficulty": "Easy", "likes": 4384, "dislikes": 2190, "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": 483537, "totalSubmissionRaw": 926708}, "745": {"acRate": 41.15814339526272, "difficulty": "Hard", "likes": 2267, "dislikes": 483, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96699, "totalSubmissionRaw": 234945}, "746": {"acRate": 65.75536962584665, "difficulty": "Easy", "likes": 11330, "dislikes": 1753, "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": 1180035, "totalSubmissionRaw": 1794584}, "747": {"acRate": 48.94851442306738, "difficulty": "Easy", "likes": 1189, "dislikes": 900, "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": 246608, "totalSubmissionRaw": 503811}, "748": {"acRate": 60.049506124999006, "difficulty": "Easy", "likes": 541, "dislikes": 1103, "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": 75932, "totalSubmissionRaw": 126449}, "749": {"acRate": 50.92701054247284, "difficulty": "Hard", "likes": 392, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12608, "totalSubmissionRaw": 24757}, "750": {"acRate": 67.71736830971018, "difficulty": "Medium", "likes": 617, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38412, "totalSubmissionRaw": 56724}, "751": {"acRate": 55.43960464314447, "difficulty": "Medium", "likes": 88, "dislikes": 315, "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": 24119, "totalSubmissionRaw": 43505}, "752": {"acRate": 60.28895347077166, "difficulty": "Medium", "likes": 4733, "dislikes": 218, "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": 318642, "totalSubmissionRaw": 528525}, "753": {"acRate": 56.87956045233873, "difficulty": "Hard", "likes": 547, "dislikes": 98, "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": 58698, "totalSubmissionRaw": 103197}, "754": {"acRate": 43.11370621745692, "difficulty": "Medium", "likes": 1795, "dislikes": 807, "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": 54565, "totalSubmissionRaw": 126562}, "755": {"acRate": 46.943220693559105, "difficulty": "Medium", "likes": 298, "dislikes": 762, "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": 38147, "totalSubmissionRaw": 81262}, "756": {"acRate": 52.83899240203033, "difficulty": "Medium", "likes": 529, "dislikes": 478, "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": 33520, "totalSubmissionRaw": 63438}, "757": {"acRate": 44.527866012128214, "difficulty": "Hard", "likes": 704, "dislikes": 82, "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": 23130, "totalSubmissionRaw": 51945}, "758": {"acRate": 51.48998534440645, "difficulty": "Medium", "likes": 268, "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": 18972, "totalSubmissionRaw": 36846}, "759": {"acRate": 72.157583970574, "difficulty": "Hard", "likes": 1889, "dislikes": 132, "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": 149092, "totalSubmissionRaw": 206620}, "760": {"acRate": 83.6373076637794, "difficulty": "Easy", "likes": 611, "dislikes": 230, "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": 101483, "totalSubmissionRaw": 121337}, "761": {"acRate": 61.14400507506873, "difficulty": "Hard", "likes": 699, "dislikes": 216, "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": 17349, "totalSubmissionRaw": 28374}, "762": {"acRate": 69.5132577233411, "difficulty": "Easy", "likes": 711, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98125, "totalSubmissionRaw": 141161}, "763": {"acRate": 79.87362675747545, "difficulty": "Medium", "likes": 10240, "dislikes": 392, "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": 537363, "totalSubmissionRaw": 672767}, "764": {"acRate": 48.2275058121321, "difficulty": "Medium", "likes": 1449, "dislikes": 229, "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": 58499, "totalSubmissionRaw": 121298}, "765": {"acRate": 57.307742427909226, "difficulty": "Hard", "likes": 2326, "dislikes": 117, "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": 61568, "totalSubmissionRaw": 107434}, "766": {"acRate": 69.03580180255015, "difficulty": "Easy", "likes": 3507, "dislikes": 167, "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": 332435, "totalSubmissionRaw": 481540}, "767": {"acRate": 54.655719324731976, "difficulty": "Medium", "likes": 8437, "dislikes": 249, "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": 393883, "totalSubmissionRaw": 720660}, "768": {"acRate": 53.25545525803433, "difficulty": "Hard", "likes": 1822, "dislikes": 53, "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": 63186, "totalSubmissionRaw": 118647}, "769": {"acRate": 58.352872377400544, "difficulty": "Medium", "likes": 2799, "dislikes": 238, "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": 105771, "totalSubmissionRaw": 181261}, "770": {"acRate": 55.47468522552197, "difficulty": "Hard", "likes": 161, "dislikes": 1407, "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": 10442, "totalSubmissionRaw": 18823}, "771": {"acRate": 88.62325967881429, "difficulty": "Easy", "likes": 5062, "dislikes": 588, "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": 1045205, "totalSubmissionRaw": 1179380}, "772": {"acRate": 50.73155699981591, "difficulty": "Hard", "likes": 1130, "dislikes": 288, "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": 126767, "totalSubmissionRaw": 249878}, "773": {"acRate": 64.81366183403007, "difficulty": "Hard", "likes": 2015, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94731, "totalSubmissionRaw": 146159}, "774": {"acRate": 52.32016767742711, "difficulty": "Hard", "likes": 677, "dislikes": 96, "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": 30454, "totalSubmissionRaw": 58207}, "775": {"acRate": 42.45933231309868, "difficulty": "Medium", "likes": 1819, "dislikes": 374, "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": 74911, "totalSubmissionRaw": 176430}, "776": {"acRate": 82.68177896305593, "difficulty": "Medium", "likes": 1015, "dislikes": 101, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 105411, "totalSubmissionRaw": 127490}, "777": {"acRate": 36.81503547740243, "difficulty": "Medium", "likes": 1213, "dislikes": 928, "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": 76375, "totalSubmissionRaw": 207455}, "778": {"acRate": 60.85510617430548, "difficulty": "Hard", "likes": 3621, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 161947, "totalSubmissionRaw": 266119}, "779": {"acRate": 46.52102256248302, "difficulty": "Medium", "likes": 3755, "dislikes": 391, "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": 202105, "totalSubmissionRaw": 434438}, "780": {"acRate": 33.2183793481511, "difficulty": "Hard", "likes": 1481, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66656, "totalSubmissionRaw": 200660}, "781": {"acRate": 53.185744141744806, "difficulty": "Medium", "likes": 1314, "dislikes": 609, "categoryTitle": "Algorithms", "frontendQuestionId": "781", "paidOnly": false, "title": "Rabbits in Forest", "titleSlug": "rabbits-in-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57514, "totalSubmissionRaw": 108138}, "782": {"acRate": 50.92234968582464, "difficulty": "Hard", "likes": 353, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "782", "paidOnly": false, "title": "Transform to Chessboard", "titleSlug": "transform-to-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17667, "totalSubmissionRaw": 34694}, "783": {"acRate": 59.54200644120093, "difficulty": "Easy", "likes": 3464, "dislikes": 417, "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": 251250, "totalSubmissionRaw": 421970}, "784": {"acRate": 74.24980052783404, "difficulty": "Medium", "likes": 4627, "dislikes": 155, "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": 302438, "totalSubmissionRaw": 407325}, "785": {"acRate": 55.72607372606575, "difficulty": "Medium", "likes": 8145, "dislikes": 379, "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": 558908, "totalSubmissionRaw": 1002956}, "786": {"acRate": 68.03565996677352, "difficulty": "Medium", "likes": 1970, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145382, "totalSubmissionRaw": 213685}, "787": {"acRate": 39.32135296213746, "difficulty": "Medium", "likes": 9787, "dislikes": 407, "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": 562778, "totalSubmissionRaw": 1431229}, "788": {"acRate": 56.42828837872824, "difficulty": "Medium", "likes": 742, "dislikes": 1923, "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": 106799, "totalSubmissionRaw": 189265}, "789": {"acRate": 61.82045407206832, "difficulty": "Medium", "likes": 289, "dislikes": 28, "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": 29680, "totalSubmissionRaw": 48010}, "790": {"acRate": 50.53346339389753, "difficulty": "Medium", "likes": 3390, "dislikes": 1100, "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": 133139, "totalSubmissionRaw": 263467}, "791": {"acRate": 70.77974970996964, "difficulty": "Medium", "likes": 3580, "dislikes": 409, "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": 430125, "totalSubmissionRaw": 607695}, "792": {"acRate": 50.97038088059238, "difficulty": "Medium", "likes": 5470, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "792", "paidOnly": false, "title": "Number of Matching Subsequences", "titleSlug": "number-of-matching-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229907, "totalSubmissionRaw": 451059}, "793": {"acRate": 44.514039391269144, "difficulty": "Hard", "likes": 429, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "793", "paidOnly": false, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18691, "totalSubmissionRaw": 41989}, "794": {"acRate": 34.69913801314411, "difficulty": "Medium", "likes": 546, "dislikes": 1145, "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": 58289, "totalSubmissionRaw": 167984}, "795": {"acRate": 53.19343413185056, "difficulty": "Medium", "likes": 2279, "dislikes": 118, "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": 69835, "totalSubmissionRaw": 131285}, "796": {"acRate": 58.24773871388314, "difficulty": "Easy", "likes": 3549, "dislikes": 158, "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": 315415, "totalSubmissionRaw": 541506}, "797": {"acRate": 82.47513627310803, "difficulty": "Medium", "likes": 7170, "dislikes": 146, "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": 522607, "totalSubmissionRaw": 633654}, "798": {"acRate": 51.19113778666963, "difficulty": "Hard", "likes": 533, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13817, "totalSubmissionRaw": 26991}, "799": {"acRate": 58.14607908682628, "difficulty": "Medium", "likes": 3629, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "799", "paidOnly": false, "title": "Champagne Tower", "titleSlug": "champagne-tower", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153940, "totalSubmissionRaw": 264747}, "800": {"acRate": 67.40385365473126, "difficulty": "Easy", "likes": 108, "dislikes": 683, "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": 17281, "totalSubmissionRaw": 25638}, "801": {"acRate": 39.98185023853972, "difficulty": "Hard", "likes": 2791, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "801", "paidOnly": false, "title": "Minimum Swaps To Make Sequences Increasing", "titleSlug": "minimum-swaps-to-make-sequences-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77101, "totalSubmissionRaw": 192840}, "802": {"acRate": 62.71023960721459, "difficulty": "Medium", "likes": 5640, "dislikes": 448, "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": 247273, "totalSubmissionRaw": 394311}, "803": {"acRate": 34.75675984679586, "difficulty": "Hard", "likes": 1094, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "803", "paidOnly": false, "title": "Bricks Falling When Hit", "titleSlug": "bricks-falling-when-hit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30400, "totalSubmissionRaw": 87465}, "804": {"acRate": 82.86213233999705, "difficulty": "Easy", "likes": 2500, "dislikes": 1532, "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": 353025, "totalSubmissionRaw": 426039}, "805": {"acRate": 25.377563570836077, "difficulty": "Hard", "likes": 1256, "dislikes": 135, "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": 35489, "totalSubmissionRaw": 139844}, "806": {"acRate": 68.41514028949716, "difficulty": "Easy", "likes": 594, "dislikes": 1326, "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": 79783, "totalSubmissionRaw": 116616}, "807": {"acRate": 86.11615149830608, "difficulty": "Medium", "likes": 2548, "dislikes": 524, "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": 164208, "totalSubmissionRaw": 190682}, "808": {"acRate": 53.946619853383396, "difficulty": "Medium", "likes": 973, "dislikes": 2644, "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": 66377, "totalSubmissionRaw": 123042}, "809": {"acRate": 46.12499258116209, "difficulty": "Medium", "likes": 855, "dislikes": 1901, "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": 116574, "totalSubmissionRaw": 252735}, "810": {"acRate": 59.74639073392984, "difficulty": "Hard", "likes": 220, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "810", "paidOnly": false, "title": "Chalkboard XOR Game", "titleSlug": "chalkboard-xor-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10884, "totalSubmissionRaw": 18217}, "811": {"acRate": 76.21867336563191, "difficulty": "Medium", "likes": 1536, "dislikes": 1296, "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": 229374, "totalSubmissionRaw": 300942}, "812": {"acRate": 60.651954927729754, "difficulty": "Easy", "likes": 526, "dislikes": 1585, "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": 51781, "totalSubmissionRaw": 85374}, "813": {"acRate": 53.475534003927386, "difficulty": "Medium", "likes": 2086, "dislikes": 98, "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": 53374, "totalSubmissionRaw": 99811}, "814": {"acRate": 72.2283728420205, "difficulty": "Medium", "likes": 4497, "dislikes": 112, "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": 243999, "totalSubmissionRaw": 337816}, "815": {"acRate": 47.82147881672002, "difficulty": "Hard", "likes": 4224, "dislikes": 118, "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": 202589, "totalSubmissionRaw": 423636}, "816": {"acRate": 56.74175397381733, "difficulty": "Medium", "likes": 317, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29950, "totalSubmissionRaw": 52783}, "817": {"acRate": 56.79458211782189, "difficulty": "Medium", "likes": 1064, "dislikes": 2203, "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": 93255, "totalSubmissionRaw": 164197}, "818": {"acRate": 43.71117510432054, "difficulty": "Hard", "likes": 1889, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87887, "totalSubmissionRaw": 201063}, "819": {"acRate": 44.325202366242664, "difficulty": "Easy", "likes": 1686, "dislikes": 3051, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358011, "totalSubmissionRaw": 807693}, "820": {"acRate": 60.43800289744185, "difficulty": "Medium", "likes": 1746, "dislikes": 651, "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": 96369, "totalSubmissionRaw": 159451}, "821": {"acRate": 71.58890163019898, "difficulty": "Easy", "likes": 3121, "dislikes": 174, "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": 184791, "totalSubmissionRaw": 258128}, "822": {"acRate": 47.46584068143782, "difficulty": "Medium", "likes": 168, "dislikes": 754, "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": 19002, "totalSubmissionRaw": 40033}, "823": {"acRate": 52.91201193873618, "difficulty": "Medium", "likes": 3293, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "823", "paidOnly": false, "title": "Binary Trees With Factors", "titleSlug": "binary-trees-with-factors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149623, "totalSubmissionRaw": 282777}, "824": {"acRate": 68.26655510307478, "difficulty": "Easy", "likes": 900, "dislikes": 1239, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 177861, "totalSubmissionRaw": 260539}, "825": {"acRate": 47.6363401256452, "difficulty": "Medium", "likes": 743, "dislikes": 1209, "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": 88414, "totalSubmissionRaw": 185602}, "826": {"acRate": 46.5833936219933, "difficulty": "Medium", "likes": 1587, "dislikes": 138, "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": 72760, "totalSubmissionRaw": 156193}, "827": {"acRate": 47.3768956420695, "difficulty": "Hard", "likes": 3845, "dislikes": 72, "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": 176541, "totalSubmissionRaw": 372631}, "828": {"acRate": 52.3713259355139, "difficulty": "Hard", "likes": 2136, "dislikes": 249, "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": 72020, "totalSubmissionRaw": 137518}, "829": {"acRate": 41.806267889055164, "difficulty": "Hard", "likes": 1365, "dislikes": 1378, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86322, "totalSubmissionRaw": 206481}, "830": {"acRate": 52.24772273436004, "difficulty": "Easy", "likes": 868, "dislikes": 123, "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": 95501, "totalSubmissionRaw": 182784}, "831": {"acRate": 48.73097723556785, "difficulty": "Medium", "likes": 166, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19373, "totalSubmissionRaw": 39755}, "832": {"acRate": 81.96550905031118, "difficulty": "Easy", "likes": 3421, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "832", "paidOnly": false, "title": "Flipping an Image", "titleSlug": "flipping-an-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431323, "totalSubmissionRaw": 526225}, "833": {"acRate": 52.537171522941506, "difficulty": "Medium", "likes": 1176, "dislikes": 1007, "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": 148086, "totalSubmissionRaw": 281869}, "834": {"acRate": 65.27930085502406, "difficulty": "Hard", "likes": 5532, "dislikes": 133, "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": 155362, "totalSubmissionRaw": 237999}, "835": {"acRate": 63.652281739272624, "difficulty": "Medium", "likes": 1318, "dislikes": 478, "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": 93425, "totalSubmissionRaw": 146774}, "836": {"acRate": 44.82582030430544, "difficulty": "Easy", "likes": 1981, "dislikes": 467, "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": 145302, "totalSubmissionRaw": 324148}, "837": {"acRate": 44.99239433451906, "difficulty": "Medium", "likes": 1966, "dislikes": 1820, "categoryTitle": "Algorithms", "frontendQuestionId": "837", "paidOnly": false, "title": "New 21 Game", "titleSlug": "new-21-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76016, "totalSubmissionRaw": 168953}, "838": {"acRate": 57.151343510395805, "difficulty": "Medium", "likes": 3368, "dislikes": 226, "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": 124107, "totalSubmissionRaw": 217155}, "839": {"acRate": 54.89715516056622, "difficulty": "Hard", "likes": 2322, "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": 119834, "totalSubmissionRaw": 218289}, "840": {"acRate": 38.960791586883076, "difficulty": "Medium", "likes": 326, "dislikes": 1591, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38862, "totalSubmissionRaw": 99748}, "841": {"acRate": 73.05912545292182, "difficulty": "Medium", "likes": 6047, "dislikes": 277, "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": 440967, "totalSubmissionRaw": 603573}, "842": {"acRate": 39.03143198963802, "difficulty": "Medium", "likes": 1124, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39476, "totalSubmissionRaw": 101139}, "843": {"acRate": 39.206229631691855, "difficulty": "Hard", "likes": 1529, "dislikes": 1777, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 143643, "totalSubmissionRaw": 366378}, "844": {"acRate": 49.152497839817464, "difficulty": "Easy", "likes": 7480, "dislikes": 350, "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": 823116, "totalSubmissionRaw": 1674614}, "845": {"acRate": 40.411954968282224, "difficulty": "Medium", "likes": 2753, "dislikes": 78, "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": 128940, "totalSubmissionRaw": 319064}, "846": {"acRate": 55.89345368901327, "difficulty": "Medium", "likes": 2534, "dislikes": 176, "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": 170155, "totalSubmissionRaw": 304429}, "847": {"acRate": 65.37164225880304, "difficulty": "Hard", "likes": 4271, "dislikes": 166, "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": 123068, "totalSubmissionRaw": 188259}, "848": {"acRate": 44.772267720461286, "difficulty": "Medium", "likes": 1355, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96983, "totalSubmissionRaw": 216612}, "849": {"acRate": 48.148226917171066, "difficulty": "Medium", "likes": 3206, "dislikes": 195, "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": 226390, "totalSubmissionRaw": 470195}, "850": {"acRate": 54.16222067579062, "difficulty": "Hard", "likes": 954, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35023, "totalSubmissionRaw": 64663}, "851": {"acRate": 59.40840551812641, "difficulty": "Medium", "likes": 1268, "dislikes": 806, "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": 46294, "totalSubmissionRaw": 77925}, "852": {"acRate": 68.38338295808384, "difficulty": "Medium", "likes": 7417, "dislikes": 1914, "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": 812795, "totalSubmissionRaw": 1188586}, "853": {"acRate": 51.13464358004832, "difficulty": "Medium", "likes": 3453, "dislikes": 949, "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": 258431, "totalSubmissionRaw": 505397}, "854": {"acRate": 39.868708592042736, "difficulty": "Hard", "likes": 1122, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "854", "paidOnly": false, "title": "K-Similar Strings", "titleSlug": "k-similar-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45975, "totalSubmissionRaw": 115316}, "855": {"acRate": 43.37702423031243, "difficulty": "Medium", "likes": 1322, "dislikes": 476, "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": 60992, "totalSubmissionRaw": 140609}, "856": {"acRate": 64.14824218547867, "difficulty": "Medium", "likes": 5390, "dislikes": 199, "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": 185951, "totalSubmissionRaw": 289877}, "857": {"acRate": 63.263817053347125, "difficulty": "Hard", "likes": 2864, "dislikes": 389, "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": 136994, "totalSubmissionRaw": 216541}, "858": {"acRate": 62.578914017945856, "difficulty": "Medium", "likes": 1101, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79994, "totalSubmissionRaw": 127829}, "859": {"acRate": 33.12446518917169, "difficulty": "Easy", "likes": 3161, "dislikes": 1789, "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": 243489, "totalSubmissionRaw": 735073}, "860": {"acRate": 53.42508233578067, "difficulty": "Easy", "likes": 2313, "dislikes": 162, "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": 186061, "totalSubmissionRaw": 348266}, "861": {"acRate": 80.43220191177049, "difficulty": "Medium", "likes": 2247, "dislikes": 213, "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": 142961, "totalSubmissionRaw": 177741}, "862": {"acRate": 26.011616675871707, "difficulty": "Hard", "likes": 4236, "dislikes": 116, "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": 99374, "totalSubmissionRaw": 382037}, "863": {"acRate": 64.49752605937749, "difficulty": "Medium", "likes": 10871, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 440986, "totalSubmissionRaw": 683726}, "864": {"acRate": 53.585786630178724, "difficulty": "Hard", "likes": 2319, "dislikes": 100, "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": 75975, "totalSubmissionRaw": 141782}, "865": {"acRate": 70.66348146560085, "difficulty": "Medium", "likes": 2622, "dislikes": 372, "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": 138434, "totalSubmissionRaw": 195906}, "866": {"acRate": 25.981687263894255, "difficulty": "Medium", "likes": 432, "dislikes": 825, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32944, "totalSubmissionRaw": 126797}, "867": {"acRate": 71.65934958181244, "difficulty": "Easy", "likes": 3705, "dislikes": 444, "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": 398919, "totalSubmissionRaw": 556688}, "868": {"acRate": 63.46612715156101, "difficulty": "Easy", "likes": 632, "dislikes": 657, "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": 82185, "totalSubmissionRaw": 129496}, "869": {"acRate": 62.67666474679899, "difficulty": "Medium", "likes": 2112, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113174, "totalSubmissionRaw": 180568}, "870": {"acRate": 52.54069976966829, "difficulty": "Medium", "likes": 1601, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67064, "totalSubmissionRaw": 127642}, "871": {"acRate": 40.059438077481566, "difficulty": "Hard", "likes": 4623, "dislikes": 87, "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": 136007, "totalSubmissionRaw": 339512}, "872": {"acRate": 70.08307954900096, "difficulty": "Easy", "likes": 4083, "dislikes": 112, "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": 473830, "totalSubmissionRaw": 676097}, "873": {"acRate": 48.3708571169016, "difficulty": "Medium", "likes": 2010, "dislikes": 72, "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": 63895, "totalSubmissionRaw": 132094}, "874": {"acRate": 40.14711197507106, "difficulty": "Medium", "likes": 202, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41098, "totalSubmissionRaw": 102369}, "875": {"acRate": 48.72413683335419, "difficulty": "Medium", "likes": 10363, "dislikes": 631, "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": 658168, "totalSubmissionRaw": 1350806}, "876": {"acRate": 78.5843468714083, "difficulty": "Easy", "likes": 11496, "dislikes": 363, "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": 1924015, "totalSubmissionRaw": 2448345}, "877": {"acRate": 70.57319642074815, "difficulty": "Medium", "likes": 3200, "dislikes": 2872, "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": 235187, "totalSubmissionRaw": 333253}, "878": {"acRate": 35.37752765593534, "difficulty": "Hard", "likes": 1266, "dislikes": 158, "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": 38472, "totalSubmissionRaw": 108747}, "879": {"acRate": 48.330827529072444, "difficulty": "Hard", "likes": 1823, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "879", "paidOnly": false, "title": "Profitable Schemes", "titleSlug": "profitable-schemes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63006, "totalSubmissionRaw": 130364}, "880": {"acRate": 36.430295850889955, "difficulty": "Medium", "likes": 2498, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97180, "totalSubmissionRaw": 266756}, "881": {"acRate": 59.37609835524664, "difficulty": "Medium", "likes": 6371, "dislikes": 159, "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": 413888, "totalSubmissionRaw": 697062}, "882": {"acRate": 50.35891471459465, "difficulty": "Hard", "likes": 799, "dislikes": 222, "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": 27711, "totalSubmissionRaw": 55027}, "883": {"acRate": 72.6692689758919, "difficulty": "Easy", "likes": 583, "dislikes": 1405, "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": 56036, "totalSubmissionRaw": 77111}, "884": {"acRate": 67.34826558278634, "difficulty": "Easy", "likes": 1328, "dislikes": 166, "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": 139848, "totalSubmissionRaw": 207649}, "885": {"acRate": 74.49956614104904, "difficulty": "Medium", "likes": 917, "dislikes": 863, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49797, "totalSubmissionRaw": 66842}, "886": {"acRate": 50.60802295174762, "difficulty": "Medium", "likes": 4645, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "886", "paidOnly": false, "title": "Possible Bipartition", "titleSlug": "possible-bipartition", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209208, "totalSubmissionRaw": 413388}, "887": {"acRate": 27.684453037266866, "difficulty": "Hard", "likes": 3586, "dislikes": 185, "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": 71738, "totalSubmissionRaw": 259128}, "888": {"acRate": 61.76162251522116, "difficulty": "Easy", "likes": 2092, "dislikes": 373, "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": 122540, "totalSubmissionRaw": 198407}, "889": {"acRate": 71.4097358104175, "difficulty": "Medium", "likes": 2726, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101821, "totalSubmissionRaw": 142587}, "890": {"acRate": 76.83250072251352, "difficulty": "Medium", "likes": 3896, "dislikes": 172, "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": 186096, "totalSubmissionRaw": 242210}, "891": {"acRate": 37.83899514701684, "difficulty": "Hard", "likes": 709, "dislikes": 170, "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": 21208, "totalSubmissionRaw": 56048}, "892": {"acRate": 65.98114261309505, "difficulty": "Easy", "likes": 563, "dislikes": 745, "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": 40168, "totalSubmissionRaw": 60878}, "893": {"acRate": 71.72304746431473, "difficulty": "Medium", "likes": 528, "dislikes": 1480, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49443, "totalSubmissionRaw": 68936}, "894": {"acRate": 82.67936737787632, "difficulty": "Medium", "likes": 5023, "dislikes": 348, "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": 182709, "totalSubmissionRaw": 220985}, "895": {"acRate": 66.36256756344092, "difficulty": "Hard", "likes": 4666, "dislikes": 69, "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": 173853, "totalSubmissionRaw": 261975}, "896": {"acRate": 61.16499191195196, "difficulty": "Easy", "likes": 3017, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 429922, "totalSubmissionRaw": 702889}, "897": {"acRate": 78.30084063673762, "difficulty": "Easy", "likes": 4292, "dislikes": 670, "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": 284557, "totalSubmissionRaw": 363415}, "898": {"acRate": 38.78463299285205, "difficulty": "Medium", "likes": 1438, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35920, "totalSubmissionRaw": 92614}, "899": {"acRate": 65.93282209456974, "difficulty": "Hard", "likes": 1741, "dislikes": 612, "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": 69900, "totalSubmissionRaw": 106015}, "900": {"acRate": 59.53446225293085, "difficulty": "Medium", "likes": 738, "dislikes": 192, "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": 73584, "totalSubmissionRaw": 123599}, "901": {"acRate": 65.87117512595341, "difficulty": "Medium", "likes": 6240, "dislikes": 400, "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": 314965, "totalSubmissionRaw": 478153}, "902": {"acRate": 42.42201519605972, "difficulty": "Hard", "likes": 1385, "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": 44443, "totalSubmissionRaw": 104764}, "903": {"acRate": 57.27029760184917, "difficulty": "Hard", "likes": 716, "dislikes": 42, "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": 15857, "totalSubmissionRaw": 27688}, "904": {"acRate": 44.36412441247608, "difficulty": "Medium", "likes": 4598, "dislikes": 338, "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": 407566, "totalSubmissionRaw": 918685}, "905": {"acRate": 76.23206612514097, "difficulty": "Easy", "likes": 5335, "dislikes": 147, "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": 800996, "totalSubmissionRaw": 1050734}, "906": {"acRate": 38.909154907042975, "difficulty": "Hard", "likes": 356, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24319, "totalSubmissionRaw": 62502}, "907": {"acRate": 37.38091306196832, "difficulty": "Medium", "likes": 7976, "dislikes": 608, "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": 255786, "totalSubmissionRaw": 684266}, "908": {"acRate": 70.0560204392565, "difficulty": "Easy", "likes": 702, "dislikes": 2026, "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": 89664, "totalSubmissionRaw": 127989}, "909": {"acRate": 43.7724158502815, "difficulty": "Medium", "likes": 2852, "dislikes": 984, "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": 186363, "totalSubmissionRaw": 425754}, "910": {"acRate": 36.26463598905671, "difficulty": "Medium", "likes": 1641, "dislikes": 456, "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": 54480, "totalSubmissionRaw": 150229}, "911": {"acRate": 51.96054188671248, "difficulty": "Medium", "likes": 993, "dislikes": 656, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58837, "totalSubmissionRaw": 113234}, "912": {"acRate": 56.35568319159081, "difficulty": "Medium", "likes": 5972, "dislikes": 742, "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": 609898, "totalSubmissionRaw": 1082232}, "913": {"acRate": 33.91562010095267, "difficulty": "Hard", "likes": 904, "dislikes": 158, "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": 19687, "totalSubmissionRaw": 58047}, "914": {"acRate": 29.958247886575883, "difficulty": "Easy", "likes": 1805, "dislikes": 506, "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": 121836, "totalSubmissionRaw": 406686}, "915": {"acRate": 48.792376006845075, "difficulty": "Medium", "likes": 1655, "dislikes": 79, "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": 82686, "totalSubmissionRaw": 169465}, "916": {"acRate": 52.13515915149581, "difficulty": "Medium", "likes": 2701, "dislikes": 231, "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": 114408, "totalSubmissionRaw": 219445}, "917": {"acRate": 64.65152785458179, "difficulty": "Easy", "likes": 2241, "dislikes": 76, "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": 217457, "totalSubmissionRaw": 336352}, "918": {"acRate": 44.94699465240642, "difficulty": "Medium", "likes": 6552, "dislikes": 296, "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": 262658, "totalSubmissionRaw": 584367}, "919": {"acRate": 65.60247538408031, "difficulty": "Medium", "likes": 1096, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54700, "totalSubmissionRaw": 83381}, "920": {"acRate": 60.471286164123796, "difficulty": "Hard", "likes": 2339, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "920", "paidOnly": false, "title": "Number of Music Playlists", "titleSlug": "number-of-music-playlists", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69519, "totalSubmissionRaw": 114962}, "921": {"acRate": 75.14312536385529, "difficulty": "Medium", "likes": 4030, "dislikes": 200, "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": 349787, "totalSubmissionRaw": 465494}, "922": {"acRate": 70.73356349486303, "difficulty": "Easy", "likes": 2589, "dislikes": 94, "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": 254667, "totalSubmissionRaw": 360037}, "923": {"acRate": 45.423396965247186, "difficulty": "Medium", "likes": 2602, "dislikes": 313, "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": 103008, "totalSubmissionRaw": 226773}, "924": {"acRate": 42.054569442083704, "difficulty": "Hard", "likes": 977, "dislikes": 586, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51958, "totalSubmissionRaw": 123549}, "925": {"acRate": 32.31640790837172, "difficulty": "Easy", "likes": 2412, "dislikes": 372, "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": 141584, "totalSubmissionRaw": 438118}, "926": {"acRate": 61.42378813660565, "difficulty": "Medium", "likes": 4393, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "926", "paidOnly": false, "title": "Flip String to Monotone Increasing", "titleSlug": "flip-string-to-monotone-increasing", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190235, "totalSubmissionRaw": 309709}, "927": {"acRate": 39.79254880029826, "difficulty": "Hard", "likes": 827, "dislikes": 121, "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": 29885, "totalSubmissionRaw": 75102}, "928": {"acRate": 43.70179948586118, "difficulty": "Hard", "likes": 660, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22440, "totalSubmissionRaw": 51348}, "929": {"acRate": 67.18195339887423, "difficulty": "Easy", "likes": 2674, "dislikes": 338, "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": 486004, "totalSubmissionRaw": 723414}, "930": {"acRate": 62.452765648132804, "difficulty": "Medium", "likes": 3771, "dislikes": 130, "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": 233696, "totalSubmissionRaw": 374197}, "931": {"acRate": 63.984586015118474, "difficulty": "Medium", "likes": 6255, "dislikes": 158, "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": 433040, "totalSubmissionRaw": 676788}, "932": {"acRate": 65.76580587711487, "difficulty": "Medium", "likes": 1051, "dislikes": 1508, "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": 44313, "totalSubmissionRaw": 67380}, "933": {"acRate": 75.3208166662813, "difficulty": "Easy", "likes": 510, "dislikes": 792, "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": 260599, "totalSubmissionRaw": 345987}, "934": {"acRate": 57.695592492269874, "difficulty": "Medium", "likes": 5336, "dislikes": 205, "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": 204692, "totalSubmissionRaw": 354780}, "935": {"acRate": 60.16824533303877, "difficulty": "Medium", "likes": 3001, "dislikes": 442, "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": 174301, "totalSubmissionRaw": 289692}, "936": {"acRate": 62.479434200123926, "difficulty": "Hard", "likes": 1540, "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": 58482, "totalSubmissionRaw": 93602}, "937": {"acRate": 56.42243521366833, "difficulty": "Medium", "likes": 2083, "dislikes": 4381, "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": 364450, "totalSubmissionRaw": 645931}, "938": {"acRate": 86.8593052105096, "difficulty": "Easy", "likes": 6913, "dislikes": 374, "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": 1055168, "totalSubmissionRaw": 1214803}, "939": {"acRate": 53.73729669952524, "difficulty": "Medium", "likes": 1951, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 140918, "totalSubmissionRaw": 262235}, "940": {"acRate": 43.09896118097321, "difficulty": "Hard", "likes": 1694, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "940", "paidOnly": false, "title": "Distinct Subsequences II", "titleSlug": "distinct-subsequences-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39414, "totalSubmissionRaw": 91450}, "941": {"acRate": 33.43914576496713, "difficulty": "Easy", "likes": 2915, "dislikes": 180, "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": 424204, "totalSubmissionRaw": 1268593}, "942": {"acRate": 78.68124996848353, "difficulty": "Easy", "likes": 2440, "dislikes": 1003, "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": 156032, "totalSubmissionRaw": 198309}, "943": {"acRate": 43.87549134176139, "difficulty": "Hard", "likes": 1431, "dislikes": 146, "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": 28910, "totalSubmissionRaw": 65891}, "944": {"acRate": 74.6111150531785, "difficulty": "Easy", "likes": 1694, "dislikes": 2873, "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": 189269, "totalSubmissionRaw": 253674}, "945": {"acRate": 52.48919357619792, "difficulty": "Medium", "likes": 1793, "dislikes": 57, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 88280, "totalSubmissionRaw": 168187}, "946": {"acRate": 69.47213102827367, "difficulty": "Medium", "likes": 5880, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "946", "paidOnly": false, "title": "Validate Stack Sequences", "titleSlug": "validate-stack-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 305566, "totalSubmissionRaw": 439841}, "947": {"acRate": 58.88624357258576, "difficulty": "Medium", "likes": 5308, "dislikes": 643, "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": 209002, "totalSubmissionRaw": 354925}, "948": {"acRate": 58.964448903420994, "difficulty": "Medium", "likes": 3224, "dislikes": 529, "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": 226860, "totalSubmissionRaw": 384740}, "949": {"acRate": 35.18960938163209, "difficulty": "Medium", "likes": 707, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87051, "totalSubmissionRaw": 247377}, "950": {"acRate": 82.88649450544739, "difficulty": "Medium", "likes": 3417, "dislikes": 638, "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": 193316, "totalSubmissionRaw": 233230}, "951": {"acRate": 66.94701582880496, "difficulty": "Medium", "likes": 2279, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "951", "paidOnly": false, "title": "Flip Equivalent Binary Trees", "titleSlug": "flip-equivalent-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147100, "totalSubmissionRaw": 219726}, "952": {"acRate": 40.69106184222498, "difficulty": "Hard", "likes": 1606, "dislikes": 92, "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": 53665, "totalSubmissionRaw": 131884}, "953": {"acRate": 55.01865681774978, "difficulty": "Easy", "likes": 4858, "dislikes": 1627, "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": 506485, "totalSubmissionRaw": 920572}, "954": {"acRate": 39.16339811018007, "difficulty": "Medium", "likes": 1516, "dislikes": 153, "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": 87867, "totalSubmissionRaw": 224360}, "955": {"acRate": 35.197603330256214, "difficulty": "Medium", "likes": 654, "dislikes": 86, "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": 20208, "totalSubmissionRaw": 57413}, "956": {"acRate": 52.27329391651232, "difficulty": "Hard", "likes": 2336, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "956", "paidOnly": false, "title": "Tallest Billboard", "titleSlug": "tallest-billboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58705, "totalSubmissionRaw": 112304}, "957": {"acRate": 38.952142405525024, "difficulty": "Medium", "likes": 1481, "dislikes": 1736, "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": 160179, "totalSubmissionRaw": 411220}, "958": {"acRate": 56.92106656562566, "difficulty": "Medium", "likes": 4241, "dislikes": 59, "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": 234351, "totalSubmissionRaw": 411712}, "959": {"acRate": 69.39507074642209, "difficulty": "Medium", "likes": 3060, "dislikes": 580, "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": 51301, "totalSubmissionRaw": 73926}, "960": {"acRate": 57.98463877110169, "difficulty": "Hard", "likes": 595, "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": 14495, "totalSubmissionRaw": 24998}, "961": {"acRate": 76.72939030288472, "difficulty": "Easy", "likes": 1339, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "961", "paidOnly": false, "title": "N-Repeated Element in Size 2N Array", "titleSlug": "n-repeated-element-in-size-2n-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236381, "totalSubmissionRaw": 308071}, "962": {"acRate": 50.04383509553938, "difficulty": "Medium", "likes": 1669, "dislikes": 50, "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": 47378, "totalSubmissionRaw": 94673}, "963": {"acRate": 54.81403897079167, "difficulty": "Medium", "likes": 373, "dislikes": 456, "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": 27737, "totalSubmissionRaw": 50602}, "964": {"acRate": 48.514657661625805, "difficulty": "Hard", "likes": 316, "dislikes": 69, "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": 9913, "totalSubmissionRaw": 20433}, "965": {"acRate": 70.929937696004, "difficulty": "Easy", "likes": 1879, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "965", "paidOnly": false, "title": "Univalued Binary Tree", "titleSlug": "univalued-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220973, "totalSubmissionRaw": 311537}, "966": {"acRate": 51.37217140105922, "difficulty": "Medium", "likes": 420, "dislikes": 806, "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": 41613, "totalSubmissionRaw": 81003}, "967": {"acRate": 58.052099890965934, "difficulty": "Medium", "likes": 2797, "dislikes": 195, "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": 132573, "totalSubmissionRaw": 228369}, "968": {"acRate": 46.72667020413884, "difficulty": "Hard", "likes": 5299, "dislikes": 75, "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": 140015, "totalSubmissionRaw": 299648}, "969": {"acRate": 70.70635819932313, "difficulty": "Medium", "likes": 1474, "dislikes": 1526, "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": 94223, "totalSubmissionRaw": 133260}, "970": {"acRate": 43.82505925207184, "difficulty": "Medium", "likes": 387, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55103, "totalSubmissionRaw": 125734}, "971": {"acRate": 50.499515440111985, "difficulty": "Medium", "likes": 941, "dislikes": 272, "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": 42208, "totalSubmissionRaw": 83581}, "972": {"acRate": 43.902147971360385, "difficulty": "Hard", "likes": 94, "dislikes": 216, "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": 7358, "totalSubmissionRaw": 16760}, "973": {"acRate": 66.44195531907397, "difficulty": "Medium", "likes": 8331, "dislikes": 305, "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": 1206755, "totalSubmissionRaw": 1816255}, "974": {"acRate": 53.9539015887762, "difficulty": "Medium", "likes": 6571, "dislikes": 279, "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": 239276, "totalSubmissionRaw": 443484}, "975": {"acRate": 39.92992199483093, "difficulty": "Hard", "likes": 1969, "dislikes": 501, "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": 85126, "totalSubmissionRaw": 213190}, "976": {"acRate": 56.027438881877245, "difficulty": "Easy", "likes": 2962, "dislikes": 406, "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": 239719, "totalSubmissionRaw": 427860}, "977": {"acRate": 72.82940665747365, "difficulty": "Easy", "likes": 9254, "dislikes": 237, "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": 1853804, "totalSubmissionRaw": 2545402}, "978": {"acRate": 47.39253393665158, "difficulty": "Medium", "likes": 1954, "dislikes": 232, "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": 100548, "totalSubmissionRaw": 212160}, "979": {"acRate": 76.99544330372409, "difficulty": "Medium", "likes": 5743, "dislikes": 230, "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": 193642, "totalSubmissionRaw": 251498}, "980": {"acRate": 81.75131817683662, "difficulty": "Hard", "likes": 5102, "dislikes": 188, "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": 201404, "totalSubmissionRaw": 246362}, "981": {"acRate": 49.36023134337499, "difficulty": "Medium", "likes": 4741, "dislikes": 557, "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": 443283, "totalSubmissionRaw": 898055}, "982": {"acRate": 58.0882593477052, "difficulty": "Hard", "likes": 431, "dislikes": 217, "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": 17757, "totalSubmissionRaw": 30569}, "983": {"acRate": 65.27675838241349, "difficulty": "Medium", "likes": 7805, "dislikes": 146, "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": 291713, "totalSubmissionRaw": 446887}, "984": {"acRate": 43.89160742313729, "difficulty": "Medium", "likes": 799, "dislikes": 367, "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": 47539, "totalSubmissionRaw": 108309}, "985": {"acRate": 68.11569382532406, "difficulty": "Medium", "likes": 2070, "dislikes": 317, "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": 139206, "totalSubmissionRaw": 204367}, "986": {"acRate": 71.69506226487285, "difficulty": "Medium", "likes": 5521, "dislikes": 111, "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": 414120, "totalSubmissionRaw": 577613}, "987": {"acRate": 47.7090980961708, "difficulty": "Hard", "likes": 7465, "dislikes": 4315, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 429665, "totalSubmissionRaw": 900600}, "988": {"acRate": 60.46824784676693, "difficulty": "Medium", "likes": 2257, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188153, "totalSubmissionRaw": 311160}, "989": {"acRate": 45.30580850837978, "difficulty": "Easy", "likes": 3415, "dislikes": 286, "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": 260353, "totalSubmissionRaw": 574657}, "990": {"acRate": 50.50566391210815, "difficulty": "Medium", "likes": 3709, "dislikes": 59, "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": 127247, "totalSubmissionRaw": 251946}, "991": {"acRate": 54.429190712438654, "difficulty": "Medium", "likes": 2678, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100823, "totalSubmissionRaw": 185237}, "992": {"acRate": 63.250099909711224, "difficulty": "Hard", "likes": 5929, "dislikes": 95, "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": 213661, "totalSubmissionRaw": 337804}, "993": {"acRate": 56.16410568487245, "difficulty": "Easy", "likes": 3981, "dislikes": 201, "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": 276875, "totalSubmissionRaw": 492975}, "994": {"acRate": 54.16737736154131, "difficulty": "Medium", "likes": 12646, "dislikes": 398, "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": 854268, "totalSubmissionRaw": 1577091}, "995": {"acRate": 51.630650059416396, "difficulty": "Hard", "likes": 1210, "dislikes": 59, "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": 35193, "totalSubmissionRaw": 68163}, "996": {"acRate": 50.12881338638915, "difficulty": "Hard", "likes": 982, "dislikes": 43, "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": 39303, "totalSubmissionRaw": 78406}, "997": {"acRate": 49.79380265479611, "difficulty": "Easy", "likes": 6576, "dislikes": 586, "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": 588380, "totalSubmissionRaw": 1181632}, "998": {"acRate": 69.1241674504309, "difficulty": "Medium", "likes": 524, "dislikes": 782, "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": 36013, "totalSubmissionRaw": 52099}, "999": {"acRate": 69.01831562753374, "difficulty": "Easy", "likes": 657, "dislikes": 630, "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": 66397, "totalSubmissionRaw": 96202}, "1000": {"acRate": 43.059090859433894, "difficulty": "Hard", "likes": 2447, "dislikes": 108, "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": 39415, "totalSubmissionRaw": 91537}, "1001": {"acRate": 36.75913803474753, "difficulty": "Hard", "likes": 605, "dislikes": 152, "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": 20777, "totalSubmissionRaw": 56522}, "1002": {"acRate": 68.9893801668831, "difficulty": "Easy", "likes": 3501, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214392, "totalSubmissionRaw": 310830}, "1003": {"acRate": 59.6080747649306, "difficulty": "Medium", "likes": 978, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "1003", "paidOnly": false, "title": "Check If Word Is Valid After Substitutions", "titleSlug": "check-if-word-is-valid-after-substitutions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62570, "totalSubmissionRaw": 104969}, "1004": {"acRate": 63.158094759887184, "difficulty": "Medium", "likes": 8416, "dislikes": 125, "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": 548401, "totalSubmissionRaw": 868304}, "1005": {"acRate": 51.167616592029674, "difficulty": "Easy", "likes": 1533, "dislikes": 113, "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": 90493, "totalSubmissionRaw": 176856}, "1006": {"acRate": 57.19820067933535, "difficulty": "Medium", "likes": 367, "dislikes": 353, "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": 31153, "totalSubmissionRaw": 54465}, "1007": {"acRate": 52.228701845107594, "difficulty": "Medium", "likes": 2823, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1007", "paidOnly": false, "title": "Minimum Domino Rotations For Equal Row", "titleSlug": "minimum-domino-rotations-for-equal-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203213, "totalSubmissionRaw": 389083}, "1008": {"acRate": 82.00259960440802, "difficulty": "Medium", "likes": 6062, "dislikes": 81, "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": 362758, "totalSubmissionRaw": 442374}, "1009": {"acRate": 60.787925365048565, "difficulty": "Easy", "likes": 2388, "dislikes": 111, "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": 241246, "totalSubmissionRaw": 396865}, "1010": {"acRate": 52.88209150529225, "difficulty": "Medium", "likes": 4181, "dislikes": 170, "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": 273191, "totalSubmissionRaw": 516604}, "1011": {"acRate": 69.58464521665765, "difficulty": "Medium", "likes": 9356, "dislikes": 218, "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": 384331, "totalSubmissionRaw": 552322}, "1012": {"acRate": 42.11957877925837, "difficulty": "Hard", "likes": 768, "dislikes": 86, "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": 16879, "totalSubmissionRaw": 40074}, "1013": {"acRate": 41.96902874356269, "difficulty": "Easy", "likes": 1695, "dislikes": 154, "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": 93068, "totalSubmissionRaw": 221754}, "1014": {"acRate": 59.13503462426263, "difficulty": "Medium", "likes": 2479, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92227, "totalSubmissionRaw": 155960}, "1015": {"acRate": 46.590284687467516, "difficulty": "Medium", "likes": 1133, "dislikes": 852, "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": 62745, "totalSubmissionRaw": 134674}, "1016": {"acRate": 57.36809359777841, "difficulty": "Medium", "likes": 348, "dislikes": 531, "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": 37805, "totalSubmissionRaw": 65899}, "1017": {"acRate": 60.693980687663576, "difficulty": "Medium", "likes": 511, "dislikes": 288, "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": 26902, "totalSubmissionRaw": 44324}, "1018": {"acRate": 46.71865505367632, "difficulty": "Easy", "likes": 724, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55356, "totalSubmissionRaw": 118488}, "1019": {"acRate": 60.846626480336475, "difficulty": "Medium", "likes": 3268, "dislikes": 119, "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": 156963, "totalSubmissionRaw": 257965}, "1020": {"acRate": 68.81207366878905, "difficulty": "Medium", "likes": 3972, "dislikes": 76, "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": 221226, "totalSubmissionRaw": 321493}, "1021": {"acRate": 82.76668620173211, "difficulty": "Easy", "likes": 2874, "dislikes": 1582, "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": 317762, "totalSubmissionRaw": 383925}, "1022": {"acRate": 73.07619189171439, "difficulty": "Easy", "likes": 3330, "dislikes": 185, "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": 211416, "totalSubmissionRaw": 289309}, "1023": {"acRate": 62.27800963081862, "difficulty": "Medium", "likes": 889, "dislikes": 328, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48499, "totalSubmissionRaw": 77875}, "1024": {"acRate": 51.37420089455157, "difficulty": "Medium", "likes": 1746, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1024", "paidOnly": false, "title": "Video Stitching", "titleSlug": "video-stitching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69031, "totalSubmissionRaw": 134369}, "1025": {"acRate": 68.81327574594555, "difficulty": "Easy", "likes": 2159, "dislikes": 4122, "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": 257468, "totalSubmissionRaw": 374155}, "1026": {"acRate": 78.09421049090193, "difficulty": "Medium", "likes": 4903, "dislikes": 164, "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": 324975, "totalSubmissionRaw": 416132}, "1027": {"acRate": 49.10646746023042, "difficulty": "Medium", "likes": 4633, "dislikes": 208, "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": 174628, "totalSubmissionRaw": 355610}, "1028": {"acRate": 74.643775327901, "difficulty": "Hard", "likes": 1620, "dislikes": 43, "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": 51390, "totalSubmissionRaw": 68847}, "1029": {"acRate": 66.72436459246275, "difficulty": "Medium", "likes": 4690, "dislikes": 350, "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": 243624, "totalSubmissionRaw": 365120}, "1030": {"acRate": 71.15614681533235, "difficulty": "Easy", "likes": 753, "dislikes": 322, "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": 59478, "totalSubmissionRaw": 83588}, "1031": {"acRate": 59.737166601915504, "difficulty": "Medium", "likes": 2536, "dislikes": 83, "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": 70730, "totalSubmissionRaw": 118402}, "1032": {"acRate": 52.009341984181525, "difficulty": "Hard", "likes": 1800, "dislikes": 183, "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": 89299, "totalSubmissionRaw": 171698}, "1033": {"acRate": 47.990103946914196, "difficulty": "Medium", "likes": 217, "dislikes": 647, "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": 25023, "totalSubmissionRaw": 52142}, "1034": {"acRate": 49.00405600622291, "difficulty": "Medium", "likes": 723, "dislikes": 880, "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": 35279, "totalSubmissionRaw": 71992}, "1035": {"acRate": 63.09472833285977, "difficulty": "Medium", "likes": 3792, "dislikes": 57, "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": 157663, "totalSubmissionRaw": 249883}, "1036": {"acRate": 34.762240903548744, "difficulty": "Hard", "likes": 663, "dislikes": 167, "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": 21668, "totalSubmissionRaw": 62332}, "1037": {"acRate": 36.9996044862559, "difficulty": "Easy", "likes": 412, "dislikes": 524, "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": 52387, "totalSubmissionRaw": 141588}, "1038": {"acRate": 85.85926960763133, "difficulty": "Medium", "likes": 3734, "dislikes": 154, "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": 178844, "totalSubmissionRaw": 208299}, "1039": {"acRate": 58.94964011715461, "difficulty": "Medium", "likes": 1804, "dislikes": 174, "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": 49714, "totalSubmissionRaw": 84333}, "1040": {"acRate": 56.63736385249074, "difficulty": "Medium", "likes": 365, "dislikes": 629, "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": 10244, "totalSubmissionRaw": 18087}, "1041": {"acRate": 55.6951679731641, "difficulty": "Medium", "likes": 3708, "dislikes": 698, "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": 235101, "totalSubmissionRaw": 422121}, "1042": {"acRate": 51.266160289259425, "difficulty": "Medium", "likes": 1422, "dislikes": 714, "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": 78833, "totalSubmissionRaw": 153772}, "1043": {"acRate": 76.49369554074833, "difficulty": "Medium", "likes": 4634, "dislikes": 410, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186548, "totalSubmissionRaw": 243874}, "1044": {"acRate": 30.54743205654253, "difficulty": "Hard", "likes": 2214, "dislikes": 384, "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": 68418, "totalSubmissionRaw": 223973}, "1045": {"acRate": 61.74624950541913, "difficulty": "Medium", "likes": 690, "dislikes": 64, "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": 166978, "totalSubmissionRaw": 270427}, "1046": {"acRate": 65.40554534119487, "difficulty": "Easy", "likes": 5959, "dislikes": 117, "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": 618981, "totalSubmissionRaw": 946375}, "1047": {"acRate": 69.60845162295305, "difficulty": "Easy", "likes": 6541, "dislikes": 253, "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": 571979, "totalSubmissionRaw": 821707}, "1048": {"acRate": 61.087613293051355, "difficulty": "Medium", "likes": 7223, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 406422, "totalSubmissionRaw": 665310}, "1049": {"acRate": 55.44095155031411, "difficulty": "Medium", "likes": 3075, "dislikes": 116, "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": 87721, "totalSubmissionRaw": 158225}, "1050": {"acRate": 69.96794024977424, "difficulty": "Easy", "likes": 643, "dislikes": 49, "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": 177429, "totalSubmissionRaw": 253586}, "1051": {"acRate": 76.59592407282086, "difficulty": "Easy", "likes": 1150, "dislikes": 86, "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": 345213, "totalSubmissionRaw": 450694}, "1052": {"acRate": 57.09524244361246, "difficulty": "Medium", "likes": 1715, "dislikes": 134, "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": 75029, "totalSubmissionRaw": 131411}, "1053": {"acRate": 49.71334163512397, "difficulty": "Medium", "likes": 440, "dislikes": 40, "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": 40321, "totalSubmissionRaw": 81107}, "1054": {"acRate": 46.501167719055445, "difficulty": "Medium", "likes": 1258, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43008, "totalSubmissionRaw": 92488}, "1055": {"acRate": 60.22213274276894, "difficulty": "Medium", "likes": 1265, "dislikes": 65, "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": 89735, "totalSubmissionRaw": 149006}, "1056": {"acRate": 48.70897295908536, "difficulty": "Easy", "likes": 312, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45501, "totalSubmissionRaw": 93414}, "1057": {"acRate": 58.61341790361604, "difficulty": "Medium", "likes": 978, "dislikes": 194, "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": 71710, "totalSubmissionRaw": 122344}, "1058": {"acRate": 45.08188682945964, "difficulty": "Medium", "likes": 148, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1058", "paidOnly": true, "title": "Minimize Rounding Error to Meet Target", "titleSlug": "minimize-rounding-error-to-meet-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9194, "totalSubmissionRaw": 20394}, "1059": {"acRate": 37.65881628617093, "difficulty": "Medium", "likes": 704, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 60555, "totalSubmissionRaw": 160799}, "1060": {"acRate": 56.91901068148011, "difficulty": "Medium", "likes": 1648, "dislikes": 61, "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": 135457, "totalSubmissionRaw": 237982}, "1061": {"acRate": 76.53283265934913, "difficulty": "Medium", "likes": 2331, "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": 79487, "totalSubmissionRaw": 103860}, "1062": {"acRate": 60.74513721572545, "difficulty": "Medium", "likes": 663, "dislikes": 63, "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": 41347, "totalSubmissionRaw": 68067}, "1063": {"acRate": 78.91176130449867, "difficulty": "Hard", "likes": 305, "dislikes": 16, "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": 13647, "totalSubmissionRaw": 17294}, "1064": {"acRate": 64.12841100832024, "difficulty": "Easy", "likes": 436, "dislikes": 66, "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": 44087, "totalSubmissionRaw": 68748}, "1065": {"acRate": 67.384712417825, "difficulty": "Easy", "likes": 375, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27778, "totalSubmissionRaw": 41223}, "1066": {"acRate": 55.1812270163595, "difficulty": "Medium", "likes": 932, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51169, "totalSubmissionRaw": 92729}, "1067": {"acRate": 46.268488201422606, "difficulty": "Hard", "likes": 94, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1067", "paidOnly": true, "title": "Digit Count in Range", "titleSlug": "digit-count-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4098, "totalSubmissionRaw": 8857}, "1068": {"acRate": 82.01941683099461, "difficulty": "Easy", "likes": 810, "dislikes": 213, "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": 444621, "totalSubmissionRaw": 542095}, "1069": {"acRate": 81.74673152934022, "difficulty": "Easy", "likes": 79, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53773, "totalSubmissionRaw": 65780}, "1070": {"acRate": 42.30982868502602, "difficulty": "Medium", "likes": 384, "dislikes": 859, "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": 144725, "totalSubmissionRaw": 342059}, "1071": {"acRate": 51.35357359466997, "difficulty": "Easy", "likes": 5023, "dislikes": 1296, "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": 454677, "totalSubmissionRaw": 885372}, "1072": {"acRate": 63.944473986174465, "difficulty": "Medium", "likes": 733, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22848, "totalSubmissionRaw": 35731}, "1073": {"acRate": 36.81185099719795, "difficulty": "Medium", "likes": 316, "dislikes": 125, "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": 17867, "totalSubmissionRaw": 48536}, "1074": {"acRate": 74.42991126286495, "difficulty": "Hard", "likes": 3682, "dislikes": 102, "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": 153243, "totalSubmissionRaw": 205889}, "1075": {"acRate": 61.247116661303366, "difficulty": "Easy", "likes": 546, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226488, "totalSubmissionRaw": 369792}, "1076": {"acRate": 49.91207758065359, "difficulty": "Easy", "likes": 203, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1076", "paidOnly": true, "title": "Project Employees II", "titleSlug": "project-employees-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57336, "totalSubmissionRaw": 114874}, "1077": {"acRate": 76.51460294472604, "difficulty": "Medium", "likes": 266, "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": 57059, "totalSubmissionRaw": 74573}, "1078": {"acRate": 63.46838727654276, "difficulty": "Easy", "likes": 482, "dislikes": 359, "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": 72889, "totalSubmissionRaw": 114843}, "1079": {"acRate": 76.27022273437146, "difficulty": "Medium", "likes": 2475, "dislikes": 68, "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": 100605, "totalSubmissionRaw": 131906}, "1080": {"acRate": 55.52370256531505, "difficulty": "Medium", "likes": 688, "dislikes": 707, "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": 37574, "totalSubmissionRaw": 67672}, "1081": {"acRate": 60.86217674975566, "difficulty": "Medium", "likes": 2585, "dislikes": 190, "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": 69123, "totalSubmissionRaw": 113573}, "1082": {"acRate": 74.26012609252706, "difficulty": "Easy", "likes": 194, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "1082", "paidOnly": true, "title": "Sales Analysis I", "titleSlug": "sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58539, "totalSubmissionRaw": 78830}, "1083": {"acRate": 49.671671791028245, "difficulty": "Easy", "likes": 270, "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": 58321, "totalSubmissionRaw": 117413}, "1084": {"acRate": 46.554679939167706, "difficulty": "Easy", "likes": 720, "dislikes": 148, "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": 134692, "totalSubmissionRaw": 289320}, "1085": {"acRate": 76.40431558511823, "difficulty": "Easy", "likes": 117, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "1085", "paidOnly": true, "title": "Sum of Digits in the Minimum Number", "titleSlug": "sum-of-digits-in-the-minimum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24007, "totalSubmissionRaw": 31421}, "1086": {"acRate": 74.54161863540466, "difficulty": "Easy", "likes": 793, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102815, "totalSubmissionRaw": 137925}, "1087": {"acRate": 66.38569052848057, "difficulty": "Medium", "likes": 639, "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": 52294, "totalSubmissionRaw": 78773}, "1088": {"acRate": 47.1956328551479, "difficulty": "Hard", "likes": 492, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37176, "totalSubmissionRaw": 78770}, "1089": {"acRate": 51.93622681919061, "difficulty": "Easy", "likes": 2582, "dislikes": 736, "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": 421463, "totalSubmissionRaw": 811501}, "1090": {"acRate": 62.058091017886596, "difficulty": "Medium", "likes": 441, "dislikes": 627, "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": 38373, "totalSubmissionRaw": 61834}, "1091": {"acRate": 47.432401146166264, "difficulty": "Medium", "likes": 6418, "dislikes": 237, "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": 473258, "totalSubmissionRaw": 997752}, "1092": {"acRate": 59.067597627286204, "difficulty": "Hard", "likes": 4788, "dislikes": 66, "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": 114714, "totalSubmissionRaw": 194208}, "1093": {"acRate": 42.02332150973854, "difficulty": "Medium", "likes": 150, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19785, "totalSubmissionRaw": 47081}, "1094": {"acRate": 56.05891361593943, "difficulty": "Medium", "likes": 4424, "dislikes": 96, "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": 221824, "totalSubmissionRaw": 395698}, "1095": {"acRate": 40.37004860955746, "difficulty": "Hard", "likes": 3202, "dislikes": 130, "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": 138942, "totalSubmissionRaw": 344171}, "1096": {"acRate": 63.676761449744426, "difficulty": "Hard", "likes": 480, "dislikes": 287, "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": 24790, "totalSubmissionRaw": 38931}, "1097": {"acRate": 51.130412011173185, "difficulty": "Hard", "likes": 183, "dislikes": 32, "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": 23430, "totalSubmissionRaw": 45824}, "1098": {"acRate": 43.079793774403, "difficulty": "Medium", "likes": 202, "dislikes": 602, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39941, "totalSubmissionRaw": 92714}, "1099": {"acRate": 61.816783558136436, "difficulty": "Easy", "likes": 1134, "dislikes": 130, "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": 134237, "totalSubmissionRaw": 217153}, "1100": {"acRate": 74.66988727858293, "difficulty": "Medium", "likes": 569, "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": 41733, "totalSubmissionRaw": 55890}, "1101": {"acRate": 64.6001919193366, "difficulty": "Medium", "likes": 985, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90209, "totalSubmissionRaw": 139642}, "1102": {"acRate": 53.67512133216717, "difficulty": "Medium", "likes": 1288, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1102", "paidOnly": true, "title": "Path With Maximum Minimum Value", "titleSlug": "path-with-maximum-minimum-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62597, "totalSubmissionRaw": 116622}, "1103": {"acRate": 65.21839319695528, "difficulty": "Easy", "likes": 973, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87737, "totalSubmissionRaw": 134528}, "1104": {"acRate": 75.36931062017567, "difficulty": "Medium", "likes": 1485, "dislikes": 314, "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": 45306, "totalSubmissionRaw": 60112}, "1105": {"acRate": 59.51698096493073, "difficulty": "Medium", "likes": 1821, "dislikes": 130, "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": 53748, "totalSubmissionRaw": 90307}, "1106": {"acRate": 59.125883685505606, "difficulty": "Hard", "likes": 1152, "dislikes": 61, "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": 30276, "totalSubmissionRaw": 51206}, "1107": {"acRate": 44.59301166384209, "difficulty": "Medium", "likes": 149, "dislikes": 164, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35784, "totalSubmissionRaw": 80247}, "1108": {"acRate": 89.09131395207463, "difficulty": "Easy", "likes": 2081, "dislikes": 1752, "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": 652160, "totalSubmissionRaw": 732013}, "1109": {"acRate": 61.790828173374614, "difficulty": "Medium", "likes": 1612, "dislikes": 159, "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": 63867, "totalSubmissionRaw": 103360}, "1110": {"acRate": 69.15716864044305, "difficulty": "Medium", "likes": 3898, "dislikes": 112, "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": 223776, "totalSubmissionRaw": 323576}, "1111": {"acRate": 71.96450395876508, "difficulty": "Medium", "likes": 433, "dislikes": 1743, "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": 27086, "totalSubmissionRaw": 37638}, "1112": {"acRate": 70.82710978342047, "difficulty": "Medium", "likes": 296, "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": 60696, "totalSubmissionRaw": 85696}, "1113": {"acRate": 64.8585857180618, "difficulty": "Easy", "likes": 108, "dislikes": 399, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46621, "totalSubmissionRaw": 71881}, "1114": {"acRate": 69.40756885278383, "difficulty": "Easy", "likes": 1453, "dislikes": 203, "categoryTitle": "Concurrency", "frontendQuestionId": "1114", "paidOnly": false, "title": "Print in Order", "titleSlug": "print-in-order", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157633, "totalSubmissionRaw": 227113}, "1115": {"acRate": 65.8732655822295, "difficulty": "Medium", "likes": 677, "dislikes": 54, "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": 83746, "totalSubmissionRaw": 127132}, "1116": {"acRate": 60.94835214118617, "difficulty": "Medium", "likes": 484, "dislikes": 331, "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": 50283, "totalSubmissionRaw": 82501}, "1117": {"acRate": 56.18151825997663, "difficulty": "Medium", "likes": 508, "dislikes": 153, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51427, "totalSubmissionRaw": 91538}, "1118": {"acRate": 58.22750051486236, "difficulty": "Easy", "likes": 42, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "1118", "paidOnly": true, "title": "Number of Days in a Month", "titleSlug": "number-of-days-in-a-month", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8482, "totalSubmissionRaw": 14567}, "1119": {"acRate": 91.12023440991938, "difficulty": "Easy", "likes": 359, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110086, "totalSubmissionRaw": 120814}, "1120": {"acRate": 66.59289683498429, "difficulty": "Medium", "likes": 834, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1120", "paidOnly": true, "title": "Maximum Average Subtree", "titleSlug": "maximum-average-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68907, "totalSubmissionRaw": 103475}, "1121": {"acRate": 61.379222758445515, "difficulty": "Hard", "likes": 122, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4833, "totalSubmissionRaw": 7874}, "1122": {"acRate": 69.09571441681197, "difficulty": "Easy", "likes": 2530, "dislikes": 145, "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": 188234, "totalSubmissionRaw": 272425}, "1123": {"acRate": 72.30468144473726, "difficulty": "Medium", "likes": 1954, "dislikes": 841, "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": 111945, "totalSubmissionRaw": 154824}, "1124": {"acRate": 34.949129010564675, "difficulty": "Medium", "likes": 1414, "dislikes": 113, "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": 32221, "totalSubmissionRaw": 92194}, "1125": {"acRate": 55.57836003234089, "difficulty": "Hard", "likes": 2162, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1125", "paidOnly": false, "title": "Smallest Sufficient Team", "titleSlug": "smallest-sufficient-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62554, "totalSubmissionRaw": 112551}, "1126": {"acRate": 65.65601929683503, "difficulty": "Medium", "likes": 268, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44912, "totalSubmissionRaw": 68405}, "1127": {"acRate": 47.47644170656582, "difficulty": "Hard", "likes": 180, "dislikes": 132, "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": 15567, "totalSubmissionRaw": 32790}, "1128": {"acRate": 48.176365699465066, "difficulty": "Easy", "likes": 676, "dislikes": 332, "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": 68356, "totalSubmissionRaw": 141887}, "1129": {"acRate": 47.09445074351717, "difficulty": "Medium", "likes": 3469, "dislikes": 183, "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": 115469, "totalSubmissionRaw": 245183}, "1130": {"acRate": 67.77055077935313, "difficulty": "Medium", "likes": 4249, "dislikes": 273, "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": 99088, "totalSubmissionRaw": 146211}, "1131": {"acRate": 48.35804657909582, "difficulty": "Medium", "likes": 642, "dislikes": 404, "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": 24003, "totalSubmissionRaw": 49636}, "1132": {"acRate": 32.296167006532336, "difficulty": "Medium", "likes": 151, "dislikes": 563, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37377, "totalSubmissionRaw": 115732}, "1133": {"acRate": 69.0054124943041, "difficulty": "Easy", "likes": 316, "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": 62089, "totalSubmissionRaw": 89977}, "1134": {"acRate": 77.80941251460746, "difficulty": "Easy", "likes": 206, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36621, "totalSubmissionRaw": 47065}, "1135": {"acRate": 62.011529457175705, "difficulty": "Medium", "likes": 1112, "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": 73901, "totalSubmissionRaw": 119173}, "1136": {"acRate": 61.4052111410602, "difficulty": "Medium", "likes": 1148, "dislikes": 26, "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": 85430, "totalSubmissionRaw": 139125}, "1137": {"acRate": 63.83279866472422, "difficulty": "Easy", "likes": 4412, "dislikes": 190, "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": 769850, "totalSubmissionRaw": 1206036}, "1138": {"acRate": 51.63560327321712, "difficulty": "Medium", "likes": 894, "dislikes": 178, "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": 51363, "totalSubmissionRaw": 99473}, "1139": {"acRate": 50.150138127076914, "difficulty": "Medium", "likes": 703, "dislikes": 110, "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": 25052, "totalSubmissionRaw": 49954}, "1140": {"acRate": 67.48573183711079, "difficulty": "Medium", "likes": 2817, "dislikes": 622, "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": 94478, "totalSubmissionRaw": 139997}, "1141": {"acRate": 48.31343503081674, "difficulty": "Easy", "likes": 623, "dislikes": 776, "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": 216822, "totalSubmissionRaw": 448782}, "1142": {"acRate": 35.73251745296574, "difficulty": "Easy", "likes": 99, "dislikes": 366, "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": 42278, "totalSubmissionRaw": 118318}, "1143": {"acRate": 57.77825361619442, "difficulty": "Medium", "likes": 13371, "dislikes": 193, "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": 1084716, "totalSubmissionRaw": 1877375}, "1144": {"acRate": 47.79986388491235, "difficulty": "Medium", "likes": 426, "dislikes": 167, "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": 20368, "totalSubmissionRaw": 42611}, "1145": {"acRate": 51.9374551910143, "difficulty": "Medium", "likes": 1338, "dislikes": 210, "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": 45639, "totalSubmissionRaw": 87873}, "1146": {"acRate": 36.973875366816145, "difficulty": "Medium", "likes": 3681, "dislikes": 495, "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": 217091, "totalSubmissionRaw": 587147}, "1147": {"acRate": 58.724015383866416, "difficulty": "Hard", "likes": 658, "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": 24125, "totalSubmissionRaw": 41082}, "1148": {"acRate": 75.3660970613593, "difficulty": "Easy", "likes": 1356, "dislikes": 76, "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": 588306, "totalSubmissionRaw": 780598}, "1149": {"acRate": 47.00240415032266, "difficulty": "Medium", "likes": 128, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37146, "totalSubmissionRaw": 79030}, "1150": {"acRate": 58.851703215326545, "difficulty": "Easy", "likes": 454, "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": 49273, "totalSubmissionRaw": 83724}, "1151": {"acRate": 60.2199391736518, "difficulty": "Medium", "likes": 1186, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1151", "paidOnly": true, "title": "Minimum Swaps to Group All 1's Together", "titleSlug": "minimum-swaps-to-group-all-1s-together", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 64946, "totalSubmissionRaw": 107848}, "1152": {"acRate": 42.701329163408914, "difficulty": "Medium", "likes": 488, "dislikes": 3687, "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": 98307, "totalSubmissionRaw": 230220}, "1153": {"acRate": 34.976286125031905, "difficulty": "Hard", "likes": 876, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "1153", "paidOnly": true, "title": "String Transforms Into Another String", "titleSlug": "string-transforms-into-another-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52065, "totalSubmissionRaw": 148858}, "1154": {"acRate": 48.69006345260679, "difficulty": "Easy", "likes": 448, "dislikes": 475, "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": 59546, "totalSubmissionRaw": 122296}, "1155": {"acRate": 60.86411916907238, "difficulty": "Medium", "likes": 5013, "dislikes": 168, "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": 288628, "totalSubmissionRaw": 474217}, "1156": {"acRate": 44.02903560318009, "difficulty": "Medium", "likes": 1009, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1156", "paidOnly": false, "title": "Swap For Longest Repeated Character Substring", "titleSlug": "swap-for-longest-repeated-character-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31844, "totalSubmissionRaw": 72325}, "1157": {"acRate": 41.53267020666617, "difficulty": "Hard", "likes": 623, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1157", "paidOnly": false, "title": "Online Majority Element In Subarray", "titleSlug": "online-majority-element-in-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16660, "totalSubmissionRaw": 40113}, "1158": {"acRate": 57.04629306959173, "difficulty": "Medium", "likes": 634, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1158", "paidOnly": false, "title": "Market Analysis I", "titleSlug": "market-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103130, "totalSubmissionRaw": 180783}, "1159": {"acRate": 57.07238833071057, "difficulty": "Hard", "likes": 120, "dislikes": 79, "categoryTitle": "Database", "frontendQuestionId": "1159", "paidOnly": true, "title": "Market Analysis II", "titleSlug": "market-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18859, "totalSubmissionRaw": 33044}, "1160": {"acRate": 70.63436970008793, "difficulty": "Easy", "likes": 2096, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259469, "totalSubmissionRaw": 367341}, "1161": {"acRate": 67.10708798537397, "difficulty": "Medium", "likes": 3499, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1161", "paidOnly": false, "title": "Maximum Level Sum of a Binary Tree", "titleSlug": "maximum-level-sum-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278228, "totalSubmissionRaw": 414603}, "1162": {"acRate": 51.58017895396746, "difficulty": "Medium", "likes": 4109, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1162", "paidOnly": false, "title": "As Far from Land as Possible", "titleSlug": "as-far-from-land-as-possible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153858, "totalSubmissionRaw": 298289}, "1163": {"acRate": 34.55881616756275, "difficulty": "Hard", "likes": 590, "dislikes": 448, "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": 34517, "totalSubmissionRaw": 99879}, "1164": {"acRate": 55.46456895995874, "difficulty": "Medium", "likes": 836, "dislikes": 224, "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": 120424, "totalSubmissionRaw": 217120}, "1165": {"acRate": 87.51535626535627, "difficulty": "Easy", "likes": 526, "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": 85484, "totalSubmissionRaw": 97679}, "1166": {"acRate": 62.91281549474043, "difficulty": "Medium", "likes": 570, "dislikes": 67, "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": 59149, "totalSubmissionRaw": 94017}, "1167": {"acRate": 69.97455180362665, "difficulty": "Medium", "likes": 1306, "dislikes": 154, "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": 122636, "totalSubmissionRaw": 175258}, "1168": {"acRate": 64.75532059102616, "difficulty": "Hard", "likes": 1134, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1168", "paidOnly": true, "title": "Optimize Water Distribution in a Village", "titleSlug": "optimize-water-distribution-in-a-village", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47770, "totalSubmissionRaw": 73770}, "1169": {"acRate": 31.174423910563544, "difficulty": "Medium", "likes": 540, "dislikes": 2311, "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": 76517, "totalSubmissionRaw": 245447}, "1170": {"acRate": 62.15344140519209, "difficulty": "Medium", "likes": 696, "dislikes": 976, "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": 80324, "totalSubmissionRaw": 129235}, "1171": {"acRate": 52.77834396140892, "difficulty": "Medium", "likes": 3276, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1171", "paidOnly": false, "title": "Remove Zero Sum Consecutive Nodes from Linked List", "titleSlug": "remove-zero-sum-consecutive-nodes-from-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163131, "totalSubmissionRaw": 309087}, "1172": {"acRate": 32.722841475215944, "difficulty": "Hard", "likes": 478, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18260, "totalSubmissionRaw": 55802}, "1173": {"acRate": 80.87761674718197, "difficulty": "Easy", "likes": 288, "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": 74332, "totalSubmissionRaw": 91907}, "1174": {"acRate": 50.85853408508457, "difficulty": "Medium", "likes": 657, "dislikes": 120, "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": 142881, "totalSubmissionRaw": 280941}, "1175": {"acRate": 57.25839136361962, "difficulty": "Easy", "likes": 399, "dislikes": 519, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31081, "totalSubmissionRaw": 54282}, "1176": {"acRate": 53.42612596269605, "difficulty": "Easy", "likes": 153, "dislikes": 287, "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": 32396, "totalSubmissionRaw": 60637}, "1177": {"acRate": 39.06798369749802, "difficulty": "Medium", "likes": 795, "dislikes": 276, "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": 27607, "totalSubmissionRaw": 70664}, "1178": {"acRate": 46.75391249283841, "difficulty": "Hard", "likes": 1260, "dislikes": 84, "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": 31010, "totalSubmissionRaw": 66326}, "1179": {"acRate": 77.17273212133982, "difficulty": "Easy", "likes": 728, "dislikes": 598, "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": 117203, "totalSubmissionRaw": 151871}, "1180": {"acRate": 79.84016799860001, "difficulty": "Easy", "likes": 353, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27374, "totalSubmissionRaw": 34286}, "1181": {"acRate": 45.782445468801974, "difficulty": "Medium", "likes": 73, "dislikes": 153, "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": 9634, "totalSubmissionRaw": 21043}, "1182": {"acRate": 55.40733387106782, "difficulty": "Medium", "likes": 514, "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": 35720, "totalSubmissionRaw": 64468}, "1183": {"acRate": 67.9159802306425, "difficulty": "Hard", "likes": 162, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1183", "paidOnly": true, "title": "Maximum Number of Ones", "titleSlug": "maximum-number-of-ones", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4947, "totalSubmissionRaw": 7284}, "1184": {"acRate": 54.03238808376476, "difficulty": "Easy", "likes": 753, "dislikes": 86, "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": 60324, "totalSubmissionRaw": 111645}, "1185": {"acRate": 57.51632284503716, "difficulty": "Easy", "likes": 398, "dislikes": 2433, "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": 66245, "totalSubmissionRaw": 115176}, "1186": {"acRate": 43.86041659656089, "difficulty": "Medium", "likes": 1792, "dislikes": 64, "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": 52136, "totalSubmissionRaw": 118868}, "1187": {"acRate": 58.285696941490706, "difficulty": "Hard", "likes": 2216, "dislikes": 49, "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": 57609, "totalSubmissionRaw": 98839}, "1188": {"acRate": 72.43247157650808, "difficulty": "Medium", "likes": 513, "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": 50011, "totalSubmissionRaw": 69045}, "1189": {"acRate": 59.74661954247331, "difficulty": "Easy", "likes": 1687, "dislikes": 102, "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": 203870, "totalSubmissionRaw": 341225}, "1190": {"acRate": 66.41324884063604, "difficulty": "Medium", "likes": 1868, "dislikes": 55, "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": 73467, "totalSubmissionRaw": 110621}, "1191": {"acRate": 23.69152574706692, "difficulty": "Medium", "likes": 1417, "dislikes": 116, "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": 34773, "totalSubmissionRaw": 146774}, "1192": {"acRate": 55.76189004882772, "difficulty": "Hard", "likes": 6127, "dislikes": 181, "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": 229201, "totalSubmissionRaw": 411036}, "1193": {"acRate": 57.790472554740546, "difficulty": "Medium", "likes": 748, "dislikes": 72, "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": 169548, "totalSubmissionRaw": 293386}, "1194": {"acRate": 49.1086516720219, "difficulty": "Hard", "likes": 149, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20633, "totalSubmissionRaw": 42015}, "1195": {"acRate": 72.36889529644981, "difficulty": "Medium", "likes": 594, "dislikes": 400, "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": 48188, "totalSubmissionRaw": 66587}, "1196": {"acRate": 66.98939603503918, "difficulty": "Easy", "likes": 220, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1196", "paidOnly": true, "title": "How Many Apples Can You Put into the Basket", "titleSlug": "how-many-apples-can-you-put-into-the-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 34872, "totalSubmissionRaw": 52056}, "1197": {"acRate": 40.5394241535452, "difficulty": "Medium", "likes": 1501, "dislikes": 405, "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": 156048, "totalSubmissionRaw": 384929}, "1198": {"acRate": 76.50568327932932, "difficulty": "Medium", "likes": 571, "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": 44625, "totalSubmissionRaw": 58329}, "1199": {"acRate": 45.74972129319955, "difficulty": "Hard", "likes": 232, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6566, "totalSubmissionRaw": 14352}, "1200": {"acRate": 69.53346958891402, "difficulty": "Easy", "likes": 2338, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1200", "paidOnly": false, "title": "Minimum Absolute Difference", "titleSlug": "minimum-absolute-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191879, "totalSubmissionRaw": 275952}, "1201": {"acRate": 29.565871041983744, "difficulty": "Medium", "likes": 1206, "dislikes": 496, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31859, "totalSubmissionRaw": 107756}, "1202": {"acRate": 58.28454703506024, "difficulty": "Medium", "likes": 3653, "dislikes": 139, "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": 114989, "totalSubmissionRaw": 197289}, "1203": {"acRate": 66.4306784660767, "difficulty": "Hard", "likes": 1745, "dislikes": 294, "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": 54048, "totalSubmissionRaw": 81360}, "1204": {"acRate": 66.8042892694233, "difficulty": "Medium", "likes": 657, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1204", "paidOnly": false, "title": "Last Person to Fit in the Bus", "titleSlug": "last-person-to-fit-in-the-bus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117305, "totalSubmissionRaw": 175596}, "1205": {"acRate": 41.78074710551227, "difficulty": "Medium", "likes": 152, "dislikes": 544, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22951, "totalSubmissionRaw": 54932}, "1206": {"acRate": 61.384767029863866, "difficulty": "Hard", "likes": 660, "dislikes": 85, "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": 23042, "totalSubmissionRaw": 37537}, "1207": {"acRate": 77.14555054195341, "difficulty": "Easy", "likes": 5001, "dislikes": 131, "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": 621132, "totalSubmissionRaw": 805143}, "1208": {"acRate": 58.204509308635046, "difficulty": "Medium", "likes": 1762, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155536, "totalSubmissionRaw": 267224}, "1209": {"acRate": 57.844798927467835, "difficulty": "Medium", "likes": 5732, "dislikes": 116, "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": 318420, "totalSubmissionRaw": 550473}, "1210": {"acRate": 49.55834978696872, "difficulty": "Hard", "likes": 268, "dislikes": 70, "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": 9537, "totalSubmissionRaw": 19245}, "1211": {"acRate": 47.43714221573689, "difficulty": "Easy", "likes": 562, "dislikes": 395, "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": 169043, "totalSubmissionRaw": 356345}, "1212": {"acRate": 55.78338893362476, "difficulty": "Medium", "likes": 305, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1212", "paidOnly": true, "title": "Team Scores in Football Tournament", "titleSlug": "team-scores-in-football-tournament", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38794, "totalSubmissionRaw": 69544}, "1213": {"acRate": 79.80625931445604, "difficulty": "Easy", "likes": 581, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86751, "totalSubmissionRaw": 108702}, "1214": {"acRate": 67.13629953267152, "difficulty": "Medium", "likes": 543, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1214", "paidOnly": true, "title": "Two Sum BSTs", "titleSlug": "two-sum-bsts", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48557, "totalSubmissionRaw": 72326}, "1215": {"acRate": 47.09087273817855, "difficulty": "Medium", "likes": 182, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9420, "totalSubmissionRaw": 20005}, "1216": {"acRate": 49.491660913484246, "difficulty": "Hard", "likes": 761, "dislikes": 12, "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": 68103, "totalSubmissionRaw": 137604}, "1217": {"acRate": 71.73379025058362, "difficulty": "Easy", "likes": 2290, "dislikes": 310, "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": 129364, "totalSubmissionRaw": 180339}, "1218": {"acRate": 54.80215765014804, "difficulty": "Medium", "likes": 3181, "dislikes": 87, "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": 142333, "totalSubmissionRaw": 259724}, "1219": {"acRate": 68.00588682232906, "difficulty": "Medium", "likes": 3259, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1219", "paidOnly": false, "title": "Path with Maximum Gold", "titleSlug": "path-with-maximum-gold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213023, "totalSubmissionRaw": 313242}, "1220": {"acRate": 61.95036052568166, "difficulty": "Hard", "likes": 3235, "dislikes": 214, "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": 167108, "totalSubmissionRaw": 269745}, "1221": {"acRate": 86.07517903139065, "difficulty": "Easy", "likes": 2719, "dislikes": 936, "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": 304095, "totalSubmissionRaw": 353290}, "1222": {"acRate": 71.88021650058172, "difficulty": "Medium", "likes": 933, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1222", "paidOnly": false, "title": "Queens That Can Attack the King", "titleSlug": "queens-that-can-attack-the-king", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42629, "totalSubmissionRaw": 59306}, "1223": {"acRate": 49.07855965639514, "difficulty": "Hard", "likes": 921, "dislikes": 189, "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": 29480, "totalSubmissionRaw": 60068}, "1224": {"acRate": 37.12723780442759, "difficulty": "Hard", "likes": 536, "dislikes": 64, "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": 15076, "totalSubmissionRaw": 40608}, "1225": {"acRate": 57.715655766974436, "difficulty": "Hard", "likes": 320, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22628, "totalSubmissionRaw": 39206}, "1226": {"acRate": 53.60333338737659, "difficulty": "Medium", "likes": 344, "dislikes": 327, "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": 33061, "totalSubmissionRaw": 61677}, "1227": {"acRate": 66.38688669701568, "difficulty": "Medium", "likes": 606, "dislikes": 966, "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": 41999, "totalSubmissionRaw": 63264}, "1228": {"acRate": 51.91204771068727, "difficulty": "Easy", "likes": 314, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1228", "paidOnly": true, "title": "Missing Number In Arithmetic Progression", "titleSlug": "missing-number-in-arithmetic-progression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 27245, "totalSubmissionRaw": 52483}, "1229": {"acRate": 55.01914034135371, "difficulty": "Medium", "likes": 879, "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": 78043, "totalSubmissionRaw": 141847}, "1230": {"acRate": 56.299695150696124, "difficulty": "Medium", "likes": 382, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17914, "totalSubmissionRaw": 31819}, "1231": {"acRate": 58.622396814292635, "difficulty": "Hard", "likes": 975, "dislikes": 59, "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": 54469, "totalSubmissionRaw": 92915}, "1232": {"acRate": 39.502558774866294, "difficulty": "Easy", "likes": 2588, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "1232", "paidOnly": false, "title": "Check If It Is a Straight Line", "titleSlug": "check-if-it-is-a-straight-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 256657, "totalSubmissionRaw": 649723}, "1233": {"acRate": 65.95088987351173, "difficulty": "Medium", "likes": 806, "dislikes": 112, "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": 53287, "totalSubmissionRaw": 80798}, "1234": {"acRate": 38.37975760153094, "difficulty": "Medium", "likes": 1181, "dislikes": 211, "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": 34295, "totalSubmissionRaw": 89357}, "1235": {"acRate": 54.486476138480654, "difficulty": "Hard", "likes": 6758, "dislikes": 105, "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": 307386, "totalSubmissionRaw": 564151}, "1236": {"acRate": 67.86053428412735, "difficulty": "Medium", "likes": 283, "dislikes": 325, "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": 37875, "totalSubmissionRaw": 55813}, "1237": {"acRate": 69.60231381055677, "difficulty": "Medium", "likes": 510, "dislikes": 1420, "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": 67382, "totalSubmissionRaw": 96810}, "1238": {"acRate": 70.02112015018773, "difficulty": "Medium", "likes": 419, "dislikes": 188, "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": 17903, "totalSubmissionRaw": 25568}, "1239": {"acRate": 54.083893542092085, "difficulty": "Medium", "likes": 4405, "dislikes": 327, "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": 286569, "totalSubmissionRaw": 529861}, "1240": {"acRate": 54.22822504436813, "difficulty": "Hard", "likes": 678, "dislikes": 567, "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": 23528, "totalSubmissionRaw": 43387}, "1241": {"acRate": 65.84433504885507, "difficulty": "Easy", "likes": 176, "dislikes": 534, "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": 35311, "totalSubmissionRaw": 53628}, "1242": {"acRate": 49.0921251231438, "difficulty": "Medium", "likes": 526, "dislikes": 89, "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": 54317, "totalSubmissionRaw": 110643}, "1243": {"acRate": 52.19690489151567, "difficulty": "Easy", "likes": 151, "dislikes": 69, "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": 13423, "totalSubmissionRaw": 25717}, "1244": {"acRate": 67.90560471976401, "difficulty": "Medium", "likes": 768, "dislikes": 94, "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": 73664, "totalSubmissionRaw": 108480}, "1245": {"acRate": 61.14811290834127, "difficulty": "Medium", "likes": 846, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44344, "totalSubmissionRaw": 72519}, "1246": {"acRate": 46.41916684653572, "difficulty": "Hard", "likes": 309, "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": 10753, "totalSubmissionRaw": 23165}, "1247": {"acRate": 64.4535887969032, "difficulty": "Medium", "likes": 1369, "dislikes": 240, "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": 39628, "totalSubmissionRaw": 61483}, "1248": {"acRate": 65.88326810413983, "difficulty": "Medium", "likes": 3839, "dislikes": 79, "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": 135510, "totalSubmissionRaw": 205683}, "1249": {"acRate": 68.93166619506414, "difficulty": "Medium", "likes": 6839, "dislikes": 143, "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": 738126, "totalSubmissionRaw": 1070811}, "1250": {"acRate": 59.3996228267328, "difficulty": "Hard", "likes": 502, "dislikes": 373, "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": 22993, "totalSubmissionRaw": 38709}, "1251": {"acRate": 39.79329786147336, "difficulty": "Easy", "likes": 1082, "dislikes": 146, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 222044, "totalSubmissionRaw": 557984}, "1252": {"acRate": 78.68628997661256, "difficulty": "Easy", "likes": 1204, "dislikes": 1507, "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": 113719, "totalSubmissionRaw": 144522}, "1253": {"acRate": 45.87822382091533, "difficulty": "Medium", "likes": 448, "dislikes": 31, "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": 26274, "totalSubmissionRaw": 57269}, "1254": {"acRate": 66.34750649327572, "difficulty": "Medium", "likes": 4502, "dislikes": 163, "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": 224026, "totalSubmissionRaw": 337656}, "1255": {"acRate": 82.25952246220778, "difficulty": "Hard", "likes": 1711, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1255", "paidOnly": false, "title": "Maximum Score Words Formed by Letters", "titleSlug": "maximum-score-words-formed-by-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111928, "totalSubmissionRaw": 136068}, "1256": {"acRate": 69.80911219160814, "difficulty": "Medium", "likes": 77, "dislikes": 250, "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": 7753, "totalSubmissionRaw": 11106}, "1257": {"acRate": 65.39920724801812, "difficulty": "Medium", "likes": 432, "dislikes": 34, "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": 23099, "totalSubmissionRaw": 35320}, "1258": {"acRate": 56.245619305096625, "difficulty": "Medium", "likes": 350, "dislikes": 158, "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": 22469, "totalSubmissionRaw": 39948}, "1259": {"acRate": 59.6512109294142, "difficulty": "Hard", "likes": 231, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11527, "totalSubmissionRaw": 19324}, "1260": {"acRate": 67.3902031305405, "difficulty": "Easy", "likes": 1720, "dislikes": 340, "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": 106428, "totalSubmissionRaw": 157928}, "1261": {"acRate": 77.30374200962437, "difficulty": "Medium", "likes": 980, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64578, "totalSubmissionRaw": 83538}, "1262": {"acRate": 50.672188713159336, "difficulty": "Medium", "likes": 1779, "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": 54691, "totalSubmissionRaw": 107930}, "1263": {"acRate": 49.00381666024721, "difficulty": "Hard", "likes": 845, "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": 27990, "totalSubmissionRaw": 57118}, "1264": {"acRate": 65.04730287869577, "difficulty": "Medium", "likes": 247, "dislikes": 21, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41735, "totalSubmissionRaw": 64161}, "1265": {"acRate": 94.0218096845385, "difficulty": "Medium", "likes": 577, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57940, "totalSubmissionRaw": 61624}, "1266": {"acRate": 82.46379035337189, "difficulty": "Easy", "likes": 2184, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231098, "totalSubmissionRaw": 280242}, "1267": {"acRate": 60.3748750076526, "difficulty": "Medium", "likes": 1289, "dislikes": 85, "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": 59171, "totalSubmissionRaw": 98006}, "1268": {"acRate": 65.12384028720024, "difficulty": "Medium", "likes": 4662, "dislikes": 239, "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": 307659, "totalSubmissionRaw": 472419}, "1269": {"acRate": 50.41591080040706, "difficulty": "Hard", "likes": 1529, "dislikes": 63, "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": 91156, "totalSubmissionRaw": 180808}, "1270": {"acRate": 84.78668505633125, "difficulty": "Medium", "likes": 417, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1270", "paidOnly": true, "title": "All People Report to the Given Manager", "titleSlug": "all-people-report-to-the-given-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54712, "totalSubmissionRaw": 64529}, "1271": {"acRate": 57.969489742240924, "difficulty": "Easy", "likes": 77, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11020, "totalSubmissionRaw": 19010}, "1272": {"acRate": 66.03958954952333, "difficulty": "Medium", "likes": 460, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36298, "totalSubmissionRaw": 54964}, "1273": {"acRate": 61.27932024892293, "difficulty": "Medium", "likes": 225, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-tree-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10241, "totalSubmissionRaw": 16712}, "1274": {"acRate": 68.66037158264064, "difficulty": "Hard", "likes": 526, "dislikes": 58, "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": 29158, "totalSubmissionRaw": 42467}, "1275": {"acRate": 53.87630662020906, "difficulty": "Easy", "likes": 1475, "dislikes": 341, "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": 126174, "totalSubmissionRaw": 234192}, "1276": {"acRate": 51.12495809752924, "difficulty": "Medium", "likes": 322, "dislikes": 234, "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": 25927, "totalSubmissionRaw": 50713}, "1277": {"acRate": 75.13836235732965, "difficulty": "Medium", "likes": 4821, "dislikes": 80, "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": 222381, "totalSubmissionRaw": 295960}, "1278": {"acRate": 60.988539296905174, "difficulty": "Hard", "likes": 1135, "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": 28417, "totalSubmissionRaw": 46594}, "1279": {"acRate": 73.08734625807797, "difficulty": "Easy", "likes": 73, "dislikes": 349, "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": 14024, "totalSubmissionRaw": 19188}, "1280": {"acRate": 56.97925476103356, "difficulty": "Easy", "likes": 1597, "dislikes": 210, "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": 235132, "totalSubmissionRaw": 412647}, "1281": {"acRate": 86.50070960746807, "difficulty": "Easy", "likes": 2544, "dislikes": 230, "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": 490645, "totalSubmissionRaw": 567215}, "1282": {"acRate": 87.4654276848354, "difficulty": "Medium", "likes": 2968, "dislikes": 699, "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": 207454, "totalSubmissionRaw": 237184}, "1283": {"acRate": 59.83120787696574, "difficulty": "Medium", "likes": 2834, "dislikes": 199, "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": 179502, "totalSubmissionRaw": 300014}, "1284": {"acRate": 72.1232652169162, "difficulty": "Hard", "likes": 958, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33000, "totalSubmissionRaw": 45755}, "1285": {"acRate": 82.28362454286875, "difficulty": "Medium", "likes": 558, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1285", "paidOnly": true, "title": "Find the Start and End Number of Continuous Ranges", "titleSlug": "find-the-start-and-end-number-of-continuous-ranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38475, "totalSubmissionRaw": 46759}, "1286": {"acRate": 73.25680828160682, "difficulty": "Medium", "likes": 1361, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72818, "totalSubmissionRaw": 99401}, "1287": {"acRate": 60.97521459837417, "difficulty": "Easy", "likes": 1690, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214523, "totalSubmissionRaw": 351820}, "1288": {"acRate": 56.38017289118743, "difficulty": "Medium", "likes": 2215, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1288", "paidOnly": false, "title": "Remove Covered Intervals", "titleSlug": "remove-covered-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120136, "totalSubmissionRaw": 213082}, "1289": {"acRate": 64.41616395339229, "difficulty": "Hard", "likes": 2226, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140310, "totalSubmissionRaw": 217818}, "1290": {"acRate": 81.11991560514478, "difficulty": "Easy", "likes": 4127, "dislikes": 158, "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": 472139, "totalSubmissionRaw": 582026}, "1291": {"acRate": 65.31259116989206, "difficulty": "Medium", "likes": 2839, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214915, "totalSubmissionRaw": 329056}, "1292": {"acRate": 53.436212019553345, "difficulty": "Medium", "likes": 1072, "dislikes": 91, "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": 33450, "totalSubmissionRaw": 62598}, "1293": {"acRate": 45.23161056500998, "difficulty": "Hard", "likes": 4478, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1293", "paidOnly": false, "title": "Shortest Path in a Grid with Obstacles Elimination", "titleSlug": "shortest-path-in-a-grid-with-obstacles-elimination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209919, "totalSubmissionRaw": 464098}, "1294": {"acRate": 66.74066599394551, "difficulty": "Easy", "likes": 138, "dislikes": 29, "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": 39684, "totalSubmissionRaw": 59460}, "1295": {"acRate": 77.26781956263153, "difficulty": "Easy", "likes": 2351, "dislikes": 128, "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": 675566, "totalSubmissionRaw": 874318}, "1296": {"acRate": 56.73242985147409, "difficulty": "Medium", "likes": 1726, "dislikes": 109, "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": 83766, "totalSubmissionRaw": 147651}, "1297": {"acRate": 51.953746838162765, "difficulty": "Medium", "likes": 1065, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "1297", "paidOnly": false, "title": "Maximum Number of Occurrences of a Substring", "titleSlug": "maximum-number-of-occurrences-of-a-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53197, "totalSubmissionRaw": 102393}, "1298": {"acRate": 58.149239077074135, "difficulty": "Hard", "likes": 342, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16583, "totalSubmissionRaw": 28518}, "1299": {"acRate": 71.26731866340668, "difficulty": "Easy", "likes": 2557, "dislikes": 239, "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": 384757, "totalSubmissionRaw": 539879}, "1300": {"acRate": 44.40760210270926, "difficulty": "Medium", "likes": 1134, "dislikes": 148, "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": 38437, "totalSubmissionRaw": 86555}, "1301": {"acRate": 39.479175851629776, "difficulty": "Hard", "likes": 509, "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": 13432, "totalSubmissionRaw": 34023}, "1302": {"acRate": 86.3179269506891, "difficulty": "Medium", "likes": 4673, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1302", "paidOnly": false, "title": "Deepest Leaves Sum", "titleSlug": "deepest-leaves-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329440, "totalSubmissionRaw": 381659}, "1303": {"acRate": 89.5133582893185, "difficulty": "Easy", "likes": 330, "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": 69823, "totalSubmissionRaw": 78003}, "1304": {"acRate": 76.19232450389019, "difficulty": "Easy", "likes": 1972, "dislikes": 592, "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": 217891, "totalSubmissionRaw": 285975}, "1305": {"acRate": 79.80003757584242, "difficulty": "Medium", "likes": 3045, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1305", "paidOnly": false, "title": "All Elements in Two Binary Search Trees", "titleSlug": "all-elements-in-two-binary-search-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216618, "totalSubmissionRaw": 271451}, "1306": {"acRate": 64.86240081040013, "difficulty": "Medium", "likes": 4123, "dislikes": 100, "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": 230508, "totalSubmissionRaw": 355380}, "1307": {"acRate": 34.11140719483448, "difficulty": "Hard", "likes": 499, "dislikes": 126, "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": 13313, "totalSubmissionRaw": 39028}, "1308": {"acRate": 86.38873550524572, "difficulty": "Medium", "likes": 214, "dislikes": 60, "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": 40677, "totalSubmissionRaw": 47086}, "1309": {"acRate": 79.65358263430876, "difficulty": "Easy", "likes": 1525, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1309", "paidOnly": false, "title": "Decrypt String from Alphabet to Integer Mapping", "titleSlug": "decrypt-string-from-alphabet-to-integer-mapping", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124395, "totalSubmissionRaw": 156170}, "1310": {"acRate": 72.82597717402282, "difficulty": "Medium", "likes": 1477, "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": 57684, "totalSubmissionRaw": 79208}, "1311": {"acRate": 47.216, "difficulty": "Medium", "likes": 383, "dislikes": 417, "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": 23608, "totalSubmissionRaw": 50000}, "1312": {"acRate": 70.60768321562722, "difficulty": "Hard", "likes": 4966, "dislikes": 62, "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": 167862, "totalSubmissionRaw": 237739}, "1313": {"acRate": 85.7312657836417, "difficulty": "Easy", "likes": 1258, "dislikes": 1317, "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": 266151, "totalSubmissionRaw": 310448}, "1314": {"acRate": 75.45446764806573, "difficulty": "Medium", "likes": 2373, "dislikes": 371, "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": 88160, "totalSubmissionRaw": 116839}, "1315": {"acRate": 85.4996247633769, "difficulty": "Medium", "likes": 2726, "dislikes": 75, "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": 152663, "totalSubmissionRaw": 178554}, "1316": {"acRate": 50.33356688092119, "difficulty": "Hard", "likes": 311, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1316", "paidOnly": false, "title": "Distinct Echo Substrings", "titleSlug": "distinct-echo-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16523, "totalSubmissionRaw": 32827}, "1317": {"acRate": 54.06990955756539, "difficulty": "Easy", "likes": 408, "dislikes": 311, "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": 46452, "totalSubmissionRaw": 85911}, "1318": {"acRate": 71.02282419569444, "difficulty": "Medium", "likes": 1946, "dislikes": 97, "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": 124905, "totalSubmissionRaw": 175866}, "1319": {"acRate": 62.74806236416237, "difficulty": "Medium", "likes": 4949, "dislikes": 69, "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": 216243, "totalSubmissionRaw": 344621}, "1320": {"acRate": 59.194025910350945, "difficulty": "Hard", "likes": 989, "dislikes": 37, "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": 31390, "totalSubmissionRaw": 53029}, "1321": {"acRate": 50.26446518305815, "difficulty": "Medium", "likes": 721, "dislikes": 276, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87522, "totalSubmissionRaw": 174123}, "1322": {"acRate": 59.57695010541111, "difficulty": "Easy", "likes": 258, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42389, "totalSubmissionRaw": 71150}, "1323": {"acRate": 82.31970316237546, "difficulty": "Easy", "likes": 2770, "dislikes": 217, "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": 262234, "totalSubmissionRaw": 318556}, "1324": {"acRate": 63.89142839128653, "difficulty": "Medium", "likes": 772, "dislikes": 115, "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": 40534, "totalSubmissionRaw": 63442}, "1325": {"acRate": 77.51861410772973, "difficulty": "Medium", "likes": 2716, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1325", "paidOnly": false, "title": "Delete Leaves With a Given Value", "titleSlug": "delete-leaves-with-a-given-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208746, "totalSubmissionRaw": 269285}, "1326": {"acRate": 50.954789768759134, "difficulty": "Hard", "likes": 3367, "dislikes": 193, "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": 132058, "totalSubmissionRaw": 259167}, "1327": {"acRate": 70.4520804729573, "difficulty": "Easy", "likes": 343, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1327", "paidOnly": false, "title": "List the Products Ordered in a Period", "titleSlug": "list-the-products-ordered-in-a-period", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112376, "totalSubmissionRaw": 159507}, "1328": {"acRate": 51.78672699477266, "difficulty": "Medium", "likes": 2316, "dislikes": 743, "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": 168021, "totalSubmissionRaw": 324448}, "1329": {"acRate": 82.91296462806895, "difficulty": "Medium", "likes": 3368, "dislikes": 228, "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": 163215, "totalSubmissionRaw": 196851}, "1330": {"acRate": 41.18057981138666, "difficulty": "Hard", "likes": 477, "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": 5895, "totalSubmissionRaw": 14315}, "1331": {"acRate": 62.22902580655539, "difficulty": "Easy", "likes": 1672, "dislikes": 87, "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": 116059, "totalSubmissionRaw": 186503}, "1332": {"acRate": 76.40678509661089, "difficulty": "Easy", "likes": 1649, "dislikes": 1759, "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": 133420, "totalSubmissionRaw": 174618}, "1333": {"acRate": 61.33120732654647, "difficulty": "Medium", "likes": 303, "dislikes": 223, "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": 30002, "totalSubmissionRaw": 48918}, "1334": {"acRate": 60.54921201844736, "difficulty": "Medium", "likes": 2627, "dislikes": 91, "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": 100700, "totalSubmissionRaw": 166311}, "1335": {"acRate": 59.59758440340831, "difficulty": "Hard", "likes": 3391, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "1335", "paidOnly": false, "title": "Minimum Difficulty of a Job Schedule", "titleSlug": "minimum-difficulty-of-a-job-schedule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194514, "totalSubmissionRaw": 326379}, "1336": {"acRate": 47.768557114994834, "difficulty": "Hard", "likes": 90, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12491, "totalSubmissionRaw": 26149}, "1337": {"acRate": 73.48294463531992, "difficulty": "Easy", "likes": 4148, "dislikes": 231, "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": 363163, "totalSubmissionRaw": 494214}, "1338": {"acRate": 68.94771716826266, "difficulty": "Medium", "likes": 3235, "dislikes": 149, "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": 193539, "totalSubmissionRaw": 280704}, "1339": {"acRate": 47.69198222974402, "difficulty": "Medium", "likes": 2988, "dislikes": 103, "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": 123992, "totalSubmissionRaw": 259985}, "1340": {"acRate": 63.2797275751432, "difficulty": "Hard", "likes": 1103, "dislikes": 41, "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": 32148, "totalSubmissionRaw": 50803}, "1341": {"acRate": 39.74080971453353, "difficulty": "Medium", "likes": 522, "dislikes": 180, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93466, "totalSubmissionRaw": 235190}, "1342": {"acRate": 85.11209296373214, "difficulty": "Easy", "likes": 3922, "dislikes": 169, "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": 671715, "totalSubmissionRaw": 789212}, "1343": {"acRate": 68.43078051808793, "difficulty": "Medium", "likes": 1574, "dislikes": 102, "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": 97000, "totalSubmissionRaw": 141750}, "1344": {"acRate": 63.76420224095792, "difficulty": "Medium", "likes": 1306, "dislikes": 239, "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": 121839, "totalSubmissionRaw": 191077}, "1345": {"acRate": 46.203798439698176, "difficulty": "Hard", "likes": 3715, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1345", "paidOnly": false, "title": "Jump Game IV", "titleSlug": "jump-game-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144507, "totalSubmissionRaw": 312760}, "1346": {"acRate": 37.17850892878936, "difficulty": "Easy", "likes": 1908, "dislikes": 204, "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": 350328, "totalSubmissionRaw": 942288}, "1347": {"acRate": 82.03189775661525, "difficulty": "Medium", "likes": 2691, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277025, "totalSubmissionRaw": 337704}, "1348": {"acRate": 44.50728178272078, "difficulty": "Medium", "likes": 192, "dislikes": 296, "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": 32975, "totalSubmissionRaw": 74089}, "1349": {"acRate": 50.43486306439674, "difficulty": "Hard", "likes": 821, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1349", "paidOnly": false, "title": "Maximum Students Taking Exam", "titleSlug": "maximum-students-taking-exam", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16353, "totalSubmissionRaw": 32424}, "1350": {"acRate": 89.64005204066882, "difficulty": "Easy", "likes": 177, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1350", "paidOnly": true, "title": "Students With Invalid Departments", "titleSlug": "students-with-invalid-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55809, "totalSubmissionRaw": 62259}, "1351": {"acRate": 77.34112825323439, "difficulty": "Easy", "likes": 4930, "dislikes": 131, "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": 415533, "totalSubmissionRaw": 537273}, "1352": {"acRate": 51.3497403210576, "difficulty": "Medium", "likes": 1465, "dislikes": 69, "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": 87007, "totalSubmissionRaw": 169440}, "1353": {"acRate": 32.44377899125125, "difficulty": "Medium", "likes": 3008, "dislikes": 411, "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": 88407, "totalSubmissionRaw": 272495}, "1354": {"acRate": 36.179591391396855, "difficulty": "Hard", "likes": 2035, "dislikes": 165, "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": 66319, "totalSubmissionRaw": 183305}, "1355": {"acRate": 72.37636003956479, "difficulty": "Medium", "likes": 143, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29269, "totalSubmissionRaw": 40440}, "1356": {"acRate": 78.21300590035347, "difficulty": "Easy", "likes": 2437, "dislikes": 119, "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": 224153, "totalSubmissionRaw": 286592}, "1357": {"acRate": 71.10535074244751, "difficulty": "Medium", "likes": 189, "dislikes": 226, "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": 22219, "totalSubmissionRaw": 31248}, "1358": {"acRate": 66.78327299384601, "difficulty": "Medium", "likes": 3143, "dislikes": 51, "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": 103854, "totalSubmissionRaw": 155509}, "1359": {"acRate": 65.10358015510465, "difficulty": "Hard", "likes": 3014, "dislikes": 226, "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": 122564, "totalSubmissionRaw": 188260}, "1360": {"acRate": 49.73476605005441, "difficulty": "Easy", "likes": 363, "dislikes": 1269, "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": 51191, "totalSubmissionRaw": 102928}, "1361": {"acRate": 43.87276458516564, "difficulty": "Medium", "likes": 2092, "dislikes": 506, "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": 113727, "totalSubmissionRaw": 259228}, "1362": {"acRate": 60.67272480672725, "difficulty": "Medium", "likes": 320, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22367, "totalSubmissionRaw": 36865}, "1363": {"acRate": 32.626181701650374, "difficulty": "Hard", "likes": 595, "dislikes": 83, "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": 20362, "totalSubmissionRaw": 62410}, "1364": {"acRate": 75.09701239498173, "difficulty": "Medium", "likes": 88, "dislikes": 384, "categoryTitle": "Database", "frontendQuestionId": "1364", "paidOnly": true, "title": "Number of Trusted Contacts of a Customer", "titleSlug": "number-of-trusted-contacts-of-a-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19933, "totalSubmissionRaw": 26543}, "1365": {"acRate": 86.73636328591805, "difficulty": "Easy", "likes": 5419, "dislikes": 131, "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": 562506, "totalSubmissionRaw": 648522}, "1366": {"acRate": 58.37454414298882, "difficulty": "Medium", "likes": 1432, "dislikes": 163, "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": 72825, "totalSubmissionRaw": 124759}, "1367": {"acRate": 43.87728557637279, "difficulty": "Medium", "likes": 2222, "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": 75902, "totalSubmissionRaw": 172987}, "1368": {"acRate": 62.034625200620944, "difficulty": "Hard", "likes": 1732, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1368", "paidOnly": false, "title": "Minimum Cost to Make at Least One Valid Path in a Grid", "titleSlug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47155, "totalSubmissionRaw": 76014}, "1369": {"acRate": 67.69114972088065, "difficulty": "Hard", "likes": 161, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1369", "paidOnly": true, "title": "Get the Second Most Recent Activity", "titleSlug": "get-the-second-most-recent-activity", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21584, "totalSubmissionRaw": 31886}, "1370": {"acRate": 76.39993699299048, "difficulty": "Easy", "likes": 772, "dislikes": 858, "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": 77604, "totalSubmissionRaw": 101576}, "1371": {"acRate": 63.89694269617896, "difficulty": "Medium", "likes": 1616, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27107, "totalSubmissionRaw": 42423}, "1372": {"acRate": 65.74584971690784, "difficulty": "Medium", "likes": 3395, "dislikes": 71, "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": 164195, "totalSubmissionRaw": 249742}, "1373": {"acRate": 41.100375218497874, "difficulty": "Hard", "likes": 2619, "dislikes": 180, "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": 72185, "totalSubmissionRaw": 175631}, "1374": {"acRate": 77.81701205696045, "difficulty": "Easy", "likes": 481, "dislikes": 1274, "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": 94101, "totalSubmissionRaw": 120926}, "1375": {"acRate": 65.72352970569129, "difficulty": "Medium", "likes": 934, "dislikes": 135, "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": 52613, "totalSubmissionRaw": 80052}, "1376": {"acRate": 60.00227731598871, "difficulty": "Medium", "likes": 4044, "dislikes": 294, "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": 216052, "totalSubmissionRaw": 360073}, "1377": {"acRate": 35.48032587141935, "difficulty": "Hard", "likes": 779, "dislikes": 142, "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": 29702, "totalSubmissionRaw": 83714}, "1378": {"acRate": 82.79282130969851, "difficulty": "Easy", "likes": 1118, "dislikes": 107, "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": 431560, "totalSubmissionRaw": 521254}, "1379": {"acRate": 85.82054805836545, "difficulty": "Easy", "likes": 1735, "dislikes": 1999, "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": 228559, "totalSubmissionRaw": 266322}, "1380": {"acRate": 71.44408541257204, "difficulty": "Easy", "likes": 1657, "dislikes": 86, "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": 107234, "totalSubmissionRaw": 150095}, "1381": {"acRate": 77.07505807001388, "difficulty": "Medium", "likes": 1802, "dislikes": 96, "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": 112155, "totalSubmissionRaw": 145514}, "1382": {"acRate": 81.52559905303232, "difficulty": "Medium", "likes": 3066, "dislikes": 74, "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": 152897, "totalSubmissionRaw": 187545}, "1383": {"acRate": 47.81204528516166, "difficulty": "Hard", "likes": 3068, "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": 94304, "totalSubmissionRaw": 197239}, "1384": {"acRate": 61.36148277299777, "difficulty": "Hard", "likes": 226, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16189, "totalSubmissionRaw": 26383}, "1385": {"acRate": 68.40931037927474, "difficulty": "Easy", "likes": 894, "dislikes": 3018, "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": 102720, "totalSubmissionRaw": 150155}, "1386": {"acRate": 41.9341820127916, "difficulty": "Medium", "likes": 894, "dislikes": 394, "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": 47797, "totalSubmissionRaw": 113981}, "1387": {"acRate": 70.00919473848188, "difficulty": "Medium", "likes": 1433, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1387", "paidOnly": false, "title": "Sort Integers by The Power Value", "titleSlug": "sort-integers-by-the-power-value", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92130, "totalSubmissionRaw": 131597}, "1388": {"acRate": 51.708975039830065, "difficulty": "Hard", "likes": 1047, "dislikes": 17, "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": 24342, "totalSubmissionRaw": 47075}, "1389": {"acRate": 85.85310335761778, "difficulty": "Easy", "likes": 2015, "dislikes": 1853, "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": 248179, "totalSubmissionRaw": 289074}, "1390": {"acRate": 42.64023355624314, "difficulty": "Medium", "likes": 408, "dislikes": 188, "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": 34177, "totalSubmissionRaw": 80152}, "1391": {"acRate": 47.89061197265299, "difficulty": "Medium", "likes": 816, "dislikes": 313, "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": 28720, "totalSubmissionRaw": 59970}, "1392": {"acRate": 45.902333209883075, "difficulty": "Hard", "likes": 1328, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1392", "paidOnly": false, "title": "Longest Happy Prefix", "titleSlug": "longest-happy-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43380, "totalSubmissionRaw": 94505}, "1393": {"acRate": 85.4376817872393, "difficulty": "Medium", "likes": 803, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1393", "paidOnly": false, "title": "Capital Gain/Loss", "titleSlug": "capital-gainloss", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110446, "totalSubmissionRaw": 129271}, "1394": {"acRate": 67.01796755812637, "difficulty": "Easy", "likes": 1139, "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": 124319, "totalSubmissionRaw": 185501}, "1395": {"acRate": 65.9644056809476, "difficulty": "Medium", "likes": 2674, "dislikes": 190, "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": 111935, "totalSubmissionRaw": 169690}, "1396": {"acRate": 74.6960508418172, "difficulty": "Medium", "likes": 3492, "dislikes": 173, "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": 231191, "totalSubmissionRaw": 309509}, "1397": {"acRate": 42.19862747636929, "difficulty": "Hard", "likes": 483, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6518, "totalSubmissionRaw": 15446}, "1398": {"acRate": 72.82852677937207, "difficulty": "Medium", "likes": 298, "dislikes": 16, "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": 51261, "totalSubmissionRaw": 70383}, "1399": {"acRate": 66.39969984270603, "difficulty": "Easy", "likes": 439, "dislikes": 974, "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": 46013, "totalSubmissionRaw": 69297}, "1400": {"acRate": 62.14661739016768, "difficulty": "Medium", "likes": 1043, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1400", "paidOnly": false, "title": "Construct K Palindrome Strings", "titleSlug": "construct-k-palindrome-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52297, "totalSubmissionRaw": 84151}, "1401": {"acRate": 46.33149565265092, "difficulty": "Medium", "likes": 366, "dislikes": 81, "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": 16892, "totalSubmissionRaw": 36459}, "1402": {"acRate": 76.19225414842037, "difficulty": "Hard", "likes": 3270, "dislikes": 304, "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": 142846, "totalSubmissionRaw": 187481}, "1403": {"acRate": 72.61921353907417, "difficulty": "Easy", "likes": 578, "dislikes": 497, "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": 72946, "totalSubmissionRaw": 100450}, "1404": {"acRate": 61.4017610803834, "difficulty": "Medium", "likes": 1356, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141764, "totalSubmissionRaw": 230880}, "1405": {"acRate": 57.42443237219669, "difficulty": "Medium", "likes": 1993, "dislikes": 249, "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": 82450, "totalSubmissionRaw": 143580}, "1406": {"acRate": 63.90482936066261, "difficulty": "Hard", "likes": 2163, "dislikes": 70, "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": 88420, "totalSubmissionRaw": 138362}, "1407": {"acRate": 57.787871970744916, "difficulty": "Easy", "likes": 624, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120730, "totalSubmissionRaw": 208919}, "1408": {"acRate": 63.886321626617374, "difficulty": "Easy", "likes": 899, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88480, "totalSubmissionRaw": 138496}, "1409": {"acRate": 84.18849399818433, "difficulty": "Medium", "likes": 486, "dislikes": 621, "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": 50076, "totalSubmissionRaw": 59481}, "1410": {"acRate": 50.845493118079276, "difficulty": "Medium", "likes": 187, "dislikes": 321, "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": 24566, "totalSubmissionRaw": 48315}, "1411": {"acRate": 63.538808032250124, "difficulty": "Hard", "likes": 1070, "dislikes": 50, "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": 33572, "totalSubmissionRaw": 52837}, "1412": {"acRate": 59.13942101581714, "difficulty": "Hard", "likes": 212, "dislikes": 23, "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": 26210, "totalSubmissionRaw": 44319}, "1413": {"acRate": 65.6287650948689, "difficulty": "Easy", "likes": 1549, "dislikes": 332, "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": 142715, "totalSubmissionRaw": 217458}, "1414": {"acRate": 65.29662306054152, "difficulty": "Medium", "likes": 1009, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1414", "paidOnly": false, "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "titleSlug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42926, "totalSubmissionRaw": 65740}, "1415": {"acRate": 74.4674764965007, "difficulty": "Medium", "likes": 952, "dislikes": 26, "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": 39050, "totalSubmissionRaw": 52439}, "1416": {"acRate": 47.710141617176795, "difficulty": "Hard", "likes": 1578, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1416", "paidOnly": false, "title": "Restore The Array", "titleSlug": "restore-the-array", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58485, "totalSubmissionRaw": 122584}, "1417": {"acRate": 52.82156123650369, "difficulty": "Easy", "likes": 587, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1417", "paidOnly": false, "title": "Reformat The String", "titleSlug": "reformat-the-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57875, "totalSubmissionRaw": 109567}, "1418": {"acRate": 74.52045358202628, "difficulty": "Medium", "likes": 387, "dislikes": 474, "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": 28127, "totalSubmissionRaw": 37744}, "1419": {"acRate": 50.274206137287926, "difficulty": "Medium", "likes": 1019, "dislikes": 88, "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": 48951, "totalSubmissionRaw": 97370}, "1420": {"acRate": 68.5482320264929, "difficulty": "Hard", "likes": 1343, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1420", "paidOnly": false, "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "titleSlug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64168, "totalSubmissionRaw": 93610}, "1421": {"acRate": 82.72340689697985, "difficulty": "Easy", "likes": 57, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26651, "totalSubmissionRaw": 32217}, "1422": {"acRate": 62.238724938922715, "difficulty": "Easy", "likes": 1528, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160495, "totalSubmissionRaw": 257870}, "1423": {"acRate": 52.82052789947759, "difficulty": "Medium", "likes": 6052, "dislikes": 229, "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": 269456, "totalSubmissionRaw": 510135}, "1424": {"acRate": 56.90506598552576, "difficulty": "Medium", "likes": 2146, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1424", "paidOnly": false, "title": "Diagonal Traverse II", "titleSlug": "diagonal-traverse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133670, "totalSubmissionRaw": 234900}, "1425": {"acRate": 56.68550600596169, "difficulty": "Hard", "likes": 2099, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1425", "paidOnly": false, "title": "Constrained Subsequence Sum", "titleSlug": "constrained-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76827, "totalSubmissionRaw": 135532}, "1426": {"acRate": 60.17199418990544, "difficulty": "Easy", "likes": 154, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125106, "totalSubmissionRaw": 207914}, "1427": {"acRate": 54.713278135541245, "difficulty": "Easy", "likes": 245, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80289, "totalSubmissionRaw": 146745}, "1428": {"acRate": 54.44012206479976, "difficulty": "Medium", "likes": 1218, "dislikes": 148, "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": 181787, "totalSubmissionRaw": 333921}, "1429": {"acRate": 53.71953449080203, "difficulty": "Medium", "likes": 552, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85211, "totalSubmissionRaw": 158622}, "1430": {"acRate": 46.886067384846335, "difficulty": "Medium", "likes": 213, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44350, "totalSubmissionRaw": 94591}, "1431": {"acRate": 87.4830533913818, "difficulty": "Easy", "likes": 4373, "dislikes": 553, "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": 891784, "totalSubmissionRaw": 1019379}, "1432": {"acRate": 40.92689442821889, "difficulty": "Medium", "likes": 229, "dislikes": 289, "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": 18077, "totalSubmissionRaw": 44169}, "1433": {"acRate": 69.5841102553709, "difficulty": "Medium", "likes": 754, "dislikes": 147, "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": 42916, "totalSubmissionRaw": 61675}, "1434": {"acRate": 43.67501764290755, "difficulty": "Hard", "likes": 892, "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": 14853, "totalSubmissionRaw": 34008}, "1435": {"acRate": 75.26941596514789, "difficulty": "Easy", "likes": 151, "dislikes": 259, "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": 22979, "totalSubmissionRaw": 30529}, "1436": {"acRate": 79.5238926021068, "difficulty": "Easy", "likes": 2182, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264373, "totalSubmissionRaw": 332445}, "1437": {"acRate": 57.98522877565274, "difficulty": "Easy", "likes": 624, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78040, "totalSubmissionRaw": 134586}, "1438": {"acRate": 49.487147401989226, "difficulty": "Medium", "likes": 3304, "dislikes": 138, "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": 130497, "totalSubmissionRaw": 263705}, "1439": {"acRate": 61.62271220636979, "difficulty": "Hard", "likes": 1220, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1439", "paidOnly": false, "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "titleSlug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34208, "totalSubmissionRaw": 55512}, "1440": {"acRate": 72.55435473617293, "difficulty": "Medium", "likes": 208, "dislikes": 24, "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": 28532, "totalSubmissionRaw": 39325}, "1441": {"acRate": 79.86891025023598, "difficulty": "Medium", "likes": 960, "dislikes": 478, "categoryTitle": "Algorithms", "frontendQuestionId": "1441", "paidOnly": false, "title": "Build an Array With Stack Operations", "titleSlug": "build-an-array-with-stack-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165843, "totalSubmissionRaw": 207644}, "1442": {"acRate": 84.95529800176172, "difficulty": "Medium", "likes": 1896, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122484, "totalSubmissionRaw": 144174}, "1443": {"acRate": 62.30096386565326, "difficulty": "Medium", "likes": 3605, "dislikes": 317, "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": 117379, "totalSubmissionRaw": 188405}, "1444": {"acRate": 62.1539959223408, "difficulty": "Hard", "likes": 1812, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1444", "paidOnly": false, "title": "Number of Ways of Cutting a Pizza", "titleSlug": "number-of-ways-of-cutting-a-pizza", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67677, "totalSubmissionRaw": 108886}, "1445": {"acRate": 86.75124964710962, "difficulty": "Medium", "likes": 239, "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": 52239, "totalSubmissionRaw": 60217}, "1446": {"acRate": 60.36508381209499, "difficulty": "Easy", "likes": 1722, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165908, "totalSubmissionRaw": 274841}, "1447": {"acRate": 66.64842182083561, "difficulty": "Medium", "likes": 411, "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": 32877, "totalSubmissionRaw": 49329}, "1448": {"acRate": 73.01543462018158, "difficulty": "Medium", "likes": 5757, "dislikes": 168, "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": 502297, "totalSubmissionRaw": 687933}, "1449": {"acRate": 48.092201264659785, "difficulty": "Hard", "likes": 686, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1449", "paidOnly": false, "title": "Form Largest Integer With Digits That Add up to Target", "titleSlug": "form-largest-integer-with-digits-that-add-up-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17797, "totalSubmissionRaw": 37006}, "1450": {"acRate": 75.60543124129511, "difficulty": "Easy", "likes": 873, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1450", "paidOnly": false, "title": "Number of Students Doing Homework at a Given Time", "titleSlug": "number-of-students-doing-homework-at-a-given-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123224, "totalSubmissionRaw": 162983}, "1451": {"acRate": 64.55686743386639, "difficulty": "Medium", "likes": 752, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1451", "paidOnly": false, "title": "Rearrange Words in a Sentence", "titleSlug": "rearrange-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51834, "totalSubmissionRaw": 80292}, "1452": {"acRate": 57.859982959386535, "difficulty": "Medium", "likes": 348, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1452", "paidOnly": false, "title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "titleSlug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24447, "totalSubmissionRaw": 42252}, "1453": {"acRate": 37.86778283885264, "difficulty": "Hard", "likes": 145, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6152, "totalSubmissionRaw": 16246}, "1454": {"acRate": 36.65781073797282, "difficulty": "Medium", "likes": 401, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38358, "totalSubmissionRaw": 104638}, "1455": {"acRate": 64.28617576276388, "difficulty": "Easy", "likes": 820, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79603, "totalSubmissionRaw": 123826}, "1456": {"acRate": 58.558325893021845, "difficulty": "Medium", "likes": 3439, "dislikes": 123, "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": 317433, "totalSubmissionRaw": 542082}, "1457": {"acRate": 68.37991749419339, "difficulty": "Medium", "likes": 3239, "dislikes": 126, "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": 216977, "totalSubmissionRaw": 317311}, "1458": {"acRate": 62.479609793727455, "difficulty": "Hard", "likes": 1647, "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": 77754, "totalSubmissionRaw": 124447}, "1459": {"acRate": 68.4638819850878, "difficulty": "Medium", "likes": 96, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17079, "totalSubmissionRaw": 24946}, "1460": {"acRate": 71.99860269094678, "difficulty": "Easy", "likes": 1033, "dislikes": 143, "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": 127786, "totalSubmissionRaw": 177484}, "1461": {"acRate": 56.527338992304855, "difficulty": "Medium", "likes": 2231, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121133, "totalSubmissionRaw": 214291}, "1462": {"acRate": 49.82552155248161, "difficulty": "Medium", "likes": 1433, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1462", "paidOnly": false, "title": "Course Schedule IV", "titleSlug": "course-schedule-iv", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59541, "totalSubmissionRaw": 119499}, "1463": {"acRate": 71.89165074368061, "difficulty": "Hard", "likes": 4074, "dislikes": 47, "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": 170816, "totalSubmissionRaw": 237602}, "1464": {"acRate": 82.64864233499428, "difficulty": "Easy", "likes": 2455, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375024, "totalSubmissionRaw": 453757}, "1465": {"acRate": 41.03274553006689, "difficulty": "Medium", "likes": 2612, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167048, "totalSubmissionRaw": 407109}, "1466": {"acRate": 64.42912237210538, "difficulty": "Medium", "likes": 4068, "dislikes": 116, "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": 186608, "totalSubmissionRaw": 289633}, "1467": {"acRate": 60.42480642182283, "difficulty": "Hard", "likes": 282, "dislikes": 171, "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": 8506, "totalSubmissionRaw": 14077}, "1468": {"acRate": 78.66472680245717, "difficulty": "Medium", "likes": 124, "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": 24331, "totalSubmissionRaw": 30930}, "1469": {"acRate": 83.6558911101659, "difficulty": "Easy", "likes": 506, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55069, "totalSubmissionRaw": 65828}, "1470": {"acRate": 88.4982496304205, "difficulty": "Easy", "likes": 5691, "dislikes": 300, "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": 689633, "totalSubmissionRaw": 779262}, "1471": {"acRate": 61.235383833248605, "difficulty": "Medium", "likes": 690, "dislikes": 153, "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": 38544, "totalSubmissionRaw": 62944}, "1472": {"acRate": 77.5498942638118, "difficulty": "Medium", "likes": 3793, "dislikes": 235, "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": 234694, "totalSubmissionRaw": 302636}, "1473": {"acRate": 61.03221234757448, "difficulty": "Hard", "likes": 2052, "dislikes": 150, "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": 62002, "totalSubmissionRaw": 101593}, "1474": {"acRate": 73.1592774277544, "difficulty": "Easy", "likes": 402, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31468, "totalSubmissionRaw": 43013}, "1475": {"acRate": 77.81984999635914, "difficulty": "Easy", "likes": 2086, "dislikes": 117, "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": 149618, "totalSubmissionRaw": 192262}, "1476": {"acRate": 88.16191446028513, "difficulty": "Medium", "likes": 620, "dislikes": 1437, "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": 107353, "totalSubmissionRaw": 121768}, "1477": {"acRate": 36.504982269096146, "difficulty": "Medium", "likes": 1685, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1477", "paidOnly": false, "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "titleSlug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47662, "totalSubmissionRaw": 130563}, "1478": {"acRate": 55.30901539433886, "difficulty": "Hard", "likes": 1098, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1478", "paidOnly": false, "title": "Allocate Mailboxes", "titleSlug": "allocate-mailboxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24503, "totalSubmissionRaw": 44302}, "1479": {"acRate": 77.48443119024647, "difficulty": "Hard", "likes": 150, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17668, "totalSubmissionRaw": 22802}, "1480": {"acRate": 86.74029383503142, "difficulty": "Easy", "likes": 7796, "dislikes": 341, "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": 1819849, "totalSubmissionRaw": 2098044}, "1481": {"acRate": 62.96156734744791, "difficulty": "Medium", "likes": 2221, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242277, "totalSubmissionRaw": 384802}, "1482": {"acRate": 51.15482902689328, "difficulty": "Medium", "likes": 3734, "dislikes": 104, "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": 126112, "totalSubmissionRaw": 246530}, "1483": {"acRate": 34.69636922122848, "difficulty": "Hard", "likes": 1911, "dislikes": 116, "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": 35807, "totalSubmissionRaw": 103201}, "1484": {"acRate": 76.74423810962982, "difficulty": "Easy", "likes": 1383, "dislikes": 102, "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": 205681, "totalSubmissionRaw": 268009}, "1485": {"acRate": 80.50690711519566, "difficulty": "Medium", "likes": 417, "dislikes": 84, "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": 27856, "totalSubmissionRaw": 34601}, "1486": {"acRate": 85.87104592739368, "difficulty": "Easy", "likes": 1374, "dislikes": 331, "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": 194151, "totalSubmissionRaw": 226096}, "1487": {"acRate": 37.028714932425736, "difficulty": "Medium", "likes": 435, "dislikes": 712, "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": 33618, "totalSubmissionRaw": 90789}, "1488": {"acRate": 26.955068668919573, "difficulty": "Medium", "likes": 1512, "dislikes": 288, "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": 36133, "totalSubmissionRaw": 134049}, "1489": {"acRate": 67.76049786430409, "difficulty": "Hard", "likes": 1822, "dislikes": 156, "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": 53461, "totalSubmissionRaw": 78897}, "1490": {"acRate": 83.14231000085746, "difficulty": "Medium", "likes": 408, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29089, "totalSubmissionRaw": 34987}, "1491": {"acRate": 63.44031197122334, "difficulty": "Easy", "likes": 2219, "dislikes": 186, "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": 339681, "totalSubmissionRaw": 535432}, "1492": {"acRate": 67.50151472609319, "difficulty": "Medium", "likes": 1742, "dislikes": 291, "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": 228388, "totalSubmissionRaw": 338345}, "1493": {"acRate": 67.33098126238889, "difficulty": "Medium", "likes": 3878, "dislikes": 77, "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": 270038, "totalSubmissionRaw": 401062}, "1494": {"acRate": 29.564908427274784, "difficulty": "Hard", "likes": 1022, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1494", "paidOnly": false, "title": "Parallel Courses II", "titleSlug": "parallel-courses-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18306, "totalSubmissionRaw": 61918}, "1495": {"acRate": 48.99679036159818, "difficulty": "Easy", "likes": 85, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1495", "paidOnly": true, "title": "Friendly Movies Streamed Last Month", "titleSlug": "friendly-movies-streamed-last-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30989, "totalSubmissionRaw": 63247}, "1496": {"acRate": 62.390334601532786, "difficulty": "Easy", "likes": 1450, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1496", "paidOnly": false, "title": "Path Crossing", "titleSlug": "path-crossing", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159723, "totalSubmissionRaw": 256006}, "1497": {"acRate": 38.51692029900307, "difficulty": "Medium", "likes": 1700, "dislikes": 91, "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": 50342, "totalSubmissionRaw": 130701}, "1498": {"acRate": 43.785688073394496, "difficulty": "Medium", "likes": 3865, "dislikes": 367, "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": 119315, "totalSubmissionRaw": 272499}, "1499": {"acRate": 44.16516129032258, "difficulty": "Hard", "likes": 1307, "dislikes": 59, "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": 42785, "totalSubmissionRaw": 96875}, "1500": {"acRate": 43.58711266160476, "difficulty": "Medium", "likes": 47, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4248, "totalSubmissionRaw": 9746}, "1501": {"acRate": 49.9667436128174, "difficulty": "Medium", "likes": 295, "dislikes": 143, "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": 38313, "totalSubmissionRaw": 76677}, "1502": {"acRate": 69.58413094899113, "difficulty": "Easy", "likes": 2158, "dislikes": 110, "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": 246817, "totalSubmissionRaw": 354703}, "1503": {"acRate": 68.5367726086289, "difficulty": "Medium", "likes": 1489, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89276, "totalSubmissionRaw": 130260}, "1504": {"acRate": 57.209977505180454, "difficulty": "Medium", "likes": 2077, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1504", "paidOnly": false, "title": "Count Submatrices With All Ones", "titleSlug": "count-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51628, "totalSubmissionRaw": 90243}, "1505": {"acRate": 39.388761601491204, "difficulty": "Hard", "likes": 484, "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": 10143, "totalSubmissionRaw": 25751}, "1506": {"acRate": 78.37257163534387, "difficulty": "Medium", "likes": 468, "dislikes": 199, "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": 34654, "totalSubmissionRaw": 44217}, "1507": {"acRate": 65.92975335901951, "difficulty": "Easy", "likes": 462, "dislikes": 433, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73750, "totalSubmissionRaw": 111862}, "1508": {"acRate": 58.38608558037617, "difficulty": "Medium", "likes": 926, "dislikes": 155, "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": 38369, "totalSubmissionRaw": 65716}, "1509": {"acRate": 55.047129928287355, "difficulty": "Medium", "likes": 1666, "dislikes": 184, "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": 87891, "totalSubmissionRaw": 159665}, "1510": {"acRate": 59.79599247350873, "difficulty": "Hard", "likes": 1587, "dislikes": 69, "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": 72456, "totalSubmissionRaw": 121172}, "1511": {"acRate": 68.00887248235217, "difficulty": "Easy", "likes": 315, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42005, "totalSubmissionRaw": 61764}, "1512": {"acRate": 89.04905960006595, "difficulty": "Easy", "likes": 5354, "dislikes": 247, "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": 767102, "totalSubmissionRaw": 861438}, "1513": {"acRate": 46.8322216521293, "difficulty": "Medium", "likes": 863, "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": 45638, "totalSubmissionRaw": 97450}, "1514": {"acRate": 55.16960068699013, "difficulty": "Medium", "likes": 3100, "dislikes": 71, "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": 141339, "totalSubmissionRaw": 256190}, "1515": {"acRate": 35.63729078837755, "difficulty": "Hard", "likes": 228, "dislikes": 263, "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": 14117, "totalSubmissionRaw": 39613}, "1516": {"acRate": 62.250205310703535, "difficulty": "Hard", "likes": 33, "dislikes": 61, "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": 2274, "totalSubmissionRaw": 3653}, "1517": {"acRate": 44.46848773722445, "difficulty": "Easy", "likes": 428, "dislikes": 246, "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": 106450, "totalSubmissionRaw": 239383}, "1518": {"acRate": 61.013083013732526, "difficulty": "Easy", "likes": 1036, "dislikes": 79, "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": 78907, "totalSubmissionRaw": 129328}, "1519": {"acRate": 55.00193809908613, "difficulty": "Medium", "likes": 2222, "dislikes": 802, "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": 83719, "totalSubmissionRaw": 152211}, "1520": {"acRate": 39.23968139029689, "difficulty": "Hard", "likes": 802, "dislikes": 75, "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": 16257, "totalSubmissionRaw": 41430}, "1521": {"acRate": 44.68851896344603, "difficulty": "Hard", "likes": 375, "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": 10416, "totalSubmissionRaw": 23308}, "1522": {"acRate": 74.38137928945694, "difficulty": "Medium", "likes": 602, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49117, "totalSubmissionRaw": 66034}, "1523": {"acRate": 49.888265014666146, "difficulty": "Easy", "likes": 2741, "dislikes": 157, "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": 337098, "totalSubmissionRaw": 675706}, "1524": {"acRate": 43.58924948140424, "difficulty": "Medium", "likes": 1334, "dislikes": 58, "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": 38454, "totalSubmissionRaw": 88218}, "1525": {"acRate": 68.2953690770388, "difficulty": "Medium", "likes": 2032, "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": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101700, "totalSubmissionRaw": 148912}, "1526": {"acRate": 69.70575002249618, "difficulty": "Hard", "likes": 1426, "dislikes": 68, "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": 38732, "totalSubmissionRaw": 55565}, "1527": {"acRate": 40.27602839653153, "difficulty": "Easy", "likes": 626, "dislikes": 558, "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": 210085, "totalSubmissionRaw": 521613}, "1528": {"acRate": 84.6715505637812, "difficulty": "Easy", "likes": 2720, "dislikes": 510, "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": 383721, "totalSubmissionRaw": 453188}, "1529": {"acRate": 73.28717450500129, "difficulty": "Medium", "likes": 1016, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53559, "totalSubmissionRaw": 73081}, "1530": {"acRate": 63.42008837159177, "difficulty": "Medium", "likes": 1746, "dislikes": 56, "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": 47078, "totalSubmissionRaw": 74232}, "1531": {"acRate": 52.5718402305291, "difficulty": "Hard", "likes": 2414, "dislikes": 212, "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": 98517, "totalSubmissionRaw": 187394}, "1532": {"acRate": 68.33771196560784, "difficulty": "Medium", "likes": 152, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1532", "paidOnly": true, "title": "The Most Recent Three Orders", "titleSlug": "the-most-recent-three-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28611, "totalSubmissionRaw": 41868}, "1533": {"acRate": 56.132095115145965, "difficulty": "Medium", "likes": 245, "dislikes": 32, "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": 13479, "totalSubmissionRaw": 24013}, "1534": {"acRate": 81.22962461954684, "difficulty": "Easy", "likes": 752, "dislikes": 1194, "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": 120098, "totalSubmissionRaw": 147850}, "1535": {"acRate": 56.975113392217715, "difficulty": "Medium", "likes": 1562, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114561, "totalSubmissionRaw": 201072}, "1536": {"acRate": 47.44525547445255, "difficulty": "Medium", "likes": 558, "dislikes": 70, "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": 15080, "totalSubmissionRaw": 31784}, "1537": {"acRate": 39.42829574237125, "difficulty": "Hard", "likes": 975, "dislikes": 50, "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": 26152, "totalSubmissionRaw": 66328}, "1538": {"acRate": 69.98123827392119, "difficulty": "Medium", "likes": 134, "dislikes": 115, "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": 4103, "totalSubmissionRaw": 5863}, "1539": {"acRate": 60.02423142281147, "difficulty": "Easy", "likes": 6516, "dislikes": 434, "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": 424578, "totalSubmissionRaw": 707345}, "1540": {"acRate": 34.854354738496404, "difficulty": "Medium", "likes": 382, "dislikes": 312, "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": 19073, "totalSubmissionRaw": 54722}, "1541": {"acRate": 52.41735906180105, "difficulty": "Medium", "likes": 1091, "dislikes": 261, "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": 61636, "totalSubmissionRaw": 117585}, "1542": {"acRate": 43.51954803618114, "difficulty": "Hard", "likes": 805, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1542", "paidOnly": false, "title": "Find Longest Awesome Substring", "titleSlug": "find-longest-awesome-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14482, "totalSubmissionRaw": 33277}, "1543": {"acRate": 59.46705710102489, "difficulty": "Easy", "likes": 88, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "1543", "paidOnly": true, "title": "Fix Product Name Format", "titleSlug": "fix-product-name-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20308, "totalSubmissionRaw": 34150}, "1544": {"acRate": 68.37046273694229, "difficulty": "Easy", "likes": 2990, "dislikes": 165, "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": 310338, "totalSubmissionRaw": 453907}, "1545": {"acRate": 58.708072116654385, "difficulty": "Medium", "likes": 914, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42234, "totalSubmissionRaw": 71939}, "1546": {"acRate": 47.625554599591744, "difficulty": "Medium", "likes": 1049, "dislikes": 27, "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": 28231, "totalSubmissionRaw": 59277}, "1547": {"acRate": 61.75379928297029, "difficulty": "Hard", "likes": 4174, "dislikes": 102, "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": 120402, "totalSubmissionRaw": 194971}, "1548": {"acRate": 59.15911809947018, "difficulty": "Hard", "likes": 376, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17307, "totalSubmissionRaw": 29255}, "1549": {"acRate": 64.77681500418542, "difficulty": "Medium", "likes": 134, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1549", "paidOnly": true, "title": "The Most Recent Orders for Each Product", "titleSlug": "the-most-recent-orders-for-each-product", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28630, "totalSubmissionRaw": 44199}, "1550": {"acRate": 63.15735692336888, "difficulty": "Easy", "likes": 650, "dislikes": 62, "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": 86530, "totalSubmissionRaw": 137007}, "1551": {"acRate": 82.23934960998571, "difficulty": "Medium", "likes": 1431, "dislikes": 179, "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": 97313, "totalSubmissionRaw": 118329}, "1552": {"acRate": 61.60570557444858, "difficulty": "Medium", "likes": 2122, "dislikes": 115, "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": 57788, "totalSubmissionRaw": 93803}, "1553": {"acRate": 35.295285162801314, "difficulty": "Hard", "likes": 980, "dislikes": 57, "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": 35566, "totalSubmissionRaw": 100767}, "1554": {"acRate": 41.696988332564615, "difficulty": "Medium", "likes": 373, "dislikes": 96, "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": 24408, "totalSubmissionRaw": 58538}, "1555": {"acRate": 51.1672710788758, "difficulty": "Medium", "likes": 140, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18057, "totalSubmissionRaw": 35286}, "1556": {"acRate": 53.729090292966944, "difficulty": "Easy", "likes": 487, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52323, "totalSubmissionRaw": 97383}, "1557": {"acRate": 80.99668103681525, "difficulty": "Medium", "likes": 3661, "dislikes": 128, "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": 179615, "totalSubmissionRaw": 221756}, "1558": {"acRate": 63.59684145151273, "difficulty": "Medium", "likes": 622, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21504, "totalSubmissionRaw": 33813}, "1559": {"acRate": 48.59735306016298, "difficulty": "Medium", "likes": 1146, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1559", "paidOnly": false, "title": "Detect Cycles in 2D Grid", "titleSlug": "detect-cycles-in-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42044, "totalSubmissionRaw": 86515}, "1560": {"acRate": 58.784908452006654, "difficulty": "Easy", "likes": 314, "dislikes": 628, "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": 31785, "totalSubmissionRaw": 54070}, "1561": {"acRate": 84.54788862483007, "difficulty": "Medium", "likes": 1870, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162939, "totalSubmissionRaw": 192718}, "1562": {"acRate": 42.91185938858472, "difficulty": "Medium", "likes": 644, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18262, "totalSubmissionRaw": 42557}, "1563": {"acRate": 40.686314921681785, "difficulty": "Hard", "likes": 639, "dislikes": 86, "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": 19741, "totalSubmissionRaw": 48520}, "1564": {"acRate": 67.01080537206352, "difficulty": "Medium", "likes": 325, "dislikes": 29, "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": 15318, "totalSubmissionRaw": 22859}, "1565": {"acRate": 82.14664444781093, "difficulty": "Easy", "likes": 77, "dislikes": 44, "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": 21690, "totalSubmissionRaw": 26404}, "1566": {"acRate": 43.15234856694443, "difficulty": "Easy", "likes": 646, "dislikes": 132, "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": 34644, "totalSubmissionRaw": 80283}, "1567": {"acRate": 44.221084613143546, "difficulty": "Medium", "likes": 2399, "dislikes": 68, "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": 95625, "totalSubmissionRaw": 216243}, "1568": {"acRate": 44.93134864622097, "difficulty": "Hard", "likes": 704, "dislikes": 148, "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": 14006, "totalSubmissionRaw": 31172}, "1569": {"acRate": 53.4890911550428, "difficulty": "Hard", "likes": 1777, "dislikes": 206, "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": 55358, "totalSubmissionRaw": 103494}, "1570": {"acRate": 89.84518044974854, "difficulty": "Medium", "likes": 1203, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259576, "totalSubmissionRaw": 288915}, "1571": {"acRate": 87.75772652527722, "difficulty": "Easy", "likes": 159, "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": 41627, "totalSubmissionRaw": 47434}, "1572": {"acRate": 82.9543048222293, "difficulty": "Easy", "likes": 3445, "dislikes": 54, "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": 356483, "totalSubmissionRaw": 429734}, "1573": {"acRate": 33.32999899969991, "difficulty": "Medium", "likes": 732, "dislikes": 82, "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": 29988, "totalSubmissionRaw": 89973}, "1574": {"acRate": 37.923895899053626, "difficulty": "Medium", "likes": 1593, "dislikes": 59, "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": 30776, "totalSubmissionRaw": 81152}, "1575": {"acRate": 65.37415274408905, "difficulty": "Hard", "likes": 1612, "dislikes": 59, "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": 57677, "totalSubmissionRaw": 88226}, "1576": {"acRate": 46.362429293975886, "difficulty": "Easy", "likes": 554, "dislikes": 175, "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": 60407, "totalSubmissionRaw": 130293}, "1577": {"acRate": 41.157865786578654, "difficulty": "Medium", "likes": 372, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1577", "paidOnly": false, "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "titleSlug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20951, "totalSubmissionRaw": 50904}, "1578": {"acRate": 63.79581874771419, "difficulty": "Medium", "likes": 3795, "dislikes": 134, "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": 256419, "totalSubmissionRaw": 401937}, "1579": {"acRate": 64.0047091140979, "difficulty": "Hard", "likes": 2026, "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": 58716, "totalSubmissionRaw": 91737}, "1580": {"acRate": 63.45616973757677, "difficulty": "Medium", "likes": 169, "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": 4546, "totalSubmissionRaw": 7164}, "1581": {"acRate": 68.17641358011119, "difficulty": "Easy", "likes": 1900, "dislikes": 268, "categoryTitle": "Database", "frontendQuestionId": "1581", "paidOnly": false, "title": "Customer Who Visited but Did Not Make Any Transactions", "titleSlug": "customer-who-visited-but-did-not-make-any-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 403086, "totalSubmissionRaw": 591241}, "1582": {"acRate": 68.60475511577243, "difficulty": "Easy", "likes": 1444, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1582", "paidOnly": false, "title": "Special Positions in a Binary Matrix", "titleSlug": "special-positions-in-a-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145805, "totalSubmissionRaw": 212529}, "1583": {"acRate": 61.53879553645088, "difficulty": "Medium", "likes": 281, "dislikes": 853, "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": 28346, "totalSubmissionRaw": 46062}, "1584": {"acRate": 66.91981582994288, "difficulty": "Medium", "likes": 4975, "dislikes": 123, "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": 289808, "totalSubmissionRaw": 433071}, "1585": {"acRate": 48.48743804477867, "difficulty": "Hard", "likes": 437, "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": 8511, "totalSubmissionRaw": 17553}, "1586": {"acRate": 65.53051643192488, "difficulty": "Medium", "likes": 260, "dislikes": 45, "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": 13958, "totalSubmissionRaw": 21300}, "1587": {"acRate": 83.40615283914254, "difficulty": "Easy", "likes": 471, "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": 101939, "totalSubmissionRaw": 122220}, "1588": {"acRate": 83.07445547705696, "difficulty": "Easy", "likes": 3666, "dislikes": 294, "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": 198371, "totalSubmissionRaw": 238787}, "1589": {"acRate": 37.879690291840376, "difficulty": "Medium", "likes": 757, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19716, "totalSubmissionRaw": 52049}, "1590": {"acRate": 29.071870729158295, "difficulty": "Medium", "likes": 1509, "dislikes": 67, "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": 28930, "totalSubmissionRaw": 99512}, "1591": {"acRate": 59.06467447003614, "difficulty": "Hard", "likes": 624, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1591", "paidOnly": false, "title": "Strange Printer II", "titleSlug": "strange-printer-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10950, "totalSubmissionRaw": 18539}, "1592": {"acRate": 43.305767421222946, "difficulty": "Easy", "likes": 453, "dislikes": 347, "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": 56608, "totalSubmissionRaw": 130717}, "1593": {"acRate": 56.40979278920912, "difficulty": "Medium", "likes": 832, "dislikes": 36, "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": 31197, "totalSubmissionRaw": 55305}, "1594": {"acRate": 33.674608045528096, "difficulty": "Medium", "likes": 824, "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": 24142, "totalSubmissionRaw": 71692}, "1595": {"acRate": 47.913250462840516, "difficulty": "Hard", "likes": 468, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9058, "totalSubmissionRaw": 18905}, "1596": {"acRate": 78.40238095238095, "difficulty": "Medium", "likes": 240, "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": 32929, "totalSubmissionRaw": 42000}, "1597": {"acRate": 62.588347659980904, "difficulty": "Hard", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1597", "paidOnly": true, "title": "Build Binary Expression Tree From Infix Expression", "titleSlug": "build-binary-expression-tree-from-infix-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13106, "totalSubmissionRaw": 20940}, "1598": {"acRate": 65.25036334553957, "difficulty": "Easy", "likes": 946, "dislikes": 66, "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": 80363, "totalSubmissionRaw": 123161}, "1599": {"acRate": 43.857860883624475, "difficulty": "Medium", "likes": 108, "dislikes": 245, "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": 12478, "totalSubmissionRaw": 28451}, "1600": {"acRate": 65.00735377305125, "difficulty": "Medium", "likes": 285, "dislikes": 303, "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": 17238, "totalSubmissionRaw": 26517}, "1601": {"acRate": 64.48630613096066, "difficulty": "Hard", "likes": 1405, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1601", "paidOnly": false, "title": "Maximum Number of Achievable Transfer Requests", "titleSlug": "maximum-number-of-achievable-transfer-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55662, "totalSubmissionRaw": 86316}, "1602": {"acRate": 75.45508119434258, "difficulty": "Medium", "likes": 328, "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": 23047, "totalSubmissionRaw": 30544}, "1603": {"acRate": 87.95360501567399, "difficulty": "Easy", "likes": 1930, "dislikes": 442, "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": 280572, "totalSubmissionRaw": 319000}, "1604": {"acRate": 45.85345555877791, "difficulty": "Medium", "likes": 309, "dislikes": 419, "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": 36365, "totalSubmissionRaw": 79307}, "1605": {"acRate": 77.28473223818533, "difficulty": "Medium", "likes": 1402, "dislikes": 39, "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": 41260, "totalSubmissionRaw": 53387}, "1606": {"acRate": 43.59436178543461, "difficulty": "Hard", "likes": 598, "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": 16701, "totalSubmissionRaw": 38310}, "1607": {"acRate": 54.26459501098109, "difficulty": "Easy", "likes": 131, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33109, "totalSubmissionRaw": 61014}, "1608": {"acRate": 66.89285851699762, "difficulty": "Easy", "likes": 2160, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "1608", "paidOnly": false, "title": "Special Array With X Elements Greater Than or Equal X", "titleSlug": "special-array-with-x-elements-greater-than-or-equal-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191242, "totalSubmissionRaw": 285893}, "1609": {"acRate": 65.71911084840937, "difficulty": "Medium", "likes": 1747, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1609", "paidOnly": false, "title": "Even Odd Tree", "titleSlug": "even-odd-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155659, "totalSubmissionRaw": 236855}, "1610": {"acRate": 37.36934929917386, "difficulty": "Hard", "likes": 570, "dislikes": 742, "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": 40258, "totalSubmissionRaw": 107730}, "1611": {"acRate": 74.20045088074586, "difficulty": "Hard", "likes": 907, "dislikes": 1015, "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": 58257, "totalSubmissionRaw": 78513}, "1612": {"acRate": 70.81795220516806, "difficulty": "Medium", "likes": 139, "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": 7290, "totalSubmissionRaw": 10294}, "1613": {"acRate": 73.0983446932814, "difficulty": "Medium", "likes": 226, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1613", "paidOnly": true, "title": "Find the Missing IDs", "titleSlug": "find-the-missing-ids", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18768, "totalSubmissionRaw": 25675}, "1614": {"acRate": 83.72155767135999, "difficulty": "Easy", "likes": 2363, "dislikes": 495, "categoryTitle": "Algorithms", "frontendQuestionId": "1614", "paidOnly": false, "title": "Maximum Nesting Depth of the Parentheses", "titleSlug": "maximum-nesting-depth-of-the-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332028, "totalSubmissionRaw": 396587}, "1615": {"acRate": 65.08815681303591, "difficulty": "Medium", "likes": 2334, "dislikes": 361, "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": 141721, "totalSubmissionRaw": 217737}, "1616": {"acRate": 31.044069579591987, "difficulty": "Medium", "likes": 728, "dislikes": 245, "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": 24789, "totalSubmissionRaw": 79851}, "1617": {"acRate": 65.70723684210526, "difficulty": "Hard", "likes": 535, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1617", "paidOnly": false, "title": "Count Subtrees With Max Distance Between Cities", "titleSlug": "count-subtrees-with-max-distance-between-cities", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10387, "totalSubmissionRaw": 15808}, "1618": {"acRate": 60.818973174631374, "difficulty": "Medium", "likes": 108, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1618", "paidOnly": true, "title": "Maximum Font to Fit a Sentence in a Screen", "titleSlug": "maximum-font-to-fit-a-sentence-in-a-screen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6847, "totalSubmissionRaw": 11258}, "1619": {"acRate": 68.25287514633979, "difficulty": "Easy", "likes": 491, "dislikes": 127, "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": 59465, "totalSubmissionRaw": 87125}, "1620": {"acRate": 37.78969214804566, "difficulty": "Medium", "likes": 78, "dislikes": 263, "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": 8740, "totalSubmissionRaw": 23128}, "1621": {"acRate": 43.47163568287692, "difficulty": "Medium", "likes": 456, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9985, "totalSubmissionRaw": 22969}, "1622": {"acRate": 17.290136789056877, "difficulty": "Hard", "likes": 368, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12008, "totalSubmissionRaw": 69450}, "1623": {"acRate": 81.95667598814642, "difficulty": "Easy", "likes": 73, "dislikes": 137, "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": 19636, "totalSubmissionRaw": 23959}, "1624": {"acRate": 68.59739268965826, "difficulty": "Easy", "likes": 1327, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1624", "paidOnly": false, "title": "Largest Substring Between Two Equal Characters", "titleSlug": "largest-substring-between-two-equal-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152859, "totalSubmissionRaw": 222835}, "1625": {"acRate": 65.3703786290862, "difficulty": "Medium", "likes": 349, "dislikes": 271, "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": 14658, "totalSubmissionRaw": 22423}, "1626": {"acRate": 50.35135960892148, "difficulty": "Medium", "likes": 2926, "dislikes": 94, "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": 82400, "totalSubmissionRaw": 163650}, "1627": {"acRate": 46.995140388768895, "difficulty": "Hard", "likes": 572, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1627", "paidOnly": false, "title": "Graph Connectivity With Threshold", "titleSlug": "graph-connectivity-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17407, "totalSubmissionRaw": 37040}, "1628": {"acRate": 82.56485499328818, "difficulty": "Medium", "likes": 535, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "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": 26448, "totalSubmissionRaw": 32033}, "1629": {"acRate": 59.060454324845814, "difficulty": "Easy", "likes": 761, "dislikes": 108, "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": 99785, "totalSubmissionRaw": 168954}, "1630": {"acRate": 83.74087848394429, "difficulty": "Medium", "likes": 1805, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136676, "totalSubmissionRaw": 163213}, "1631": {"acRate": 59.595435563438706, "difficulty": "Medium", "likes": 5775, "dislikes": 198, "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": 255019, "totalSubmissionRaw": 427917}, "1632": {"acRate": 40.89878452217225, "difficulty": "Hard", "likes": 868, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1632", "paidOnly": false, "title": "Rank Transform of a Matrix", "titleSlug": "rank-transform-of-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22006, "totalSubmissionRaw": 53806}, "1633": {"acRate": 55.060768781954295, "difficulty": "Easy", "likes": 616, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167033, "totalSubmissionRaw": 303361}, "1634": {"acRate": 55.44236518657956, "difficulty": "Medium", "likes": 143, "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": 10014, "totalSubmissionRaw": 18062}, "1635": {"acRate": 47.53121452894438, "difficulty": "Hard", "likes": 109, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8375, "totalSubmissionRaw": 17620}, "1636": {"acRate": 71.64701703344103, "difficulty": "Easy", "likes": 2840, "dislikes": 116, "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": 127071, "totalSubmissionRaw": 177357}, "1637": {"acRate": 87.52424584375537, "difficulty": "Easy", "likes": 915, "dislikes": 1699, "categoryTitle": "Algorithms", "frontendQuestionId": "1637", "paidOnly": false, "title": "Widest Vertical Area Between Two Points Containing No Points", "titleSlug": "widest-vertical-area-between-two-points-containing-no-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168310, "totalSubmissionRaw": 192301}, "1638": {"acRate": 71.07530731590882, "difficulty": "Medium", "likes": 1135, "dislikes": 342, "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": 29777, "totalSubmissionRaw": 41895}, "1639": {"acRate": 51.38741580774705, "difficulty": "Hard", "likes": 1551, "dislikes": 86, "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": 56686, "totalSubmissionRaw": 110311}, "1640": {"acRate": 56.53236327491354, "difficulty": "Easy", "likes": 892, "dislikes": 139, "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": 81899, "totalSubmissionRaw": 144871}, "1641": {"acRate": 78.3490840112106, "difficulty": "Medium", "likes": 3830, "dislikes": 89, "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": 183387, "totalSubmissionRaw": 234064}, "1642": {"acRate": 49.73001762740873, "difficulty": "Medium", "likes": 5825, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1642", "paidOnly": false, "title": "Furthest Building You Can Reach", "titleSlug": "furthest-building-you-can-reach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 223155, "totalSubmissionRaw": 448731}, "1643": {"acRate": 48.08882140823686, "difficulty": "Hard", "likes": 543, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12669, "totalSubmissionRaw": 26345}, "1644": {"acRate": 64.31273032908773, "difficulty": "Medium", "likes": 634, "dislikes": 34, "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": 79578, "totalSubmissionRaw": 123736}, "1645": {"acRate": 39.067796610169495, "difficulty": "Hard", "likes": 61, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1645", "paidOnly": true, "title": "Hopper Company Queries II", "titleSlug": "hopper-company-queries-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6454, "totalSubmissionRaw": 16520}, "1646": {"acRate": 50.42429199468357, "difficulty": "Easy", "likes": 757, "dislikes": 938, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 108504, "totalSubmissionRaw": 215182}, "1647": {"acRate": 61.2197261647398, "difficulty": "Medium", "likes": 4902, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1647", "paidOnly": false, "title": "Minimum Deletions to Make Character Frequencies Unique", "titleSlug": "minimum-deletions-to-make-character-frequencies-unique", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273553, "totalSubmissionRaw": 446838}, "1648": {"acRate": 29.98976131055225, "difficulty": "Medium", "likes": 1069, "dislikes": 384, "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": 37492, "totalSubmissionRaw": 125016}, "1649": {"acRate": 38.73008223139251, "difficulty": "Hard", "likes": 648, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25716, "totalSubmissionRaw": 66398}, "1650": {"acRate": 79.78804421081009, "difficulty": "Medium", "likes": 1368, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 236778, "totalSubmissionRaw": 296759}, "1651": {"acRate": 65.07796410709032, "difficulty": "Hard", "likes": 34, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1651", "paidOnly": true, "title": "Hopper Company Queries III", "titleSlug": "hopper-company-queries-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6636, "totalSubmissionRaw": 10197}, "1652": {"acRate": 65.47978624535315, "difficulty": "Easy", "likes": 769, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45091, "totalSubmissionRaw": 68863}, "1653": {"acRate": 58.765981100611455, "difficulty": "Medium", "likes": 1307, "dislikes": 37, "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": 42288, "totalSubmissionRaw": 71960}, "1654": {"acRate": 29.34501826055378, "difficulty": "Medium", "likes": 1469, "dislikes": 266, "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": 42827, "totalSubmissionRaw": 145943}, "1655": {"acRate": 39.532525748439085, "difficulty": "Hard", "likes": 419, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1655", "paidOnly": false, "title": "Distribute Repeating Integers", "titleSlug": "distribute-repeating-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14816, "totalSubmissionRaw": 37478}, "1656": {"acRate": 84.33331066178256, "difficulty": "Easy", "likes": 522, "dislikes": 3457, "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": 86795, "totalSubmissionRaw": 102919}, "1657": {"acRate": 54.810260611877105, "difficulty": "Medium", "likes": 3614, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 331812, "totalSubmissionRaw": 605383}, "1658": {"acRate": 39.705223044160505, "difficulty": "Medium", "likes": 5422, "dislikes": 119, "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": 191295, "totalSubmissionRaw": 481788}, "1659": {"acRate": 39.57640595633946, "difficulty": "Hard", "likes": 327, "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": 5475, "totalSubmissionRaw": 13834}, "1660": {"acRate": 74.36693100409914, "difficulty": "Medium", "likes": 267, "dislikes": 44, "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": 19412, "totalSubmissionRaw": 26103}, "1661": {"acRate": 67.0134160523052, "difficulty": "Easy", "likes": 1244, "dislikes": 117, "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": 242602, "totalSubmissionRaw": 362023}, "1662": {"acRate": 85.40074217387166, "difficulty": "Easy", "likes": 2955, "dislikes": 199, "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": 484668, "totalSubmissionRaw": 567522}, "1663": {"acRate": 66.79133816435386, "difficulty": "Medium", "likes": 1864, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1663", "paidOnly": false, "title": "Smallest String With A Given Numeric Value", "titleSlug": "smallest-string-with-a-given-numeric-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94290, "totalSubmissionRaw": 141171}, "1664": {"acRate": 63.53220783478118, "difficulty": "Medium", "likes": 1307, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38761, "totalSubmissionRaw": 61010}, "1665": {"acRate": 57.865955318439475, "difficulty": "Hard", "likes": 572, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1665", "paidOnly": false, "title": "Minimum Initial Energy to Finish Tasks", "titleSlug": "minimum-initial-energy-to-finish-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17354, "totalSubmissionRaw": 29990}, "1666": {"acRate": 73.74371859296483, "difficulty": "Medium", "likes": 63, "dislikes": 182, "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": 4696, "totalSubmissionRaw": 6368}, "1667": {"acRate": 61.57738450773931, "difficulty": "Easy", "likes": 852, "dislikes": 103, "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": 216489, "totalSubmissionRaw": 351572}, "1668": {"acRate": 38.62774974541166, "difficulty": "Easy", "likes": 676, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50449, "totalSubmissionRaw": 130603}, "1669": {"acRate": 81.5042014861455, "difficulty": "Medium", "likes": 2058, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "1669", "paidOnly": false, "title": "Merge In Between Linked Lists", "titleSlug": "merge-in-between-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211247, "totalSubmissionRaw": 259187}, "1670": {"acRate": 56.40070455327678, "difficulty": "Medium", "likes": 740, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27858, "totalSubmissionRaw": 49393}, "1671": {"acRate": 41.731120308820046, "difficulty": "Hard", "likes": 1563, "dislikes": 22, "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": 29945, "totalSubmissionRaw": 71757}, "1672": {"acRate": 87.97389698770104, "difficulty": "Easy", "likes": 4299, "dislikes": 361, "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": 868583, "totalSubmissionRaw": 987319}, "1673": {"acRate": 50.360144057623046, "difficulty": "Medium", "likes": 2017, "dislikes": 94, "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": 62925, "totalSubmissionRaw": 124950}, "1674": {"acRate": 39.55411722402013, "difficulty": "Medium", "likes": 654, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8800, "totalSubmissionRaw": 22248}, "1675": {"acRate": 54.07144378132931, "difficulty": "Hard", "likes": 3023, "dislikes": 169, "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": 93954, "totalSubmissionRaw": 173759}, "1676": {"acRate": 78.47764208979892, "difficulty": "Medium", "likes": 467, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42734, "totalSubmissionRaw": 54454}, "1677": {"acRate": 38.11508651766402, "difficulty": "Easy", "likes": 36, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16917, "totalSubmissionRaw": 44384}, "1678": {"acRate": 87.1722099244322, "difficulty": "Easy", "likes": 1555, "dislikes": 86, "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": 251246, "totalSubmissionRaw": 288218}, "1679": {"acRate": 55.014091773270536, "difficulty": "Medium", "likes": 3067, "dislikes": 83, "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": 287918, "totalSubmissionRaw": 523353}, "1680": {"acRate": 57.10420341254638, "difficulty": "Medium", "likes": 1418, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90328, "totalSubmissionRaw": 158181}, "1681": {"acRate": 38.82924096722995, "difficulty": "Hard", "likes": 271, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8318, "totalSubmissionRaw": 21422}, "1682": {"acRate": 49.9172337686224, "difficulty": "Medium", "likes": 147, "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": 5428, "totalSubmissionRaw": 10874}, "1683": {"acRate": 85.17786061107837, "difficulty": "Easy", "likes": 884, "dislikes": 327, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 471179, "totalSubmissionRaw": 553171}, "1684": {"acRate": 83.17801494229809, "difficulty": "Easy", "likes": 1707, "dislikes": 70, "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": 178243, "totalSubmissionRaw": 214291}, "1685": {"acRate": 68.50838537868941, "difficulty": "Medium", "likes": 2037, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108048, "totalSubmissionRaw": 157715}, "1686": {"acRate": 56.9818573633478, "difficulty": "Medium", "likes": 821, "dislikes": 69, "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": 19567, "totalSubmissionRaw": 34339}, "1687": {"acRate": 38.935333169412345, "difficulty": "Hard", "likes": 370, "dislikes": 29, "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": 6334, "totalSubmissionRaw": 16268}, "1688": {"acRate": 85.72530591157758, "difficulty": "Easy", "likes": 1746, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "1688", "paidOnly": false, "title": "Count of Matches in Tournament", "titleSlug": "count-of-matches-in-tournament", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242258, "totalSubmissionRaw": 282598}, "1689": {"acRate": 88.69657524140531, "difficulty": "Medium", "likes": 2393, "dislikes": 1483, "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": 216409, "totalSubmissionRaw": 243988}, "1690": {"acRate": 57.92149982129512, "difficulty": "Medium", "likes": 980, "dislikes": 167, "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": 35653, "totalSubmissionRaw": 61554}, "1691": {"acRate": 57.08754348186184, "difficulty": "Hard", "likes": 1125, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1691", "paidOnly": false, "title": "Maximum Height by Stacking Cuboids ", "titleSlug": "maximum-height-by-stacking-cuboids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27571, "totalSubmissionRaw": 48296}, "1692": {"acRate": 62.995049504950494, "difficulty": "Hard", "likes": 72, "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": 2545, "totalSubmissionRaw": 4040}, "1693": {"acRate": 86.54401788413276, "difficulty": "Easy", "likes": 538, "dislikes": 30, "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": 123106, "totalSubmissionRaw": 142247}, "1694": {"acRate": 65.55208207395637, "difficulty": "Easy", "likes": 343, "dislikes": 202, "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": 37954, "totalSubmissionRaw": 57899}, "1695": {"acRate": 58.2283477069506, "difficulty": "Medium", "likes": 2787, "dislikes": 46, "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": 128351, "totalSubmissionRaw": 220427}, "1696": {"acRate": 45.70007198136151, "difficulty": "Medium", "likes": 3393, "dislikes": 112, "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": 107296, "totalSubmissionRaw": 234783}, "1697": {"acRate": 62.42106045221526, "difficulty": "Hard", "likes": 1937, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1697", "paidOnly": false, "title": "Checking Existence of Edge Length Limited Paths", "titleSlug": "checking-existence-of-edge-length-limited-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50410, "totalSubmissionRaw": 80758}, "1698": {"acRate": 63.94727467046669, "difficulty": "Medium", "likes": 192, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10770, "totalSubmissionRaw": 16842}, "1699": {"acRate": 81.13288402353032, "difficulty": "Medium", "likes": 291, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41652, "totalSubmissionRaw": 51338}, "1700": {"acRate": 78.19429311817191, "difficulty": "Easy", "likes": 2353, "dislikes": 223, "categoryTitle": "Algorithms", "frontendQuestionId": "1700", "paidOnly": false, "title": "Number of Students Unable to Eat Lunch", "titleSlug": "number-of-students-unable-to-eat-lunch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238980, "totalSubmissionRaw": 305623}, "1701": {"acRate": 63.56022732128359, "difficulty": "Medium", "likes": 507, "dislikes": 52, "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": 29750, "totalSubmissionRaw": 46806}, "1702": {"acRate": 46.911002304147466, "difficulty": "Medium", "likes": 490, "dislikes": 51, "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": 13030, "totalSubmissionRaw": 27776}, "1703": {"acRate": 42.967584961933916, "difficulty": "Hard", "likes": 710, "dislikes": 25, "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": 10949, "totalSubmissionRaw": 25482}, "1704": {"acRate": 78.66969973107918, "difficulty": "Easy", "likes": 2228, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1704", "paidOnly": false, "title": "Determine if String Halves Are Alike", "titleSlug": "determine-if-string-halves-are-alike", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353094, "totalSubmissionRaw": 448831}, "1705": {"acRate": 39.03556771545828, "difficulty": "Medium", "likes": 823, "dislikes": 183, "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": 22828, "totalSubmissionRaw": 58480}, "1706": {"acRate": 71.78826866267669, "difficulty": "Medium", "likes": 3080, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1706", "paidOnly": false, "title": "Where Will the Ball Fall", "titleSlug": "where-will-the-ball-fall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140219, "totalSubmissionRaw": 195323}, "1707": {"acRate": 49.67840597310305, "difficulty": "Hard", "likes": 1188, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1707", "paidOnly": false, "title": "Maximum XOR With an Element From Array", "titleSlug": "maximum-xor-with-an-element-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22090, "totalSubmissionRaw": 44465}, "1708": {"acRate": 64.79871912168343, "difficulty": "Easy", "likes": 102, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8499, "totalSubmissionRaw": 13116}, "1709": {"acRate": 70.6362001612203, "difficulty": "Medium", "likes": 207, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22783, "totalSubmissionRaw": 32254}, "1710": {"acRate": 73.63540113548612, "difficulty": "Easy", "likes": 3793, "dislikes": 218, "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": 303235, "totalSubmissionRaw": 411806}, "1711": {"acRate": 30.218053890573458, "difficulty": "Medium", "likes": 1029, "dislikes": 235, "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": 38567, "totalSubmissionRaw": 127629}, "1712": {"acRate": 32.93828558716162, "difficulty": "Medium", "likes": 1395, "dislikes": 103, "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": 32573, "totalSubmissionRaw": 98891}, "1713": {"acRate": 47.4969672462596, "difficulty": "Hard", "likes": 708, "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": 11746, "totalSubmissionRaw": 24730}, "1714": {"acRate": 49.65888689407541, "difficulty": "Hard", "likes": 30, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1383, "totalSubmissionRaw": 2785}, "1715": {"acRate": 75.47962816455697, "difficulty": "Medium", "likes": 82, "dislikes": 21, "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": 15265, "totalSubmissionRaw": 20224}, "1716": {"acRate": 78.27391527498125, "difficulty": "Easy", "likes": 1423, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158608, "totalSubmissionRaw": 202632}, "1717": {"acRate": 47.00183625656937, "difficulty": "Medium", "likes": 622, "dislikes": 35, "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": 14846, "totalSubmissionRaw": 31586}, "1718": {"acRate": 53.5340926821657, "difficulty": "Medium", "likes": 559, "dislikes": 52, "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": 13724, "totalSubmissionRaw": 25636}, "1719": {"acRate": 44.23742618611281, "difficulty": "Hard", "likes": 212, "dislikes": 150, "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": 4345, "totalSubmissionRaw": 9822}, "1720": {"acRate": 86.34430228562093, "difficulty": "Easy", "likes": 1586, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153262, "totalSubmissionRaw": 177501}, "1721": {"acRate": 67.96505898526686, "difficulty": "Medium", "likes": 5300, "dislikes": 179, "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": 335186, "totalSubmissionRaw": 493174}, "1722": {"acRate": 48.790399563616525, "difficulty": "Medium", "likes": 831, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1722", "paidOnly": false, "title": "Minimize Hamming Distance After Swap Operations", "titleSlug": "minimize-hamming-distance-after-swap-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17889, "totalSubmissionRaw": 36665}, "1723": {"acRate": 42.37906001627136, "difficulty": "Hard", "likes": 1032, "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": 27087, "totalSubmissionRaw": 63916}, "1724": {"acRate": 51.46568369317185, "difficulty": "Hard", "likes": 103, "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": 2932, "totalSubmissionRaw": 5697}, "1725": {"acRate": 78.68656382740889, "difficulty": "Easy", "likes": 583, "dislikes": 70, "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": 70393, "totalSubmissionRaw": 89460}, "1726": {"acRate": 61.12405486196588, "difficulty": "Medium", "likes": 623, "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27809, "totalSubmissionRaw": 45496}, "1727": {"acRate": 75.3114764457457, "difficulty": "Medium", "likes": 1897, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71508, "totalSubmissionRaw": 94950}, "1728": {"acRate": 39.99212642708509, "difficulty": "Hard", "likes": 267, "dislikes": 43, "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": 7111, "totalSubmissionRaw": 17781}, "1729": {"acRate": 69.02535745561202, "difficulty": "Easy", "likes": 540, "dislikes": 30, "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": 180502, "totalSubmissionRaw": 261501}, "1730": {"acRate": 54.83686172577722, "difficulty": "Medium", "likes": 668, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1730", "paidOnly": true, "title": "Shortest Path to Get Food", "titleSlug": "shortest-path-to-get-food", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64135, "totalSubmissionRaw": 116956}, "1731": {"acRate": 47.07553843735261, "difficulty": "Easy", "likes": 481, "dislikes": 68, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119776, "totalSubmissionRaw": 254436}, "1732": {"acRate": 83.16855755390266, "difficulty": "Easy", "likes": 2838, "dislikes": 325, "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": 386540, "totalSubmissionRaw": 464766}, "1733": {"acRate": 42.44485294117647, "difficulty": "Medium", "likes": 210, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9236, "totalSubmissionRaw": 21760}, "1734": {"acRate": 64.65443320185217, "difficulty": "Medium", "likes": 757, "dislikes": 28, "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": 15080, "totalSubmissionRaw": 23324}, "1735": {"acRate": 51.38658035167527, "difficulty": "Hard", "likes": 286, "dislikes": 32, "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": 5874, "totalSubmissionRaw": 11431}, "1736": {"acRate": 42.714909574215596, "difficulty": "Easy", "likes": 363, "dislikes": 182, "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": 35995, "totalSubmissionRaw": 84268}, "1737": {"acRate": 36.54494003503571, "difficulty": "Medium", "likes": 320, "dislikes": 340, "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": 13560, "totalSubmissionRaw": 37105}, "1738": {"acRate": 61.76511856321033, "difficulty": "Medium", "likes": 501, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22010, "totalSubmissionRaw": 35635}, "1739": {"acRate": 52.197602615328734, "difficulty": "Hard", "likes": 304, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7185, "totalSubmissionRaw": 13765}, "1740": {"acRate": 71.30634331529592, "difficulty": "Medium", "likes": 422, "dislikes": 17, "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": 25169, "totalSubmissionRaw": 35297}, "1741": {"acRate": 86.85695363378416, "difficulty": "Easy", "likes": 701, "dislikes": 19, "categoryTitle": "Database", "frontendQuestionId": "1741", "paidOnly": false, "title": "Find Total Time Spent by Each Employee", "titleSlug": "find-total-time-spent-by-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133770, "totalSubmissionRaw": 154012}, "1742": {"acRate": 73.41463414634146, "difficulty": "Easy", "likes": 601, "dislikes": 156, "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": 63812, "totalSubmissionRaw": 86920}, "1743": {"acRate": 74.79308751242876, "difficulty": "Medium", "likes": 1939, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106815, "totalSubmissionRaw": 142814}, "1744": {"acRate": 33.98859205310818, "difficulty": "Medium", "likes": 128, "dislikes": 326, "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": 10547, "totalSubmissionRaw": 31031}, "1745": {"acRate": 44.26197213367241, "difficulty": "Hard", "likes": 907, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24715, "totalSubmissionRaw": 55838}, "1746": {"acRate": 62.263374485596714, "difficulty": "Medium", "likes": 273, "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": 9078, "totalSubmissionRaw": 14580}, "1747": {"acRate": 63.90095701048154, "difficulty": "Medium", "likes": 184, "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": 21033, "totalSubmissionRaw": 32915}, "1748": {"acRate": 77.70358089272018, "difficulty": "Easy", "likes": 1529, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1748", "paidOnly": false, "title": "Sum of Unique Elements", "titleSlug": "sum-of-unique-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 169190, "totalSubmissionRaw": 217736}, "1749": {"acRate": 59.82789508337289, "difficulty": "Medium", "likes": 1256, "dislikes": 19, "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": 39073, "totalSubmissionRaw": 65309}, "1750": {"acRate": 56.02058295005937, "difficulty": "Medium", "likes": 1190, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159927, "totalSubmissionRaw": 285479}, "1751": {"acRate": 61.793824511404026, "difficulty": "Hard", "likes": 2059, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1751", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended II", "titleSlug": "maximum-number-of-events-that-can-be-attended-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74587, "totalSubmissionRaw": 120701}, "1752": {"acRate": 50.92787349722241, "difficulty": "Easy", "likes": 3014, "dislikes": 155, "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": 223965, "totalSubmissionRaw": 439769}, "1753": {"acRate": 67.46272639338248, "difficulty": "Medium", "likes": 931, "dislikes": 54, "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": 40452, "totalSubmissionRaw": 59962}, "1754": {"acRate": 48.0074892023574, "difficulty": "Medium", "likes": 538, "dislikes": 74, "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": 22564, "totalSubmissionRaw": 47001}, "1755": {"acRate": 39.14402173913044, "difficulty": "Hard", "likes": 882, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1755", "paidOnly": false, "title": "Closest Subsequence Sum", "titleSlug": "closest-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17286, "totalSubmissionRaw": 44160}, "1756": {"acRate": 75.60677328316086, "difficulty": "Medium", "likes": 280, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1756", "paidOnly": true, "title": "Design Most Recently Used Queue", "titleSlug": "design-most-recently-used-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16074, "totalSubmissionRaw": 21260}, "1757": {"acRate": 89.1607269390836, "difficulty": "Easy", "likes": 2209, "dislikes": 104, "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": 1002840, "totalSubmissionRaw": 1124755}, "1758": {"acRate": 63.77277599142551, "difficulty": "Easy", "likes": 1413, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1758", "paidOnly": false, "title": "Minimum Changes To Make Alternating Binary String", "titleSlug": "minimum-changes-to-make-alternating-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144585, "totalSubmissionRaw": 226718}, "1759": {"acRate": 57.71854911096468, "difficulty": "Medium", "likes": 1470, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111245, "totalSubmissionRaw": 192737}, "1760": {"acRate": 60.128113658218815, "difficulty": "Medium", "likes": 1972, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38767, "totalSubmissionRaw": 64474}, "1761": {"acRate": 42.29888054836366, "difficulty": "Hard", "likes": 318, "dislikes": 285, "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": 22709, "totalSubmissionRaw": 53687}, "1762": {"acRate": 79.77289331103307, "difficulty": "Medium", "likes": 1204, "dislikes": 148, "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": 215108, "totalSubmissionRaw": 269651}, "1763": {"acRate": 60.476831207535, "difficulty": "Easy", "likes": 1313, "dislikes": 871, "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": 54385, "totalSubmissionRaw": 89926}, "1764": {"acRate": 53.454608454608454, "difficulty": "Medium", "likes": 325, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15427, "totalSubmissionRaw": 28860}, "1765": {"acRate": 62.41042493952257, "difficulty": "Medium", "likes": 816, "dislikes": 48, "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": 27347, "totalSubmissionRaw": 43818}, "1766": {"acRate": 40.854466920412264, "difficulty": "Hard", "likes": 395, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9553, "totalSubmissionRaw": 23383}, "1767": {"acRate": 77.32750546362784, "difficulty": "Hard", "likes": 170, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12384, "totalSubmissionRaw": 16015}, "1768": {"acRate": 79.88711899547212, "difficulty": "Easy", "likes": 3761, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1768", "paidOnly": false, "title": "Merge Strings Alternately", "titleSlug": "merge-strings-alternately", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 833819, "totalSubmissionRaw": 1043747}, "1769": {"acRate": 85.82209103365533, "difficulty": "Medium", "likes": 2229, "dislikes": 91, "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": 125895, "totalSubmissionRaw": 146693}, "1770": {"acRate": 40.21126071789522, "difficulty": "Hard", "likes": 2502, "dislikes": 508, "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": 111006, "totalSubmissionRaw": 276057}, "1771": {"acRate": 36.263880245012935, "difficulty": "Hard", "likes": 535, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11071, "totalSubmissionRaw": 30529}, "1772": {"acRate": 65.77195853791599, "difficulty": "Medium", "likes": 88, "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": 6028, "totalSubmissionRaw": 9165}, "1773": {"acRate": 84.86135341107335, "difficulty": "Easy", "likes": 1869, "dislikes": 213, "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": 221814, "totalSubmissionRaw": 261384}, "1774": {"acRate": 47.4889077692816, "difficulty": "Medium", "likes": 697, "dislikes": 86, "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": 30183, "totalSubmissionRaw": 63558}, "1775": {"acRate": 53.62045612622177, "difficulty": "Medium", "likes": 906, "dislikes": 44, "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": 29295, "totalSubmissionRaw": 54634}, "1776": {"acRate": 55.001723989311266, "difficulty": "Hard", "likes": 879, "dislikes": 34, "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": 25523, "totalSubmissionRaw": 46404}, "1777": {"acRate": 82.40019775058707, "difficulty": "Easy", "likes": 132, "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": 20001, "totalSubmissionRaw": 24273}, "1778": {"acRate": 39.46104276508494, "difficulty": "Medium", "likes": 162, "dislikes": 65, "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": 6736, "totalSubmissionRaw": 17070}, "1779": {"acRate": 68.47939824088303, "difficulty": "Easy", "likes": 838, "dislikes": 185, "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": 114526, "totalSubmissionRaw": 167241}, "1780": {"acRate": 67.7609916715088, "difficulty": "Medium", "likes": 967, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41982, "totalSubmissionRaw": 61956}, "1781": {"acRate": 65.27827081607698, "difficulty": "Medium", "likes": 1051, "dislikes": 172, "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": 49650, "totalSubmissionRaw": 76059}, "1782": {"acRate": 40.03578884580972, "difficulty": "Hard", "likes": 311, "dislikes": 161, "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": 6712, "totalSubmissionRaw": 16765}, "1783": {"acRate": 83.51294564185984, "difficulty": "Medium", "likes": 231, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1783", "paidOnly": true, "title": "Grand Slam Titles", "titleSlug": "grand-slam-titles", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24643, "totalSubmissionRaw": 29508}, "1784": {"acRate": 39.18900393891484, "difficulty": "Easy", "likes": 331, "dislikes": 955, "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": 42881, "totalSubmissionRaw": 109421}, "1785": {"acRate": 43.35570196014441, "difficulty": "Medium", "likes": 262, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21256, "totalSubmissionRaw": 49027}, "1786": {"acRate": 39.126626006181716, "difficulty": "Medium", "likes": 1051, "dislikes": 203, "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": 23672, "totalSubmissionRaw": 60501}, "1787": {"acRate": 39.500420135971275, "difficulty": "Hard", "likes": 396, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5171, "totalSubmissionRaw": 13091}, "1788": {"acRate": 67.22993361496681, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2228, "totalSubmissionRaw": 3314}, "1789": {"acRate": 64.02245312313389, "difficulty": "Easy", "likes": 449, "dislikes": 204, "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": 107212, "totalSubmissionRaw": 167460}, "1790": {"acRate": 45.7154170054965, "difficulty": "Easy", "likes": 1080, "dislikes": 57, "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": 107374, "totalSubmissionRaw": 234870}, "1791": {"acRate": 83.64310630351291, "difficulty": "Easy", "likes": 1393, "dislikes": 153, "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": 189910, "totalSubmissionRaw": 227048}, "1792": {"acRate": 53.68379524607949, "difficulty": "Medium", "likes": 720, "dislikes": 84, "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": 21772, "totalSubmissionRaw": 40556}, "1793": {"acRate": 64.36158606303405, "difficulty": "Hard", "likes": 1825, "dislikes": 47, "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": 73741, "totalSubmissionRaw": 114573}, "1794": {"acRate": 65.25252525252525, "difficulty": "Medium", "likes": 42, "dislikes": 58, "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": 1938, "totalSubmissionRaw": 2970}, "1795": {"acRate": 85.19291414703744, "difficulty": "Easy", "likes": 840, "dislikes": 55, "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": 127780, "totalSubmissionRaw": 149989}, "1796": {"acRate": 50.26875272084366, "difficulty": "Easy", "likes": 520, "dislikes": 128, "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": 56580, "totalSubmissionRaw": 112556}, "1797": {"acRate": 57.2882638833559, "difficulty": "Medium", "likes": 367, "dislikes": 48, "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": 28761, "totalSubmissionRaw": 50204}, "1798": {"acRate": 58.60956694804749, "difficulty": "Medium", "likes": 772, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1798", "paidOnly": false, "title": "Maximum Number of Consecutive Values You Can Make", "titleSlug": "maximum-number-of-consecutive-values-you-can-make", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17080, "totalSubmissionRaw": 29142}, "1799": {"acRate": 57.74328566445762, "difficulty": "Hard", "likes": 1615, "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": 59598, "totalSubmissionRaw": 103212}, "1800": {"acRate": 62.070457217649796, "difficulty": "Easy", "likes": 716, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1800", "paidOnly": false, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55959, "totalSubmissionRaw": 90154}, "1801": {"acRate": 49.724061810154524, "difficulty": "Medium", "likes": 289, "dislikes": 234, "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": 20723, "totalSubmissionRaw": 41676}, "1802": {"acRate": 39.22401601357673, "difficulty": "Medium", "likes": 2528, "dislikes": 437, "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": 72111, "totalSubmissionRaw": 183844}, "1803": {"acRate": 48.10779514711301, "difficulty": "Hard", "likes": 520, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1803", "paidOnly": false, "title": "Count Pairs With XOR in a Range", "titleSlug": "count-pairs-with-xor-in-a-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9140, "totalSubmissionRaw": 18999}, "1804": {"acRate": 61.49202387777816, "difficulty": "Medium", "likes": 314, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1804", "paidOnly": true, "title": "Implement Trie II (Prefix Tree)", "titleSlug": "implement-trie-ii-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18232, "totalSubmissionRaw": 29649}, "1805": {"acRate": 37.84906861964655, "difficulty": "Easy", "likes": 608, "dislikes": 97, "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": 47546, "totalSubmissionRaw": 125620}, "1806": {"acRate": 72.53019510684422, "difficulty": "Medium", "likes": 313, "dislikes": 163, "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": 18736, "totalSubmissionRaw": 25832}, "1807": {"acRate": 66.78641482820179, "difficulty": "Medium", "likes": 479, "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": 30303, "totalSubmissionRaw": 45373}, "1808": {"acRate": 32.79848089247567, "difficulty": "Hard", "likes": 222, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6909, "totalSubmissionRaw": 21065}, "1809": {"acRate": 58.42726081258191, "difficulty": "Easy", "likes": 86, "dislikes": 58, "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": 15603, "totalSubmissionRaw": 26705}, "1810": {"acRate": 56.12300933552993, "difficulty": "Medium", "likes": 82, "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": 3066, "totalSubmissionRaw": 5463}, "1811": {"acRate": 60.849226340410226, "difficulty": "Medium", "likes": 196, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15219, "totalSubmissionRaw": 25011}, "1812": {"acRate": 78.32109817389039, "difficulty": "Easy", "likes": 806, "dislikes": 18, "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": 81190, "totalSubmissionRaw": 103663}, "1813": {"acRate": 33.48077577407281, "difficulty": "Medium", "likes": 396, "dislikes": 66, "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": 16728, "totalSubmissionRaw": 49963}, "1814": {"acRate": 48.952459521694195, "difficulty": "Medium", "likes": 1802, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107995, "totalSubmissionRaw": 220612}, "1815": {"acRate": 39.89121134335656, "difficulty": "Hard", "likes": 340, "dislikes": 26, "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": 6527, "totalSubmissionRaw": 16362}, "1816": {"acRate": 85.02307191933976, "difficulty": "Easy", "likes": 1124, "dislikes": 32, "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": 167305, "totalSubmissionRaw": 196776}, "1817": {"acRate": 80.47667413354111, "difficulty": "Medium", "likes": 818, "dislikes": 303, "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": 57841, "totalSubmissionRaw": 71873}, "1818": {"acRate": 30.576814233334154, "difficulty": "Medium", "likes": 1013, "dislikes": 75, "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": 24851, "totalSubmissionRaw": 81274}, "1819": {"acRate": 40.53725701943844, "difficulty": "Hard", "likes": 410, "dislikes": 43, "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": 9009, "totalSubmissionRaw": 22224}, "1820": {"acRate": 49.54206602768903, "difficulty": "Medium", "likes": 202, "dislikes": 60, "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": 6978, "totalSubmissionRaw": 14085}, "1821": {"acRate": 87.90044813155068, "difficulty": "Easy", "likes": 57, "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": 23734, "totalSubmissionRaw": 27001}, "1822": {"acRate": 65.28431516993774, "difficulty": "Easy", "likes": 2146, "dislikes": 215, "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": 336760, "totalSubmissionRaw": 515836}, "1823": {"acRate": 78.35948158253751, "difficulty": "Medium", "likes": 2966, "dislikes": 68, "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": 133253, "totalSubmissionRaw": 170054}, "1824": {"acRate": 49.92140184979832, "difficulty": "Medium", "likes": 1175, "dislikes": 47, "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": 40967, "totalSubmissionRaw": 82063}, "1825": {"acRate": 37.12768173297229, "difficulty": "Hard", "likes": 433, "dislikes": 125, "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": 17825, "totalSubmissionRaw": 48010}, "1826": {"acRate": 50.03925967470555, "difficulty": "Easy", "likes": 66, "dislikes": 72, "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": 4461, "totalSubmissionRaw": 8915}, "1827": {"acRate": 79.39420379114488, "difficulty": "Easy", "likes": 1201, "dislikes": 62, "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": 92815, "totalSubmissionRaw": 116904}, "1828": {"acRate": 86.25193487520761, "difficulty": "Medium", "likes": 1131, "dislikes": 82, "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": 76339, "totalSubmissionRaw": 88507}, "1829": {"acRate": 77.1494487217319, "difficulty": "Medium", "likes": 764, "dislikes": 60, "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": 28759, "totalSubmissionRaw": 37277}, "1830": {"acRate": 49.29829038019903, "difficulty": "Hard", "likes": 175, "dislikes": 125, "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": 3864, "totalSubmissionRaw": 7838}, "1831": {"acRate": 81.52963838543035, "difficulty": "Medium", "likes": 86, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18622, "totalSubmissionRaw": 22841}, "1832": {"acRate": 83.23847558700182, "difficulty": "Easy", "likes": 2734, "dislikes": 56, "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": 336817, "totalSubmissionRaw": 404641}, "1833": {"acRate": 73.78823264053682, "difficulty": "Medium", "likes": 2158, "dislikes": 670, "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": 157028, "totalSubmissionRaw": 212809}, "1834": {"acRate": 45.54359401070072, "difficulty": "Medium", "likes": 3124, "dislikes": 263, "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": 105637, "totalSubmissionRaw": 231947}, "1835": {"acRate": 61.07585945638792, "difficulty": "Hard", "likes": 592, "dislikes": 48, "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": 19347, "totalSubmissionRaw": 31677}, "1836": {"acRate": 71.88892264074525, "difficulty": "Medium", "likes": 373, "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": 28399, "totalSubmissionRaw": 39504}, "1837": {"acRate": 77.40652233018045, "difficulty": "Easy", "likes": 506, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1837", "paidOnly": false, "title": "Sum of Digits in Base K", "titleSlug": "sum-of-digits-in-base-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54094, "totalSubmissionRaw": 69883}, "1838": {"acRate": 44.75067772940113, "difficulty": "Medium", "likes": 4498, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1838", "paidOnly": false, "title": "Frequency of the Most Frequent Element", "titleSlug": "frequency-of-the-most-frequent-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141634, "totalSubmissionRaw": 316496}, "1839": {"acRate": 49.28339020712642, "difficulty": "Medium", "likes": 744, "dislikes": 23, "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": 31051, "totalSubmissionRaw": 63005}, "1840": {"acRate": 36.04878783315766, "difficulty": "Hard", "likes": 372, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7182, "totalSubmissionRaw": 19923}, "1841": {"acRate": 53.27823253596122, "difficulty": "Medium", "likes": 107, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13408, "totalSubmissionRaw": 25166}, "1842": {"acRate": 53.23856147618151, "difficulty": "Hard", "likes": 121, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1842", "paidOnly": true, "title": "Next Palindrome Using Same Digits", "titleSlug": "next-palindrome-using-same-digits", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5655, "totalSubmissionRaw": 10622}, "1843": {"acRate": 44.62162710488943, "difficulty": "Medium", "likes": 89, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10997, "totalSubmissionRaw": 24645}, "1844": {"acRate": 81.19291968741173, "difficulty": "Easy", "likes": 821, "dislikes": 103, "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": 86235, "totalSubmissionRaw": 106210}, "1845": {"acRate": 69.22227031460008, "difficulty": "Medium", "likes": 1399, "dislikes": 86, "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": 121546, "totalSubmissionRaw": 175588}, "1846": {"acRate": 65.88839390684876, "difficulty": "Medium", "likes": 1069, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103680, "totalSubmissionRaw": 157357}, "1847": {"acRate": 37.73465779947807, "difficulty": "Hard", "likes": 506, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8965, "totalSubmissionRaw": 23758}, "1848": {"acRate": 54.594561564314084, "difficulty": "Easy", "likes": 358, "dislikes": 66, "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": 44672, "totalSubmissionRaw": 81825}, "1849": {"acRate": 35.50136617649078, "difficulty": "Medium", "likes": 516, "dislikes": 116, "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": 25856, "totalSubmissionRaw": 72829}, "1850": {"acRate": 71.20956259726499, "difficulty": "Medium", "likes": 762, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1850", "paidOnly": false, "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "titleSlug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21506, "totalSubmissionRaw": 30201}, "1851": {"acRate": 49.58511213997955, "difficulty": "Hard", "likes": 927, "dislikes": 31, "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": 32986, "totalSubmissionRaw": 66522}, "1852": {"acRate": 71.28616106333072, "difficulty": "Medium", "likes": 132, "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": 7294, "totalSubmissionRaw": 10232}, "1853": {"acRate": 85.75801943298283, "difficulty": "Easy", "likes": 62, "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": 12886, "totalSubmissionRaw": 15026}, "1854": {"acRate": 60.679852985564885, "difficulty": "Easy", "likes": 1279, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "1854", "paidOnly": false, "title": "Maximum Population Year", "titleSlug": "maximum-population-year", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68351, "totalSubmissionRaw": 112642}, "1855": {"acRate": 53.43951312680068, "difficulty": "Medium", "likes": 1185, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1855", "paidOnly": false, "title": "Maximum Distance Between a Pair of Values", "titleSlug": "maximum-distance-between-a-pair-of-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49524, "totalSubmissionRaw": 92673}, "1856": {"acRate": 37.96056369254646, "difficulty": "Medium", "likes": 1410, "dislikes": 112, "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": 27395, "totalSubmissionRaw": 72167}, "1857": {"acRate": 50.15707857016047, "difficulty": "Hard", "likes": 2090, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1857", "paidOnly": false, "title": "Largest Color Value in a Directed Graph", "titleSlug": "largest-color-value-in-a-directed-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64980, "totalSubmissionRaw": 129553}, "1858": {"acRate": 68.38778598771476, "difficulty": "Medium", "likes": 178, "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": 7682, "totalSubmissionRaw": 11233}, "1859": {"acRate": 83.10915349221628, "difficulty": "Easy", "likes": 2149, "dislikes": 76, "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": 164911, "totalSubmissionRaw": 198427}, "1860": {"acRate": 71.9831160021105, "difficulty": "Medium", "likes": 218, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19100, "totalSubmissionRaw": 26534}, "1861": {"acRate": 67.43006121640445, "difficulty": "Medium", "likes": 973, "dislikes": 55, "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": 52762, "totalSubmissionRaw": 78247}, "1862": {"acRate": 28.721127824280952, "difficulty": "Hard", "likes": 434, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1862", "paidOnly": false, "title": "Sum of Floored Pairs", "titleSlug": "sum-of-floored-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9127, "totalSubmissionRaw": 31778}, "1863": {"acRate": 87.83687328568078, "difficulty": "Easy", "likes": 2105, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1863", "paidOnly": false, "title": "Sum of All Subset XOR Totals", "titleSlug": "sum-of-all-subset-xor-totals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172285, "totalSubmissionRaw": 196142}, "1864": {"acRate": 43.33344076318164, "difficulty": "Medium", "likes": 578, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1864", "paidOnly": false, "title": "Minimum Number of Swaps to Make the Binary String Alternating", "titleSlug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26891, "totalSubmissionRaw": 62056}, "1865": {"acRate": 50.944998079683046, "difficulty": "Medium", "likes": 602, "dislikes": 106, "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": 25203, "totalSubmissionRaw": 49471}, "1866": {"acRate": 57.13485394157664, "difficulty": "Hard", "likes": 698, "dislikes": 21, "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": 14278, "totalSubmissionRaw": 24990}, "1867": {"acRate": 70.98803721754543, "difficulty": "Medium", "likes": 72, "dislikes": 266, "categoryTitle": "Database", "frontendQuestionId": "1867", "paidOnly": true, "title": "Orders With Maximum Quantity Above Average", "titleSlug": "orders-with-maximum-quantity-above-average", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16022, "totalSubmissionRaw": 22570}, "1868": {"acRate": 58.48309813848758, "difficulty": "Medium", "likes": 364, "dislikes": 64, "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": 41812, "totalSubmissionRaw": 71496}, "1869": {"acRate": 61.02852602711638, "difficulty": "Easy", "likes": 511, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1869", "paidOnly": false, "title": "Longer Contiguous Segments of Ones than Zeros", "titleSlug": "longer-contiguous-segments-of-ones-than-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47623, "totalSubmissionRaw": 78034}, "1870": {"acRate": 46.73179852752133, "difficulty": "Medium", "likes": 2286, "dislikes": 275, "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": 99971, "totalSubmissionRaw": 213925}, "1871": {"acRate": 24.865801528386665, "difficulty": "Medium", "likes": 1650, "dislikes": 102, "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": 45489, "totalSubmissionRaw": 182938}, "1872": {"acRate": 52.91565722012508, "difficulty": "Hard", "likes": 441, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9392, "totalSubmissionRaw": 17749}, "1873": {"acRate": 57.612967800209944, "difficulty": "Easy", "likes": 1073, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1873", "paidOnly": false, "title": "Calculate Special Bonus", "titleSlug": "calculate-special-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236000, "totalSubmissionRaw": 409630}, "1874": {"acRate": 89.34561451745945, "difficulty": "Medium", "likes": 243, "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": 19497, "totalSubmissionRaw": 21822}, "1875": {"acRate": 67.75182144096217, "difficulty": "Medium", "likes": 71, "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": 11717, "totalSubmissionRaw": 17294}, "1876": {"acRate": 73.43449714150606, "difficulty": "Easy", "likes": 1482, "dislikes": 45, "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": 121127, "totalSubmissionRaw": 164946}, "1877": {"acRate": 81.44333260315344, "difficulty": "Medium", "likes": 1928, "dislikes": 432, "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": 174744, "totalSubmissionRaw": 214559}, "1878": {"acRate": 47.66210363251241, "difficulty": "Medium", "likes": 206, "dislikes": 515, "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": 15076, "totalSubmissionRaw": 31631}, "1879": {"acRate": 47.41338556088336, "difficulty": "Hard", "likes": 669, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14041, "totalSubmissionRaw": 29614}, "1880": {"acRate": 74.11017757187567, "difficulty": "Easy", "likes": 567, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66067, "totalSubmissionRaw": 89147}, "1881": {"acRate": 37.90126310350922, "difficulty": "Medium", "likes": 377, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27876, "totalSubmissionRaw": 73549}, "1882": {"acRate": 40.14075075184766, "difficulty": "Medium", "likes": 909, "dislikes": 266, "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": 32968, "totalSubmissionRaw": 82131}, "1883": {"acRate": 37.779979087557095, "difficulty": "Hard", "likes": 331, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6865, "totalSubmissionRaw": 18171}, "1884": {"acRate": 72.74399215301618, "difficulty": "Medium", "likes": 1428, "dislikes": 138, "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": 47464, "totalSubmissionRaw": 65248}, "1885": {"acRate": 60.847447829354294, "difficulty": "Medium", "likes": 235, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10526, "totalSubmissionRaw": 17299}, "1886": {"acRate": 56.79073861843307, "difficulty": "Easy", "likes": 1417, "dislikes": 117, "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": 68384, "totalSubmissionRaw": 120414}, "1887": {"acRate": 72.95126536065497, "difficulty": "Medium", "likes": 1220, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93916, "totalSubmissionRaw": 128738}, "1888": {"acRate": 39.904356272883504, "difficulty": "Medium", "likes": 1186, "dislikes": 70, "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": 26702, "totalSubmissionRaw": 66915}, "1889": {"acRate": 31.637063129231308, "difficulty": "Hard", "likes": 400, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1889", "paidOnly": false, "title": "Minimum Space Wasted From Packaging", "titleSlug": "minimum-space-wasted-from-packaging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12664, "totalSubmissionRaw": 40029}, "1890": {"acRate": 77.1677262141335, "difficulty": "Easy", "likes": 405, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85819, "totalSubmissionRaw": 111211}, "1891": {"acRate": 49.554877473339836, "difficulty": "Medium", "likes": 567, "dislikes": 40, "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": 63012, "totalSubmissionRaw": 127156}, "1892": {"acRate": 43.244430498901785, "difficulty": "Hard", "likes": 84, "dislikes": 21, "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": 6891, "totalSubmissionRaw": 15935}, "1893": {"acRate": 49.89895530056517, "difficulty": "Easy", "likes": 587, "dislikes": 110, "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": 43704, "totalSubmissionRaw": 87585}, "1894": {"acRate": 45.29366737158945, "difficulty": "Medium", "likes": 564, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34911, "totalSubmissionRaw": 77077}, "1895": {"acRate": 52.464387464387464, "difficulty": "Medium", "likes": 288, "dislikes": 258, "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": 11049, "totalSubmissionRaw": 21060}, "1896": {"acRate": 54.0551391862955, "difficulty": "Hard", "likes": 234, "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": 4039, "totalSubmissionRaw": 7472}, "1897": {"acRate": 67.29377784305086, "difficulty": "Easy", "likes": 1088, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137461, "totalSubmissionRaw": 204270}, "1898": {"acRate": 43.596413874191654, "difficulty": "Medium", "likes": 964, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "1898", "paidOnly": false, "title": "Maximum Number of Removable Characters", "titleSlug": "maximum-number-of-removable-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29663, "totalSubmissionRaw": 68040}, "1899": {"acRate": 65.88277412930871, "difficulty": "Medium", "likes": 781, "dislikes": 59, "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": 58888, "totalSubmissionRaw": 89383}, "1900": {"acRate": 50.951752732755374, "difficulty": "Hard", "likes": 227, "dislikes": 18, "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": 5407, "totalSubmissionRaw": 10612}, "1901": {"acRate": 51.35237834674692, "difficulty": "Medium", "likes": 1999, "dislikes": 127, "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": 67571, "totalSubmissionRaw": 131583}, "1902": {"acRate": 44.482824793705625, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "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": 2318, "totalSubmissionRaw": 5211}, "1903": {"acRate": 63.17768764111915, "difficulty": "Easy", "likes": 1999, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1903", "paidOnly": false, "title": "Largest Odd Number in String", "titleSlug": "largest-odd-number-in-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250145, "totalSubmissionRaw": 395940}, "1904": {"acRate": 43.99959661153691, "difficulty": "Medium", "likes": 211, "dislikes": 259, "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": 21815, "totalSubmissionRaw": 49580}, "1905": {"acRate": 67.3260797889878, "difficulty": "Medium", "likes": 2056, "dislikes": 62, "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": 91890, "totalSubmissionRaw": 136485}, "1906": {"acRate": 44.27081235651858, "difficulty": "Medium", "likes": 529, "dislikes": 41, "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": 10992, "totalSubmissionRaw": 24829}, "1907": {"acRate": 57.93536966689924, "difficulty": "Medium", "likes": 394, "dislikes": 82, "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": 89672, "totalSubmissionRaw": 154778}, "1908": {"acRate": 63.10418143160879, "difficulty": "Medium", "likes": 102, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1908", "paidOnly": true, "title": "Game of Nim", "titleSlug": "game-of-nim", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4452, "totalSubmissionRaw": 7055}, "1909": {"acRate": 27.37958544904017, "difficulty": "Easy", "likes": 1226, "dislikes": 329, "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": 64382, "totalSubmissionRaw": 235145}, "1910": {"acRate": 77.2431104464858, "difficulty": "Medium", "likes": 1756, "dislikes": 59, "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": 115704, "totalSubmissionRaw": 149792}, "1911": {"acRate": 59.18304218289566, "difficulty": "Medium", "likes": 1197, "dislikes": 23, "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": 36352, "totalSubmissionRaw": 61423}, "1912": {"acRate": 36.41556385024319, "difficulty": "Hard", "likes": 238, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6439, "totalSubmissionRaw": 17682}, "1913": {"acRate": 82.81426595871818, "difficulty": "Easy", "likes": 1497, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242534, "totalSubmissionRaw": 292865}, "1914": {"acRate": 49.378686590640974, "difficulty": "Medium", "likes": 238, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12557, "totalSubmissionRaw": 25430}, "1915": {"acRate": 67.1629645007266, "difficulty": "Medium", "likes": 1705, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80881, "totalSubmissionRaw": 120425}, "1916": {"acRate": 48.54039375424304, "difficulty": "Hard", "likes": 477, "dislikes": 52, "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": 7150, "totalSubmissionRaw": 14730}, "1917": {"acRate": 26.649076517150394, "difficulty": "Hard", "likes": 66, "dislikes": 60, "categoryTitle": "Database", "frontendQuestionId": "1917", "paidOnly": true, "title": "Leetcodify Friends Recommendations", "titleSlug": "leetcodify-friends-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6262, "totalSubmissionRaw": 23498}, "1918": {"acRate": 52.760963557751694, "difficulty": "Medium", "likes": 200, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4271, "totalSubmissionRaw": 8095}, "1919": {"acRate": 41.4498571759438, "difficulty": "Hard", "likes": 58, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "1919", "paidOnly": true, "title": "Leetcodify Similar Friends", "titleSlug": "leetcodify-similar-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5369, "totalSubmissionRaw": 12953}, "1920": {"acRate": 89.78782659173248, "difficulty": "Easy", "likes": 3297, "dislikes": 390, "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": 519707, "totalSubmissionRaw": 578817}, "1921": {"acRate": 50.95829594294621, "difficulty": "Medium", "likes": 1491, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107893, "totalSubmissionRaw": 211728}, "1922": {"acRate": 44.77831237248394, "difficulty": "Medium", "likes": 1336, "dislikes": 417, "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": 58819, "totalSubmissionRaw": 131356}, "1923": {"acRate": 28.145429521734144, "difficulty": "Hard", "likes": 469, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7362, "totalSubmissionRaw": 26157}, "1924": {"acRate": 51.45985401459854, "difficulty": "Hard", "likes": 13, "dislikes": 41, "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": 705, "totalSubmissionRaw": 1370}, "1925": {"acRate": 67.80570928777163, "difficulty": "Easy", "likes": 421, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1925", "paidOnly": false, "title": "Count Square Sum Triples", "titleSlug": "count-square-sum-triples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44964, "totalSubmissionRaw": 66313}, "1926": {"acRate": 46.60078339561478, "difficulty": "Medium", "likes": 2263, "dislikes": 103, "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": 144906, "totalSubmissionRaw": 310953}, "1927": {"acRate": 47.76659457660955, "difficulty": "Medium", "likes": 491, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11485, "totalSubmissionRaw": 24044}, "1928": {"acRate": 37.87554514617994, "difficulty": "Hard", "likes": 775, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18759, "totalSubmissionRaw": 49528}, "1929": {"acRate": 89.85273279292417, "difficulty": "Easy", "likes": 3255, "dislikes": 380, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 760287, "totalSubmissionRaw": 846147}, "1930": {"acRate": 66.03656120889694, "difficulty": "Medium", "likes": 1707, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1930", "paidOnly": false, "title": "Unique Length-3 Palindromic Subsequences", "titleSlug": "unique-length-3-palindromic-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105010, "totalSubmissionRaw": 159019}, "1931": {"acRate": 57.589119364054156, "difficulty": "Hard", "likes": 473, "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": 9273, "totalSubmissionRaw": 16102}, "1932": {"acRate": 36.21136759767036, "difficulty": "Hard", "likes": 564, "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": 8518, "totalSubmissionRaw": 23523}, "1933": {"acRate": 50.58179329226557, "difficulty": "Easy", "likes": 57, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1933", "paidOnly": true, "title": "Check if String Is Decomposable Into Value-Equal Substrings", "titleSlug": "check-if-string-is-decomposable-into-value-equal-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3695, "totalSubmissionRaw": 7305}, "1934": {"acRate": 57.74948716031483, "difficulty": "Medium", "likes": 782, "dislikes": 68, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 177638, "totalSubmissionRaw": 307602}, "1935": {"acRate": 73.2080398049165, "difficulty": "Easy", "likes": 588, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1935", "paidOnly": false, "title": "Maximum Number of Words You Can Type", "titleSlug": "maximum-number-of-words-you-can-type", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59442, "totalSubmissionRaw": 81196}, "1936": {"acRate": 42.9359840462535, "difficulty": "Medium", "likes": 364, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1936", "paidOnly": false, "title": "Add Minimum Number of Rungs", "titleSlug": "add-minimum-number-of-rungs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27774, "totalSubmissionRaw": 64687}, "1937": {"acRate": 35.69381389915825, "difficulty": "Medium", "likes": 2308, "dislikes": 139, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 59281, "totalSubmissionRaw": 166082}, "1938": {"acRate": 42.27437391715231, "difficulty": "Hard", "likes": 377, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5368, "totalSubmissionRaw": 12698}, "1939": {"acRate": 56.364288275367514, "difficulty": "Easy", "likes": 61, "dislikes": 47, "categoryTitle": "Database", "frontendQuestionId": "1939", "paidOnly": true, "title": "Users That Actively Request Confirmation Messages", "titleSlug": "users-that-actively-request-confirmation-messages", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11004, "totalSubmissionRaw": 19523}, "1940": {"acRate": 81.15364756214501, "difficulty": "Medium", "likes": 176, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10990, "totalSubmissionRaw": 13545}, "1941": {"acRate": 77.46344384472839, "difficulty": "Easy", "likes": 869, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1941", "paidOnly": false, "title": "Check if All Characters Have Equal Number of Occurrences", "titleSlug": "check-if-all-characters-have-equal-number-of-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95726, "totalSubmissionRaw": 123575}, "1942": {"acRate": 41.97766749379653, "difficulty": "Medium", "likes": 567, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16917, "totalSubmissionRaw": 40300}, "1943": {"acRate": 49.69639618326631, "difficulty": "Medium", "likes": 471, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12604, "totalSubmissionRaw": 25362}, "1944": {"acRate": 69.6627915928863, "difficulty": "Hard", "likes": 1702, "dislikes": 51, "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": 54291, "totalSubmissionRaw": 77934}, "1945": {"acRate": 62.554225435581365, "difficulty": "Easy", "likes": 599, "dislikes": 63, "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": 52777, "totalSubmissionRaw": 84370}, "1946": {"acRate": 35.728193146417446, "difficulty": "Medium", "likes": 214, "dislikes": 224, "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": 20185, "totalSubmissionRaw": 56496}, "1947": {"acRate": 62.04355449393947, "difficulty": "Medium", "likes": 767, "dislikes": 24, "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": 24416, "totalSubmissionRaw": 39353}, "1948": {"acRate": 56.0179833012203, "difficulty": "Hard", "likes": 316, "dislikes": 71, "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": 8722, "totalSubmissionRaw": 15570}, "1949": {"acRate": 54.44968625475198, "difficulty": "Medium", "likes": 145, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11888, "totalSubmissionRaw": 21833}, "1950": {"acRate": 49.779511533242875, "difficulty": "Medium", "likes": 136, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2935, "totalSubmissionRaw": 5896}, "1951": {"acRate": 68.84237196115099, "difficulty": "Medium", "likes": 94, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "1951", "paidOnly": true, "title": "All the Pairs With the Maximum Number of Common Followers", "titleSlug": "all-the-pairs-with-the-maximum-number-of-common-followers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11412, "totalSubmissionRaw": 16577}, "1952": {"acRate": 60.753375977256574, "difficulty": "Easy", "likes": 521, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68384, "totalSubmissionRaw": 112560}, "1953": {"acRate": 40.5410574265, "difficulty": "Medium", "likes": 641, "dislikes": 144, "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": 23318, "totalSubmissionRaw": 57517}, "1954": {"acRate": 54.11818240915296, "difficulty": "Medium", "likes": 374, "dislikes": 91, "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": 16650, "totalSubmissionRaw": 30766}, "1955": {"acRate": 51.0143118284364, "difficulty": "Hard", "likes": 513, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1955", "paidOnly": false, "title": "Count Number of Special Subsequences", "titleSlug": "count-number-of-special-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11442, "totalSubmissionRaw": 22429}, "1956": {"acRate": 47.07920792079208, "difficulty": "Hard", "likes": 31, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1956", "paidOnly": true, "title": "Minimum Time For K Virus Variants to Spread", "titleSlug": "minimum-time-for-k-virus-variants-to-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 951, "totalSubmissionRaw": 2020}, "1957": {"acRate": 58.019016932019206, "difficulty": "Easy", "likes": 435, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36733, "totalSubmissionRaw": 63312}, "1958": {"acRate": 47.707847707847705, "difficulty": "Medium", "likes": 149, "dislikes": 268, "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": 12894, "totalSubmissionRaw": 27027}, "1959": {"acRate": 42.79835390946502, "difficulty": "Medium", "likes": 557, "dislikes": 51, "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": 8216, "totalSubmissionRaw": 19197}, "1960": {"acRate": 30.546236559139782, "difficulty": "Hard", "likes": 240, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3551, "totalSubmissionRaw": 11625}, "1961": {"acRate": 52.803518461695816, "difficulty": "Easy", "likes": 483, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51626, "totalSubmissionRaw": 97770}, "1962": {"acRate": 62.09996923443985, "difficulty": "Medium", "likes": 1799, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1962", "paidOnly": false, "title": "Remove Stones to Minimize the Total", "titleSlug": "remove-stones-to-minimize-the-total", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98904, "totalSubmissionRaw": 159267}, "1963": {"acRate": 71.59628968407979, "difficulty": "Medium", "likes": 1768, "dislikes": 74, "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": 73790, "totalSubmissionRaw": 103064}, "1964": {"acRate": 62.99249840508613, "difficulty": "Hard", "likes": 1772, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57269, "totalSubmissionRaw": 90914}, "1965": {"acRate": 72.17671240253951, "difficulty": "Easy", "likes": 689, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120621, "totalSubmissionRaw": 167119}, "1966": {"acRate": 64.89815253434391, "difficulty": "Medium", "likes": 70, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2740, "totalSubmissionRaw": 4222}, "1967": {"acRate": 80.79517258250527, "difficulty": "Easy", "likes": 686, "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": 69357, "totalSubmissionRaw": 85843}, "1968": {"acRate": 50.08797899676014, "difficulty": "Medium", "likes": 603, "dislikes": 46, "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": 35867, "totalSubmissionRaw": 71608}, "1969": {"acRate": 35.40366887047211, "difficulty": "Medium", "likes": 238, "dislikes": 366, "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": 11406, "totalSubmissionRaw": 32217}, "1970": {"acRate": 61.93412227489199, "difficulty": "Hard", "likes": 1877, "dislikes": 34, "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": 56051, "totalSubmissionRaw": 90501}, "1971": {"acRate": 54.217343369924734, "difficulty": "Easy", "likes": 3833, "dislikes": 218, "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": 433740, "totalSubmissionRaw": 800004}, "1972": {"acRate": 50.15221919564172, "difficulty": "Hard", "likes": 133, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1972", "paidOnly": true, "title": "First and Last Call On the Same Day", "titleSlug": "first-and-last-call-on-the-same-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9390, "totalSubmissionRaw": 18723}, "1973": {"acRate": 76.87762217100986, "difficulty": "Medium", "likes": 174, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13010, "totalSubmissionRaw": 16923}, "1974": {"acRate": 75.17184685078621, "difficulty": "Easy", "likes": 681, "dislikes": 28, "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": 42978, "totalSubmissionRaw": 57173}, "1975": {"acRate": 49.48975448664159, "difficulty": "Medium", "likes": 547, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18283, "totalSubmissionRaw": 36943}, "1976": {"acRate": 27.91085377487697, "difficulty": "Medium", "likes": 2682, "dislikes": 119, "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": 59098, "totalSubmissionRaw": 211739}, "1977": {"acRate": 20.810041841004185, "difficulty": "Hard", "likes": 508, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6217, "totalSubmissionRaw": 29875}, "1978": {"acRate": 47.86628405871986, "difficulty": "Easy", "likes": 326, "dislikes": 33, "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": 103754, "totalSubmissionRaw": 216758}, "1979": {"acRate": 77.78439930123452, "difficulty": "Easy", "likes": 1106, "dislikes": 47, "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": 133135, "totalSubmissionRaw": 171159}, "1980": {"acRate": 74.61822181959363, "difficulty": "Medium", "likes": 1965, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138376, "totalSubmissionRaw": 185446}, "1981": {"acRate": 34.369618073143556, "difficulty": "Medium", "likes": 915, "dislikes": 138, "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": 27141, "totalSubmissionRaw": 78968}, "1982": {"acRate": 48.81995351332022, "difficulty": "Hard", "likes": 576, "dislikes": 38, "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": 5461, "totalSubmissionRaw": 11186}, "1983": {"acRate": 53.46366340841479, "difficulty": "Medium", "likes": 92, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2516, "totalSubmissionRaw": 4706}, "1984": {"acRate": 56.7476587439672, "difficulty": "Easy", "likes": 976, "dislikes": 265, "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": 75017, "totalSubmissionRaw": 132194}, "1985": {"acRate": 45.431452544068975, "difficulty": "Medium", "likes": 1226, "dislikes": 143, "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": 64921, "totalSubmissionRaw": 142900}, "1986": {"acRate": 33.17408066809268, "difficulty": "Medium", "likes": 1104, "dislikes": 66, "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": 25900, "totalSubmissionRaw": 78073}, "1987": {"acRate": 52.35802416061218, "difficulty": "Hard", "likes": 689, "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": 12179, "totalSubmissionRaw": 23261}, "1988": {"acRate": 66.86243642528457, "difficulty": "Medium", "likes": 77, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1988", "paidOnly": true, "title": "Find Cutoff Score for Each School", "titleSlug": "find-cutoff-score-for-each-school", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11043, "totalSubmissionRaw": 16516}, "1989": {"acRate": 51.470588235294116, "difficulty": "Medium", "likes": 71, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1989", "paidOnly": true, "title": "Maximum Number of People That Can Be Caught in Tag", "titleSlug": "maximum-number-of-people-that-can-be-caught-in-tag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2100, "totalSubmissionRaw": 4080}, "1990": {"acRate": 48.78322463005821, "difficulty": "Medium", "likes": 24, "dislikes": 189, "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": 6956, "totalSubmissionRaw": 14259}, "1991": {"acRate": 67.42091451065407, "difficulty": "Easy", "likes": 1353, "dislikes": 63, "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": 94543, "totalSubmissionRaw": 140228}, "1992": {"acRate": 75.86578133833737, "difficulty": "Medium", "likes": 1353, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1992", "paidOnly": false, "title": "Find All Groups of Farmland", "titleSlug": "find-all-groups-of-farmland", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126139, "totalSubmissionRaw": 166266}, "1993": {"acRate": 45.65318727421047, "difficulty": "Medium", "likes": 454, "dislikes": 77, "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": 15670, "totalSubmissionRaw": 34324}, "1994": {"acRate": 34.89856909980076, "difficulty": "Hard", "likes": 467, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1994", "paidOnly": false, "title": "The Number of Good Subsets", "titleSlug": "the-number-of-good-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7707, "totalSubmissionRaw": 22084}, "1995": {"acRate": 61.25877067776493, "difficulty": "Easy", "likes": 625, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40772, "totalSubmissionRaw": 66557}, "1996": {"acRate": 43.920007501427826, "difficulty": "Medium", "likes": 2998, "dislikes": 92, "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": 103046, "totalSubmissionRaw": 234622}, "1997": {"acRate": 37.30551053484603, "difficulty": "Medium", "likes": 483, "dislikes": 91, "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": 9207, "totalSubmissionRaw": 24680}, "1998": {"acRate": 45.6768249468462, "difficulty": "Hard", "likes": 487, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9023, "totalSubmissionRaw": 19754}, "1999": {"acRate": 49.36708860759494, "difficulty": "Medium", "likes": 28, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1999", "paidOnly": true, "title": "Smallest Greater Multiple Made of Two Digits", "titleSlug": "smallest-greater-multiple-made-of-two-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1638, "totalSubmissionRaw": 3318}, "2000": {"acRate": 86.17115874037961, "difficulty": "Easy", "likes": 1293, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252927, "totalSubmissionRaw": 293517}, "2001": {"acRate": 49.62265113077178, "difficulty": "Medium", "likes": 519, "dislikes": 47, "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": 38925, "totalSubmissionRaw": 78442}, "2002": {"acRate": 59.5554067065768, "difficulty": "Medium", "likes": 929, "dislikes": 73, "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": 28452, "totalSubmissionRaw": 47774}, "2003": {"acRate": 46.459802538787024, "difficulty": "Hard", "likes": 442, "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": 8235, "totalSubmissionRaw": 17725}, "2004": {"acRate": 42.89151692008396, "difficulty": "Hard", "likes": 117, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2004", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8378, "totalSubmissionRaw": 19533}, "2005": {"acRate": 58.91181988742964, "difficulty": "Hard", "likes": 16, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2005", "paidOnly": true, "title": "Subtree Removal Game with Fibonacci Tree", "titleSlug": "subtree-removal-game-with-fibonacci-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 628, "totalSubmissionRaw": 1066}, "2006": {"acRate": 83.80695764716384, "difficulty": "Easy", "likes": 1615, "dislikes": 41, "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": 150229, "totalSubmissionRaw": 179256}, "2007": {"acRate": 40.49104192505817, "difficulty": "Medium", "likes": 2430, "dislikes": 114, "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": 134178, "totalSubmissionRaw": 331377}, "2008": {"acRate": 44.23411881558681, "difficulty": "Medium", "likes": 1262, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30729, "totalSubmissionRaw": 69469}, "2009": {"acRate": 52.82003697229955, "difficulty": "Hard", "likes": 1848, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73432, "totalSubmissionRaw": 139023}, "2010": {"acRate": 61.98665007353773, "difficulty": "Hard", "likes": 38, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2010", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company II", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5479, "totalSubmissionRaw": 8839}, "2011": {"acRate": 89.07583689180818, "difficulty": "Easy", "likes": 1580, "dislikes": 176, "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": 376731, "totalSubmissionRaw": 422933}, "2012": {"acRate": 48.07780130360776, "difficulty": "Medium", "likes": 602, "dislikes": 62, "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": 23161, "totalSubmissionRaw": 48174}, "2013": {"acRate": 50.90577601924047, "difficulty": "Medium", "likes": 845, "dislikes": 228, "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": 65615, "totalSubmissionRaw": 128895}, "2014": {"acRate": 55.481586402266295, "difficulty": "Hard", "likes": 455, "dislikes": 79, "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": 7834, "totalSubmissionRaw": 14120}, "2015": {"acRate": 59.27042508290624, "difficulty": "Medium", "likes": 51, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1966, "totalSubmissionRaw": 3317}, "2016": {"acRate": 56.28985665231373, "difficulty": "Easy", "likes": 993, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2016", "paidOnly": false, "title": "Maximum Difference Between Increasing Elements", "titleSlug": "maximum-difference-between-increasing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82620, "totalSubmissionRaw": 146776}, "2017": {"acRate": 45.58921406431247, "difficulty": "Medium", "likes": 896, "dislikes": 39, "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": 23974, "totalSubmissionRaw": 52587}, "2018": {"acRate": 49.33847301666252, "difficulty": "Medium", "likes": 282, "dislikes": 292, "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": 19839, "totalSubmissionRaw": 40210}, "2019": {"acRate": 33.60511969661057, "difficulty": "Hard", "likes": 265, "dislikes": 79, "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": 7089, "totalSubmissionRaw": 21095}, "2020": {"acRate": 71.58550237895327, "difficulty": "Medium", "likes": 27, "dislikes": 211, "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": 10231, "totalSubmissionRaw": 14292}, "2021": {"acRate": 62.096513008744466, "difficulty": "Medium", "likes": 150, "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": 5752, "totalSubmissionRaw": 9263}, "2022": {"acRate": 61.42453271201407, "difficulty": "Easy", "likes": 764, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2022", "paidOnly": false, "title": "Convert 1D Array Into 2D Array", "titleSlug": "convert-1d-array-into-2d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82777, "totalSubmissionRaw": 134764}, "2023": {"acRate": 74.7443745725676, "difficulty": "Medium", "likes": 691, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44810, "totalSubmissionRaw": 59951}, "2024": {"acRate": 67.17990900444696, "difficulty": "Medium", "likes": 2826, "dislikes": 41, "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": 104540, "totalSubmissionRaw": 155612}, "2025": {"acRate": 33.92517929831363, "difficulty": "Hard", "likes": 454, "dislikes": 50, "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": 8751, "totalSubmissionRaw": 25795}, "2026": {"acRate": 84.31358637814827, "difficulty": "Easy", "likes": 51, "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": 11884, "totalSubmissionRaw": 14095}, "2027": {"acRate": 54.52810339645326, "difficulty": "Easy", "likes": 468, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2027", "paidOnly": false, "title": "Minimum Moves to Convert String", "titleSlug": "minimum-moves-to-convert-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36283, "totalSubmissionRaw": 66540}, "2028": {"acRate": 46.60701749144846, "difficulty": "Medium", "likes": 477, "dislikes": 42, "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": 31202, "totalSubmissionRaw": 66947}, "2029": {"acRate": 28.173525520506924, "difficulty": "Medium", "likes": 231, "dislikes": 270, "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": 8092, "totalSubmissionRaw": 28722}, "2030": {"acRate": 39.0771912122185, "difficulty": "Hard", "likes": 478, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8520, "totalSubmissionRaw": 21801}, "2031": {"acRate": 52.10657566609791, "difficulty": "Medium", "likes": 166, "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": 3970, "totalSubmissionRaw": 7619}, "2032": {"acRate": 75.09245541838135, "difficulty": "Easy", "likes": 746, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68428, "totalSubmissionRaw": 91125}, "2033": {"acRate": 53.23565039135296, "difficulty": "Medium", "likes": 538, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22853, "totalSubmissionRaw": 42928}, "2034": {"acRate": 48.69456744552491, "difficulty": "Medium", "likes": 1150, "dislikes": 63, "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": 66751, "totalSubmissionRaw": 137081}, "2035": {"acRate": 20.21651010946868, "difficulty": "Hard", "likes": 2941, "dislikes": 179, "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": 24987, "totalSubmissionRaw": 123596}, "2036": {"acRate": 40.04626479793169, "difficulty": "Medium", "likes": 96, "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": 2943, "totalSubmissionRaw": 7349}, "2037": {"acRate": 82.225416772937, "difficulty": "Easy", "likes": 773, "dislikes": 157, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70926, "totalSubmissionRaw": 86258}, "2038": {"acRate": 62.79122270375076, "difficulty": "Medium", "likes": 1558, "dislikes": 121, "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": 141846, "totalSubmissionRaw": 225901}, "2039": {"acRate": 51.73787507766529, "difficulty": "Medium", "likes": 648, "dislikes": 58, "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": 14156, "totalSubmissionRaw": 27361}, "2040": {"acRate": 29.09625275532697, "difficulty": "Hard", "likes": 678, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2040", "paidOnly": false, "title": "Kth Smallest Product of Two Sorted Arrays", "titleSlug": "kth-smallest-product-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11484, "totalSubmissionRaw": 39469}, "2041": {"acRate": 78.21681068342498, "difficulty": "Medium", "likes": 51, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9957, "totalSubmissionRaw": 12730}, "2042": {"acRate": 69.4723816225266, "difficulty": "Easy", "likes": 604, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57264, "totalSubmissionRaw": 82427}, "2043": {"acRate": 64.07380607814761, "difficulty": "Medium", "likes": 252, "dislikes": 215, "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": 26564, "totalSubmissionRaw": 41458}, "2044": {"acRate": 77.45127683553699, "difficulty": "Medium", "likes": 612, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2044", "paidOnly": false, "title": "Count Number of Maximum Bitwise-OR Subsets", "titleSlug": "count-number-of-maximum-bitwise-or-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28176, "totalSubmissionRaw": 36379}, "2045": {"acRate": 40.663870667096816, "difficulty": "Hard", "likes": 690, "dislikes": 12, "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": 11344, "totalSubmissionRaw": 27897}, "2046": {"acRate": 67.08747352989086, "difficulty": "Medium", "likes": 164, "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": 8237, "totalSubmissionRaw": 12278}, "2047": {"acRate": 29.007595591968382, "difficulty": "Easy", "likes": 291, "dislikes": 796, "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": 29139, "totalSubmissionRaw": 100453}, "2048": {"acRate": 48.387909319899244, "difficulty": "Medium", "likes": 193, "dislikes": 277, "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": 13447, "totalSubmissionRaw": 27790}, "2049": {"acRate": 49.46069100767146, "difficulty": "Medium", "likes": 1014, "dislikes": 78, "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": 25725, "totalSubmissionRaw": 52011}, "2050": {"acRate": 67.35396377851966, "difficulty": "Hard", "likes": 1490, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2050", "paidOnly": false, "title": "Parallel Courses III", "titleSlug": "parallel-courses-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77876, "totalSubmissionRaw": 115622}, "2051": {"acRate": 70.01347103726987, "difficulty": "Medium", "likes": 55, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7796, "totalSubmissionRaw": 11135}, "2052": {"acRate": 49.37759336099585, "difficulty": "Medium", "likes": 43, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2052", "paidOnly": true, "title": "Minimum Cost to Separate Sentence Into Rows", "titleSlug": "minimum-cost-to-separate-sentence-into-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1785, "totalSubmissionRaw": 3615}, "2053": {"acRate": 72.83895337489523, "difficulty": "Easy", "likes": 748, "dislikes": 32, "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": 63442, "totalSubmissionRaw": 87099}, "2054": {"acRate": 46.536513035957, "difficulty": "Medium", "likes": 825, "dislikes": 24, "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": 18831, "totalSubmissionRaw": 40465}, "2055": {"acRate": 44.620364506368304, "difficulty": "Medium", "likes": 1186, "dislikes": 60, "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": 50727, "totalSubmissionRaw": 113687}, "2056": {"acRate": 52.75822347369768, "difficulty": "Hard", "likes": 58, "dislikes": 286, "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": 4122, "totalSubmissionRaw": 7813}, "2057": {"acRate": 72.78555801247177, "difficulty": "Easy", "likes": 410, "dislikes": 136, "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": 62212, "totalSubmissionRaw": 85473}, "2058": {"acRate": 58.403299455000734, "difficulty": "Medium", "likes": 665, "dislikes": 26, "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": 35685, "totalSubmissionRaw": 61101}, "2059": {"acRate": 49.05265674496444, "difficulty": "Medium", "likes": 634, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2059", "paidOnly": false, "title": "Minimum Operations to Convert Number", "titleSlug": "minimum-operations-to-convert-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16414, "totalSubmissionRaw": 33462}, "2060": {"acRate": 43.46761322987177, "difficulty": "Hard", "likes": 303, "dislikes": 149, "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": 15797, "totalSubmissionRaw": 36342}, "2061": {"acRate": 62.50365390236773, "difficulty": "Medium", "likes": 120, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2061", "paidOnly": true, "title": "Number of Spaces Cleaning Robot Cleaned", "titleSlug": "number-of-spaces-cleaning-robot-cleaned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8553, "totalSubmissionRaw": 13684}, "2062": {"acRate": 67.69391927281329, "difficulty": "Easy", "likes": 926, "dislikes": 229, "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": 40066, "totalSubmissionRaw": 59187}, "2063": {"acRate": 53.97975852939519, "difficulty": "Medium", "likes": 821, "dislikes": 26, "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": 28748, "totalSubmissionRaw": 53257}, "2064": {"acRate": 52.429605642714904, "difficulty": "Medium", "likes": 1020, "dislikes": 40, "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": 28172, "totalSubmissionRaw": 53733}, "2065": {"acRate": 58.393598592130225, "difficulty": "Hard", "likes": 624, "dislikes": 46, "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": 21236, "totalSubmissionRaw": 36367}, "2066": {"acRate": 82.05604172191285, "difficulty": "Medium", "likes": 70, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2066", "paidOnly": true, "title": "Account Balance", "titleSlug": "account-balance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9283, "totalSubmissionRaw": 11313}, "2067": {"acRate": 47.09916589434662, "difficulty": "Medium", "likes": 100, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2541, "totalSubmissionRaw": 5395}, "2068": {"acRate": 63.76696591420517, "difficulty": "Easy", "likes": 523, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53841, "totalSubmissionRaw": 84434}, "2069": {"acRate": 24.767360299275193, "difficulty": "Medium", "likes": 164, "dislikes": 306, "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": 10593, "totalSubmissionRaw": 42767}, "2070": {"acRate": 49.474218796678024, "difficulty": "Medium", "likes": 579, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16561, "totalSubmissionRaw": 33474}, "2071": {"acRate": 33.74209618700901, "difficulty": "Hard", "likes": 517, "dislikes": 21, "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": 8805, "totalSubmissionRaw": 26095}, "2072": {"acRate": 73.58043095270362, "difficulty": "Easy", "likes": 64, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10859, "totalSubmissionRaw": 14758}, "2073": {"acRate": 69.83768510843923, "difficulty": "Easy", "likes": 1612, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208117, "totalSubmissionRaw": 298001}, "2074": {"acRate": 57.671945752326025, "difficulty": "Medium", "likes": 686, "dislikes": 335, "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": 25600, "totalSubmissionRaw": 44389}, "2075": {"acRate": 48.927632980612174, "difficulty": "Medium", "likes": 246, "dislikes": 58, "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": 13779, "totalSubmissionRaw": 28162}, "2076": {"acRate": 54.98143064750525, "difficulty": "Hard", "likes": 602, "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": 17025, "totalSubmissionRaw": 30965}, "2077": {"acRate": 54.93135155561154, "difficulty": "Medium", "likes": 124, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4361, "totalSubmissionRaw": 7939}, "2078": {"acRate": 66.11899824533418, "difficulty": "Easy", "likes": 892, "dislikes": 25, "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": 53885, "totalSubmissionRaw": 81497}, "2079": {"acRate": 79.58284418570992, "difficulty": "Medium", "likes": 893, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49487, "totalSubmissionRaw": 62183}, "2080": {"acRate": 39.83772586028312, "difficulty": "Medium", "likes": 640, "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": 20769, "totalSubmissionRaw": 52134}, "2081": {"acRate": 42.18537966841701, "difficulty": "Hard", "likes": 122, "dislikes": 149, "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": 7150, "totalSubmissionRaw": 16949}, "2082": {"acRate": 77.2481301485541, "difficulty": "Easy", "likes": 96, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2082", "paidOnly": true, "title": "The Number of Rich Customers", "titleSlug": "the-number-of-rich-customers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22412, "totalSubmissionRaw": 29013}, "2083": {"acRate": 68.55000528038863, "difficulty": "Medium", "likes": 110, "dislikes": 8, "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": 6491, "totalSubmissionRaw": 9469}, "2084": {"acRate": 86.60139139397063, "difficulty": "Medium", "likes": 79, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10083, "totalSubmissionRaw": 11643}, "2085": {"acRate": 70.27334973218754, "difficulty": "Easy", "likes": 784, "dislikes": 17, "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": 65993, "totalSubmissionRaw": 93909}, "2086": {"acRate": 46.11745059838575, "difficulty": "Medium", "likes": 529, "dislikes": 27, "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": 19881, "totalSubmissionRaw": 43112}, "2087": {"acRate": 50.89118604048489, "difficulty": "Medium", "likes": 661, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17674, "totalSubmissionRaw": 34729}, "2088": {"acRate": 64.53622207176709, "difficulty": "Hard", "likes": 362, "dislikes": 17, "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": 9532, "totalSubmissionRaw": 14770}, "2089": {"acRate": 76.27458105150234, "difficulty": "Easy", "likes": 1764, "dislikes": 90, "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": 176326, "totalSubmissionRaw": 231172}, "2090": {"acRate": 46.25850599179769, "difficulty": "Medium", "likes": 1875, "dislikes": 92, "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": 121478, "totalSubmissionRaw": 262608}, "2091": {"acRate": 54.76961169931522, "difficulty": "Medium", "likes": 943, "dislikes": 51, "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": 42470, "totalSubmissionRaw": 77543}, "2092": {"acRate": 45.794535623714054, "difficulty": "Hard", "likes": 1556, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95706, "totalSubmissionRaw": 208990}, "2093": {"acRate": 56.019968676585755, "difficulty": "Medium", "likes": 195, "dislikes": 12, "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": 5723, "totalSubmissionRaw": 10216}, "2094": {"acRate": 60.19024646448927, "difficulty": "Easy", "likes": 656, "dislikes": 260, "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": 30942, "totalSubmissionRaw": 51407}, "2095": {"acRate": 59.012882174870555, "difficulty": "Medium", "likes": 4079, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2095", "paidOnly": false, "title": "Delete the Middle Node of a Linked List", "titleSlug": "delete-the-middle-node-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 400606, "totalSubmissionRaw": 678845}, "2096": {"acRate": 48.90368573479542, "difficulty": "Medium", "likes": 2337, "dislikes": 115, "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": 98781, "totalSubmissionRaw": 201991}, "2097": {"acRate": 43.24460070316424, "difficulty": "Hard", "likes": 499, "dislikes": 25, "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": 10332, "totalSubmissionRaw": 23892}, "2098": {"acRate": 36.48988387405723, "difficulty": "Medium", "likes": 80, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3048, "totalSubmissionRaw": 8353}, "2099": {"acRate": 43.56148746542565, "difficulty": "Easy", "likes": 1233, "dislikes": 125, "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": 49610, "totalSubmissionRaw": 113885}, "2100": {"acRate": 49.54580650034938, "difficulty": "Medium", "likes": 878, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2100", "paidOnly": false, "title": "Find Good Days to Rob the Bank", "titleSlug": "find-good-days-to-rob-the-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26235, "totalSubmissionRaw": 52951}, "2101": {"acRate": 48.6930722564179, "difficulty": "Medium", "likes": 3014, "dislikes": 150, "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": 120957, "totalSubmissionRaw": 248407}, "2102": {"acRate": 64.65543248717837, "difficulty": "Hard", "likes": 373, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2102", "paidOnly": false, "title": "Sequentially Ordinal Rank Tracker", "titleSlug": "sequentially-ordinal-rank-tracker", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15002, "totalSubmissionRaw": 23203}, "2103": {"acRate": 80.75317504141358, "difficulty": "Easy", "likes": 947, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2103", "paidOnly": false, "title": "Rings and Rods", "titleSlug": "rings-and-rods", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73116, "totalSubmissionRaw": 90544}, "2104": {"acRate": 61.13144930624157, "difficulty": "Medium", "likes": 2310, "dislikes": 112, "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": 94680, "totalSubmissionRaw": 154880}, "2105": {"acRate": 48.415819544409, "difficulty": "Medium", "likes": 271, "dislikes": 159, "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": 19575, "totalSubmissionRaw": 40431}, "2106": {"acRate": 36.14413325273692, "difficulty": "Hard", "likes": 542, "dislikes": 18, "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": 10763, "totalSubmissionRaw": 29778}, "2107": {"acRate": 55.56505385535989, "difficulty": "Medium", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3250, "totalSubmissionRaw": 5849}, "2108": {"acRate": 83.88184255716567, "difficulty": "Easy", "likes": 1510, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2108", "paidOnly": false, "title": "Find First Palindromic String in the Array", "titleSlug": "find-first-palindromic-string-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278425, "totalSubmissionRaw": 331926}, "2109": {"acRate": 58.730201234452196, "difficulty": "Medium", "likes": 551, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43865, "totalSubmissionRaw": 74689}, "2110": {"acRate": 58.929696715086685, "difficulty": "Medium", "likes": 707, "dislikes": 30, "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": 36471, "totalSubmissionRaw": 61889}, "2111": {"acRate": 38.5095246789605, "difficulty": "Hard", "likes": 692, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12655, "totalSubmissionRaw": 32862}, "2112": {"acRate": 69.71390441237801, "difficulty": "Medium", "likes": 60, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2112", "paidOnly": true, "title": "The Airport With the Most Traffic", "titleSlug": "the-airport-with-the-most-traffic", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8358, "totalSubmissionRaw": 11989}, "2113": {"acRate": 73.59723289777095, "difficulty": "Medium", "likes": 59, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2113", "paidOnly": true, "title": "Elements in Array After Removing and Replacing Elements", "titleSlug": "elements-in-array-after-removing-and-replacing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1915, "totalSubmissionRaw": 2602}, "2114": {"acRate": 86.45466602363155, "difficulty": "Easy", "likes": 1726, "dislikes": 58, "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": 286822, "totalSubmissionRaw": 331760}, "2115": {"acRate": 49.80248042710508, "difficulty": "Medium", "likes": 1837, "dislikes": 89, "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": 90392, "totalSubmissionRaw": 181501}, "2116": {"acRate": 31.828366148877844, "difficulty": "Medium", "likes": 1136, "dislikes": 42, "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": 25428, "totalSubmissionRaw": 79891}, "2117": {"acRate": 26.113861386138616, "difficulty": "Hard", "likes": 87, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3376, "totalSubmissionRaw": 12928}, "2118": {"acRate": 55.34258647279137, "difficulty": "Hard", "likes": 23, "dislikes": 35, "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": 2512, "totalSubmissionRaw": 4539}, "2119": {"acRate": 79.77481617647058, "difficulty": "Easy", "likes": 668, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2119", "paidOnly": false, "title": "A Number After a Double Reversal", "titleSlug": "a-number-after-a-double-reversal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86795, "totalSubmissionRaw": 108800}, "2120": {"acRate": 82.56655363007664, "difficulty": "Medium", "likes": 531, "dislikes": 50, "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": 30922, "totalSubmissionRaw": 37451}, "2121": {"acRate": 44.16506500847937, "difficulty": "Medium", "likes": 885, "dislikes": 37, "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": 19532, "totalSubmissionRaw": 44225}, "2122": {"acRate": 39.06198026388735, "difficulty": "Hard", "likes": 368, "dislikes": 32, "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": 10569, "totalSubmissionRaw": 27057}, "2123": {"acRate": 41.37931034482759, "difficulty": "Hard", "likes": 50, "dislikes": 11, "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": 888, "totalSubmissionRaw": 2146}, "2124": {"acRate": 71.40279741090693, "difficulty": "Easy", "likes": 717, "dislikes": 18, "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": 76778, "totalSubmissionRaw": 107528}, "2125": {"acRate": 85.67897007178263, "difficulty": "Medium", "likes": 1837, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205178, "totalSubmissionRaw": 239473}, "2126": {"acRate": 51.51612176408506, "difficulty": "Medium", "likes": 539, "dislikes": 187, "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": 43441, "totalSubmissionRaw": 84325}, "2127": {"acRate": 37.07994697100697, "difficulty": "Hard", "likes": 1020, "dislikes": 32, "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": 12866, "totalSubmissionRaw": 34698}, "2128": {"acRate": 76.25602202339986, "difficulty": "Medium", "likes": 473, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33240, "totalSubmissionRaw": 43590}, "2129": {"acRate": 64.17508486993489, "difficulty": "Easy", "likes": 722, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62194, "totalSubmissionRaw": 96913}, "2130": {"acRate": 80.90720041590849, "difficulty": "Medium", "likes": 3447, "dislikes": 97, "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": 280125, "totalSubmissionRaw": 346230}, "2131": {"acRate": 48.06183959169696, "difficulty": "Medium", "likes": 2412, "dislikes": 58, "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": 116487, "totalSubmissionRaw": 242369}, "2132": {"acRate": 32.45589856670342, "difficulty": "Hard", "likes": 382, "dislikes": 42, "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": 7065, "totalSubmissionRaw": 21768}, "2133": {"acRate": 51.71443356702843, "difficulty": "Easy", "likes": 954, "dislikes": 51, "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": 72952, "totalSubmissionRaw": 141067}, "2134": {"acRate": 52.424612494128695, "difficulty": "Medium", "likes": 1090, "dislikes": 15, "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": 27903, "totalSubmissionRaw": 53225}, "2135": {"acRate": 42.93704342532468, "difficulty": "Medium", "likes": 676, "dislikes": 156, "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": 33855, "totalSubmissionRaw": 78848}, "2136": {"acRate": 71.77923177170803, "difficulty": "Hard", "likes": 1559, "dislikes": 80, "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": 53426, "totalSubmissionRaw": 74431}, "2137": {"acRate": 67.69960915689559, "difficulty": "Medium", "likes": 98, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2137", "paidOnly": true, "title": "Pour Water Between Buckets to Make Water Levels Equal", "titleSlug": "pour-water-between-buckets-to-make-water-levels-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2425, "totalSubmissionRaw": 3582}, "2138": {"acRate": 66.59896153681109, "difficulty": "Easy", "likes": 458, "dislikes": 21, "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": 46560, "totalSubmissionRaw": 69911}, "2139": {"acRate": 50.65216878552727, "difficulty": "Medium", "likes": 966, "dislikes": 24, "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": 42950, "totalSubmissionRaw": 84794}, "2140": {"acRate": 54.97788880446488, "difficulty": "Medium", "likes": 2309, "dislikes": 58, "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": 100576, "totalSubmissionRaw": 182939}, "2141": {"acRate": 49.99166527754626, "difficulty": "Hard", "likes": 1994, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2141", "paidOnly": false, "title": "Maximum Running Time of N Computers", "titleSlug": "maximum-running-time-of-n-computers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59980, "totalSubmissionRaw": 119980}, "2142": {"acRate": 48.089381794224224, "difficulty": "Medium", "likes": 105, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2142", "paidOnly": true, "title": "The Number of Passengers in Each Bus I", "titleSlug": "the-number-of-passengers-in-each-bus-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8759, "totalSubmissionRaw": 18214}, "2143": {"acRate": 50.721752115480335, "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": 1019, "totalSubmissionRaw": 2009}, "2144": {"acRate": 61.107291523432124, "difficulty": "Easy", "likes": 580, "dislikes": 18, "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": 48884, "totalSubmissionRaw": 79997}, "2145": {"acRate": 38.07581936263404, "difficulty": "Medium", "likes": 513, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2145", "paidOnly": false, "title": "Count the Hidden Sequences", "titleSlug": "count-the-hidden-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17647, "totalSubmissionRaw": 46347}, "2146": {"acRate": 42.849589536663416, "difficulty": "Medium", "likes": 495, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "2146", "paidOnly": false, "title": "K Highest Ranked Items Within a Price Range", "titleSlug": "k-highest-ranked-items-within-a-price-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15398, "totalSubmissionRaw": 35935}, "2147": {"acRate": 49.51542174890371, "difficulty": "Hard", "likes": 1044, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "2147", "paidOnly": false, "title": "Number of Ways to Divide a Long Corridor", "titleSlug": "number-of-ways-to-divide-a-long-corridor", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67185, "totalSubmissionRaw": 135685}, "2148": {"acRate": 59.386452115234874, "difficulty": "Easy", "likes": 643, "dislikes": 39, "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": 57204, "totalSubmissionRaw": 96325}, "2149": {"acRate": 84.00630182826296, "difficulty": "Medium", "likes": 3136, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "2149", "paidOnly": false, "title": "Rearrange Array Elements by Sign", "titleSlug": "rearrange-array-elements-by-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343926, "totalSubmissionRaw": 409405}, "2150": {"acRate": 60.69023784531093, "difficulty": "Medium", "likes": 634, "dislikes": 60, "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": 47410, "totalSubmissionRaw": 78118}, "2151": {"acRate": 49.93709732758949, "difficulty": "Hard", "likes": 501, "dislikes": 78, "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": 13099, "totalSubmissionRaw": 26231}, "2152": {"acRate": 44.396843291995495, "difficulty": "Medium", "likes": 70, "dislikes": 13, "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": 1969, "totalSubmissionRaw": 4435}, "2153": {"acRate": 39.97260273972603, "difficulty": "Hard", "likes": 76, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2918, "totalSubmissionRaw": 7300}, "2154": {"acRate": 71.2919363194235, "difficulty": "Easy", "likes": 702, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92204, "totalSubmissionRaw": 129333}, "2155": {"acRate": 64.13875598086123, "difficulty": "Medium", "likes": 497, "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": 29491, "totalSubmissionRaw": 45980}, "2156": {"acRate": 23.451983354467682, "difficulty": "Hard", "likes": 419, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13131, "totalSubmissionRaw": 55991}, "2157": {"acRate": 26.073465280107342, "difficulty": "Hard", "likes": 463, "dislikes": 55, "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": 9327, "totalSubmissionRaw": 35772}, "2158": {"acRate": 55.21687940346484, "difficulty": "Hard", "likes": 418, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29546, "totalSubmissionRaw": 53509}, "2159": {"acRate": 60.06319115323855, "difficulty": "Medium", "likes": 71, "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": 7604, "totalSubmissionRaw": 12660}, "2160": {"acRate": 86.11520622547138, "difficulty": "Easy", "likes": 1389, "dislikes": 138, "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": 127925, "totalSubmissionRaw": 148551}, "2161": {"acRate": 84.84872280993034, "difficulty": "Medium", "likes": 1080, "dislikes": 84, "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": 75635, "totalSubmissionRaw": 89141}, "2162": {"acRate": 41.045727819274916, "difficulty": "Medium", "likes": 207, "dislikes": 619, "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": 15771, "totalSubmissionRaw": 38423}, "2163": {"acRate": 47.9219021844191, "difficulty": "Hard", "likes": 662, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2163", "paidOnly": false, "title": "Minimum Difference in Sums After Removal of Elements", "titleSlug": "minimum-difference-in-sums-after-removal-of-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9916, "totalSubmissionRaw": 20692}, "2164": {"acRate": 62.63475279831482, "difficulty": "Easy", "likes": 718, "dislikes": 61, "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": 60658, "totalSubmissionRaw": 96844}, "2165": {"acRate": 52.05164695069525, "difficulty": "Medium", "likes": 624, "dislikes": 22, "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": 35113, "totalSubmissionRaw": 67458}, "2166": {"acRate": 32.424970160629286, "difficulty": "Medium", "likes": 585, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2166", "paidOnly": false, "title": "Design Bitset", "titleSlug": "design-bitset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22548, "totalSubmissionRaw": 69539}, "2167": {"acRate": 41.26833564822657, "difficulty": "Hard", "likes": 656, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12182, "totalSubmissionRaw": 29519}, "2168": {"acRate": 59.67704728950404, "difficulty": "Medium", "likes": 72, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2587, "totalSubmissionRaw": 4335}, "2169": {"acRate": 74.40248687764358, "difficulty": "Easy", "likes": 597, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2169", "paidOnly": false, "title": "Count Operations to Obtain Zero", "titleSlug": "count-operations-to-obtain-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73000, "totalSubmissionRaw": 98115}, "2170": {"acRate": 33.30324094971563, "difficulty": "Medium", "likes": 573, "dislikes": 329, "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": 22134, "totalSubmissionRaw": 66462}, "2171": {"acRate": 42.72077540630507, "difficulty": "Medium", "likes": 857, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26181, "totalSubmissionRaw": 61284}, "2172": {"acRate": 48.87668857906523, "difficulty": "Hard", "likes": 506, "dislikes": 28, "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": 13532, "totalSubmissionRaw": 27686}, "2173": {"acRate": 52.29139388168075, "difficulty": "Hard", "likes": 97, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4393, "totalSubmissionRaw": 8401}, "2174": {"acRate": 67.63021543496046, "difficulty": "Medium", "likes": 91, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2174", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips II", "titleSlug": "remove-all-ones-with-row-and-column-flips-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4960, "totalSubmissionRaw": 7334}, "2175": {"acRate": 60.44746698206189, "difficulty": "Medium", "likes": 39, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2175", "paidOnly": true, "title": "The Change in Global Rankings", "titleSlug": "the-change-in-global-rankings", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6133, "totalSubmissionRaw": 10146}, "2176": {"acRate": 79.46542392008527, "difficulty": "Easy", "likes": 634, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2176", "paidOnly": false, "title": "Count Equal and Divisible Pairs in an Array", "titleSlug": "count-equal-and-divisible-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76050, "totalSubmissionRaw": 95702}, "2177": {"acRate": 64.4346594494538, "difficulty": "Medium", "likes": 660, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45949, "totalSubmissionRaw": 71311}, "2178": {"acRate": 59.202993988550865, "difficulty": "Medium", "likes": 776, "dislikes": 72, "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": 45401, "totalSubmissionRaw": 76687}, "2179": {"acRate": 40.9188580783792, "difficulty": "Hard", "likes": 606, "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": 7998, "totalSubmissionRaw": 19546}, "2180": {"acRate": 66.93950932987906, "difficulty": "Easy", "likes": 610, "dislikes": 29, "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": 59945, "totalSubmissionRaw": 89551}, "2181": {"acRate": 85.76128979188945, "difficulty": "Medium", "likes": 1711, "dislikes": 35, "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": 114686, "totalSubmissionRaw": 133727}, "2182": {"acRate": 53.99570729759409, "difficulty": "Medium", "likes": 648, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21635, "totalSubmissionRaw": 40068}, "2183": {"acRate": 29.586584456448588, "difficulty": "Hard", "likes": 830, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2183", "paidOnly": false, "title": "Count Array Pairs Divisible by K", "titleSlug": "count-array-pairs-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16267, "totalSubmissionRaw": 54981}, "2184": {"acRate": 49.33224866110772, "difficulty": "Medium", "likes": 165, "dislikes": 117, "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": 7277, "totalSubmissionRaw": 14751}, "2185": {"acRate": 78.01845499622097, "difficulty": "Easy", "likes": 683, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2185", "paidOnly": false, "title": "Counting Words With a Given Prefix", "titleSlug": "counting-words-with-a-given-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93935, "totalSubmissionRaw": 120401}, "2186": {"acRate": 72.57669866365518, "difficulty": "Medium", "likes": 568, "dislikes": 24, "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": 42416, "totalSubmissionRaw": 58443}, "2187": {"acRate": 38.82969965561242, "difficulty": "Medium", "likes": 2766, "dislikes": 177, "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": 113201, "totalSubmissionRaw": 291531}, "2188": {"acRate": 41.56742494473365, "difficulty": "Hard", "likes": 558, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2188", "paidOnly": false, "title": "Minimum Time to Finish the Race", "titleSlug": "minimum-time-to-finish-the-race", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11658, "totalSubmissionRaw": 28046}, "2189": {"acRate": 63.46037507562009, "difficulty": "Medium", "likes": 66, "dislikes": 16, "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": 2098, "totalSubmissionRaw": 3306}, "2190": {"acRate": 58.94540798510069, "difficulty": "Easy", "likes": 363, "dislikes": 227, "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": 35448, "totalSubmissionRaw": 60137}, "2191": {"acRate": 46.67484488900423, "difficulty": "Medium", "likes": 369, "dislikes": 48, "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": 19785, "totalSubmissionRaw": 42389}, "2192": {"acRate": 52.15505445788408, "difficulty": "Medium", "likes": 1068, "dislikes": 20, "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": 38117, "totalSubmissionRaw": 73084}, "2193": {"acRate": 50.91564495672103, "difficulty": "Hard", "likes": 949, "dislikes": 71, "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": 22882, "totalSubmissionRaw": 44941}, "2194": {"acRate": 83.94439259699176, "difficulty": "Easy", "likes": 603, "dislikes": 94, "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": 69260, "totalSubmissionRaw": 82507}, "2195": {"acRate": 25.35008976660682, "difficulty": "Medium", "likes": 740, "dislikes": 302, "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": 31770, "totalSubmissionRaw": 125325}, "2196": {"acRate": 72.57544369220254, "difficulty": "Medium", "likes": 928, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33982, "totalSubmissionRaw": 46822}, "2197": {"acRate": 38.82697785028897, "difficulty": "Hard", "likes": 422, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2197", "paidOnly": false, "title": "Replace Non-Coprime Numbers in Array", "titleSlug": "replace-non-coprime-numbers-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14041, "totalSubmissionRaw": 36163}, "2198": {"acRate": 55.07319535588087, "difficulty": "Medium", "likes": 27, "dislikes": 11, "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": 1091, "totalSubmissionRaw": 1981}, "2199": {"acRate": 48.557068741893644, "difficulty": "Hard", "likes": 44, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2199", "paidOnly": true, "title": "Finding the Topic of Each Post", "titleSlug": "finding-the-topic-of-each-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2995, "totalSubmissionRaw": 6168}, "2200": {"acRate": 65.6925970710735, "difficulty": "Easy", "likes": 407, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39116, "totalSubmissionRaw": 59544}, "2201": {"acRate": 56.23731957567677, "difficulty": "Medium", "likes": 211, "dislikes": 197, "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": 19403, "totalSubmissionRaw": 34502}, "2202": {"acRate": 22.950993248031015, "difficulty": "Medium", "likes": 605, "dislikes": 317, "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": 28179, "totalSubmissionRaw": 122779}, "2203": {"acRate": 36.908437834772194, "difficulty": "Hard", "likes": 665, "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": 11714, "totalSubmissionRaw": 31738}, "2204": {"acRate": 69.34097421203438, "difficulty": "Hard", "likes": 109, "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": 3146, "totalSubmissionRaw": 4537}, "2205": {"acRate": 49.78899462143153, "difficulty": "Easy", "likes": 26, "dislikes": 75, "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": 6017, "totalSubmissionRaw": 12085}, "2206": {"acRate": 73.43168626283672, "difficulty": "Easy", "likes": 707, "dislikes": 33, "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": 78942, "totalSubmissionRaw": 107504}, "2207": {"acRate": 34.57446808510639, "difficulty": "Medium", "likes": 492, "dislikes": 32, "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": 19110, "totalSubmissionRaw": 55272}, "2208": {"acRate": 46.52794051022481, "difficulty": "Medium", "likes": 585, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29783, "totalSubmissionRaw": 64011}, "2209": {"acRate": 36.31872655749703, "difficulty": "Hard", "likes": 498, "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": 11910, "totalSubmissionRaw": 32793}, "2210": {"acRate": 60.50052058203611, "difficulty": "Easy", "likes": 671, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2210", "paidOnly": false, "title": "Count Hills and Valleys in an Array", "titleSlug": "count-hills-and-valleys-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47648, "totalSubmissionRaw": 78757}, "2211": {"acRate": 43.757235517071855, "difficulty": "Medium", "likes": 658, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27592, "totalSubmissionRaw": 63057}, "2212": {"acRate": 49.92133726647001, "difficulty": "Medium", "likes": 489, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15231, "totalSubmissionRaw": 30510}, "2213": {"acRate": 32.10704653896688, "difficulty": "Hard", "likes": 289, "dislikes": 83, "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": 4643, "totalSubmissionRaw": 14461}, "2214": {"acRate": 57.64727884795212, "difficulty": "Medium", "likes": 312, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30824, "totalSubmissionRaw": 53470}, "2215": {"acRate": 78.78854504479746, "difficulty": "Easy", "likes": 2285, "dislikes": 95, "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": 329681, "totalSubmissionRaw": 418438}, "2216": {"acRate": 48.17994505494506, "difficulty": "Medium", "likes": 782, "dislikes": 93, "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": 32269, "totalSubmissionRaw": 66976}, "2217": {"acRate": 36.84875435848198, "difficulty": "Medium", "likes": 609, "dislikes": 285, "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": 21876, "totalSubmissionRaw": 59367}, "2218": {"acRate": 60.565794323626974, "difficulty": "Hard", "likes": 2279, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2218", "paidOnly": false, "title": "Maximum Value of K Coins From Piles", "titleSlug": "maximum-value-of-k-coins-from-piles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65726, "totalSubmissionRaw": 108520}, "2219": {"acRate": 62.1260929590428, "difficulty": "Medium", "likes": 64, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4050, "totalSubmissionRaw": 6519}, "2220": {"acRate": 84.34712330151032, "difficulty": "Easy", "likes": 889, "dislikes": 19, "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": 83490, "totalSubmissionRaw": 98984}, "2221": {"acRate": 78.71634941013535, "difficulty": "Medium", "likes": 1081, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2221", "paidOnly": false, "title": "Find Triangular Sum of an Array", "titleSlug": "find-triangular-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77867, "totalSubmissionRaw": 98921}, "2222": {"acRate": 50.59419857733101, "difficulty": "Medium", "likes": 964, "dislikes": 49, "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": 35634, "totalSubmissionRaw": 70431}, "2223": {"acRate": 39.91167129813418, "difficulty": "Hard", "likes": 259, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8043, "totalSubmissionRaw": 20152}, "2224": {"acRate": 65.11117774235801, "difficulty": "Easy", "likes": 443, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41259, "totalSubmissionRaw": 63367}, "2225": {"acRate": 73.4667605472067, "difficulty": "Medium", "likes": 2129, "dislikes": 153, "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": 243114, "totalSubmissionRaw": 330917}, "2226": {"acRate": 37.94405594405595, "difficulty": "Medium", "likes": 1097, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2226", "paidOnly": false, "title": "Maximum Candies Allocated to K Children", "titleSlug": "maximum-candies-allocated-to-k-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40695, "totalSubmissionRaw": 107250}, "2227": {"acRate": 40.283588286015394, "difficulty": "Hard", "likes": 325, "dislikes": 75, "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": 12614, "totalSubmissionRaw": 31313}, "2228": {"acRate": 44.67005076142132, "difficulty": "Medium", "likes": 62, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2228", "paidOnly": true, "title": "Users With Two Purchases Within Seven Days", "titleSlug": "users-with-two-purchases-within-seven-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7832, "totalSubmissionRaw": 17533}, "2229": {"acRate": 61.39430284857571, "difficulty": "Easy", "likes": 80, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5733, "totalSubmissionRaw": 9338}, "2230": {"acRate": 49.71800019118631, "difficulty": "Easy", "likes": 20, "dislikes": 42, "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": 5201, "totalSubmissionRaw": 10461}, "2231": {"acRate": 61.545304541215295, "difficulty": "Easy", "likes": 609, "dislikes": 296, "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": 42894, "totalSubmissionRaw": 69695}, "2232": {"acRate": 67.27676647103684, "difficulty": "Medium", "likes": 202, "dislikes": 332, "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": 20290, "totalSubmissionRaw": 30159}, "2233": {"acRate": 41.36832629319299, "difficulty": "Medium", "likes": 695, "dislikes": 44, "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": 29870, "totalSubmissionRaw": 72205}, "2234": {"acRate": 29.311760840998684, "difficulty": "Hard", "likes": 431, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7138, "totalSubmissionRaw": 24352}, "2235": {"acRate": 87.74298018346055, "difficulty": "Easy", "likes": 1584, "dislikes": 3101, "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": 501221, "totalSubmissionRaw": 571238}, "2236": {"acRate": 84.3137180628421, "difficulty": "Easy", "likes": 1232, "dislikes": 1504, "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": 222582, "totalSubmissionRaw": 263992}, "2237": {"acRate": 63.766891891891895, "difficulty": "Medium", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3020, "totalSubmissionRaw": 4736}, "2238": {"acRate": 71.00946667916394, "difficulty": "Medium", "likes": 66, "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": 7576, "totalSubmissionRaw": 10669}, "2239": {"acRate": 44.86591732408679, "difficulty": "Easy", "likes": 552, "dislikes": 35, "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": 57837, "totalSubmissionRaw": 128912}, "2240": {"acRate": 56.97676881048685, "difficulty": "Medium", "likes": 439, "dislikes": 33, "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": 26904, "totalSubmissionRaw": 47220}, "2241": {"acRate": 41.41362290227049, "difficulty": "Medium", "likes": 256, "dislikes": 338, "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": 20976, "totalSubmissionRaw": 50650}, "2242": {"acRate": 38.31699876679431, "difficulty": "Hard", "likes": 516, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11807, "totalSubmissionRaw": 30814}, "2243": {"acRate": 65.93417790306695, "difficulty": "Easy", "likes": 540, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38826, "totalSubmissionRaw": 58886}, "2244": {"acRate": 62.91164154103852, "difficulty": "Medium", "likes": 2764, "dislikes": 80, "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": 150233, "totalSubmissionRaw": 238800}, "2245": {"acRate": 35.97243005486782, "difficulty": "Medium", "likes": 184, "dislikes": 397, "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": 7933, "totalSubmissionRaw": 22053}, "2246": {"acRate": 54.58297558256887, "difficulty": "Hard", "likes": 2341, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2246", "paidOnly": false, "title": "Longest Path With Different Adjacent Characters", "titleSlug": "longest-path-with-different-adjacent-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72472, "totalSubmissionRaw": 132774}, "2247": {"acRate": 49.51598709298914, "difficulty": "Hard", "likes": 57, "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": 1688, "totalSubmissionRaw": 3409}, "2248": {"acRate": 67.98955158902918, "difficulty": "Easy", "likes": 702, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78086, "totalSubmissionRaw": 114850}, "2249": {"acRate": 52.62636927543883, "difficulty": "Medium", "likes": 229, "dislikes": 219, "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": 23925, "totalSubmissionRaw": 45462}, "2250": {"acRate": 34.69111547697009, "difficulty": "Medium", "likes": 495, "dislikes": 134, "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": 15892, "totalSubmissionRaw": 45808}, "2251": {"acRate": 56.6908319841827, "difficulty": "Hard", "likes": 1626, "dislikes": 41, "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": 79137, "totalSubmissionRaw": 139594}, "2252": {"acRate": 55.65760470242469, "difficulty": "Hard", "likes": 29, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1515, "totalSubmissionRaw": 2722}, "2253": {"acRate": 67.87603930461074, "difficulty": "Hard", "likes": 16, "dislikes": 12, "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": 898, "totalSubmissionRaw": 1323}, "2254": {"acRate": 64.35368754956384, "difficulty": "Hard", "likes": 79, "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": 3246, "totalSubmissionRaw": 5044}, "2255": {"acRate": 72.56665749590306, "difficulty": "Easy", "likes": 531, "dislikes": 20, "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": 60665, "totalSubmissionRaw": 83599}, "2256": {"acRate": 43.11249640553753, "difficulty": "Medium", "likes": 1495, "dislikes": 175, "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": 83959, "totalSubmissionRaw": 194744}, "2257": {"acRate": 52.455945388156856, "difficulty": "Medium", "likes": 413, "dislikes": 36, "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": 16521, "totalSubmissionRaw": 31495}, "2258": {"acRate": 35.20465146836607, "difficulty": "Hard", "likes": 710, "dislikes": 31, "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": 10717, "totalSubmissionRaw": 30442}, "2259": {"acRate": 45.283509288088354, "difficulty": "Easy", "likes": 810, "dislikes": 47, "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": 81883, "totalSubmissionRaw": 180823}, "2260": {"acRate": 51.27363378771079, "difficulty": "Medium", "likes": 936, "dislikes": 33, "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": 70753, "totalSubmissionRaw": 137991}, "2261": {"acRate": 51.19917243574441, "difficulty": "Medium", "likes": 646, "dislikes": 151, "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": 32171, "totalSubmissionRaw": 62835}, "2262": {"acRate": 55.537464865976546, "difficulty": "Hard", "likes": 1096, "dislikes": 30, "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": 32405, "totalSubmissionRaw": 58348}, "2263": {"acRate": 65.2556095304187, "difficulty": "Hard", "likes": 78, "dislikes": 8, "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": 2821, "totalSubmissionRaw": 4323}, "2264": {"acRate": 68.97386114750805, "difficulty": "Easy", "likes": 983, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2264", "paidOnly": false, "title": "Largest 3-Same-Digit Number in String", "titleSlug": "largest-3-same-digit-number-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144234, "totalSubmissionRaw": 209114}, "2265": {"acRate": 86.28457014140909, "difficulty": "Medium", "likes": 2157, "dislikes": 51, "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": 144795, "totalSubmissionRaw": 167811}, "2266": {"acRate": 47.70956907024941, "difficulty": "Medium", "likes": 857, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20028, "totalSubmissionRaw": 41979}, "2267": {"acRate": 38.60198489860855, "difficulty": "Hard", "likes": 505, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15286, "totalSubmissionRaw": 39599}, "2268": {"acRate": 70.92390546083656, "difficulty": "Medium", "likes": 228, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25417, "totalSubmissionRaw": 35837}, "2269": {"acRate": 59.805811158086705, "difficulty": "Easy", "likes": 639, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2269", "paidOnly": false, "title": "Find the K-Beauty of a Number", "titleSlug": "find-the-k-beauty-of-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57715, "totalSubmissionRaw": 96504}, "2270": {"acRate": 47.600662543643274, "difficulty": "Medium", "likes": 553, "dislikes": 51, "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": 39946, "totalSubmissionRaw": 83919}, "2271": {"acRate": 33.668705065697054, "difficulty": "Medium", "likes": 770, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16297, "totalSubmissionRaw": 48404}, "2272": {"acRate": 46.254397485012824, "difficulty": "Hard", "likes": 1841, "dislikes": 204, "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": 67975, "totalSubmissionRaw": 146959}, "2273": {"acRate": 58.11082902915171, "difficulty": "Easy", "likes": 660, "dislikes": 181, "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": 59742, "totalSubmissionRaw": 102807}, "2274": {"acRate": 51.76472508815463, "difficulty": "Medium", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31709, "totalSubmissionRaw": 61256}, "2275": {"acRate": 72.68788489835958, "difficulty": "Medium", "likes": 555, "dislikes": 16, "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": 26675, "totalSubmissionRaw": 36697}, "2276": {"acRate": 35.21121168810545, "difficulty": "Hard", "likes": 565, "dislikes": 57, "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": 17738, "totalSubmissionRaw": 50376}, "2277": {"acRate": 62.32822410147991, "difficulty": "Hard", "likes": 133, "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": 4717, "totalSubmissionRaw": 7568}, "2278": {"acRate": 73.99714052287581, "difficulty": "Easy", "likes": 509, "dislikes": 58, "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": 72458, "totalSubmissionRaw": 97920}, "2279": {"acRate": 67.45639399309766, "difficulty": "Medium", "likes": 1657, "dislikes": 69, "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": 94016, "totalSubmissionRaw": 139373}, "2280": {"acRate": 25.179870048126734, "difficulty": "Medium", "likes": 336, "dislikes": 519, "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": 26003, "totalSubmissionRaw": 103269}, "2281": {"acRate": 27.837707996680788, "difficulty": "Hard", "likes": 1169, "dislikes": 99, "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": 19122, "totalSubmissionRaw": 68691}, "2282": {"acRate": 48.27491029533535, "difficulty": "Medium", "likes": 60, "dislikes": 26, "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": 1749, "totalSubmissionRaw": 3623}, "2283": {"acRate": 72.14067983298752, "difficulty": "Easy", "likes": 588, "dislikes": 75, "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": 56326, "totalSubmissionRaw": 78078}, "2284": {"acRate": 56.734763363976846, "difficulty": "Medium", "likes": 423, "dislikes": 37, "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": 33326, "totalSubmissionRaw": 58740}, "2285": {"acRate": 61.00673975722183, "difficulty": "Medium", "likes": 723, "dislikes": 30, "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": 33218, "totalSubmissionRaw": 54451}, "2286": {"acRate": 17.27070522046317, "difficulty": "Hard", "likes": 324, "dislikes": 55, "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": 6600, "totalSubmissionRaw": 38215}, "2287": {"acRate": 59.02892713291834, "difficulty": "Easy", "likes": 464, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40302, "totalSubmissionRaw": 68275}, "2288": {"acRate": 30.177994603001583, "difficulty": "Medium", "likes": 192, "dislikes": 1093, "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": 22702, "totalSubmissionRaw": 75227}, "2289": {"acRate": 21.77729189442449, "difficulty": "Medium", "likes": 1312, "dislikes": 132, "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": 20916, "totalSubmissionRaw": 96045}, "2290": {"acRate": 53.6034264236703, "difficulty": "Hard", "likes": 929, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2290", "paidOnly": false, "title": "Minimum Obstacle Removal to Reach Corner", "titleSlug": "minimum-obstacle-removal-to-reach-corner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24530, "totalSubmissionRaw": 45762}, "2291": {"acRate": 45.29896692058854, "difficulty": "Medium", "likes": 153, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8682, "totalSubmissionRaw": 19166}, "2292": {"acRate": 39.11699521754345, "difficulty": "Medium", "likes": 60, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "2292", "paidOnly": true, "title": "Products With Three or More Orders in Two Consecutive Years", "titleSlug": "products-with-three-or-more-orders-in-two-consecutive-years", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6707, "totalSubmissionRaw": 17146}, "2293": {"acRate": 63.0555002983887, "difficulty": "Easy", "likes": 526, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47547, "totalSubmissionRaw": 75405}, "2294": {"acRate": 73.52761727021499, "difficulty": "Medium", "likes": 745, "dislikes": 26, "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": 40974, "totalSubmissionRaw": 55726}, "2295": {"acRate": 57.91474163635768, "difficulty": "Medium", "likes": 623, "dislikes": 34, "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": 35350, "totalSubmissionRaw": 61038}, "2296": {"acRate": 44.54617087538929, "difficulty": "Hard", "likes": 556, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23744, "totalSubmissionRaw": 53302}, "2297": {"acRate": 45.73745565129245, "difficulty": "Medium", "likes": 140, "dislikes": 37, "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": 4512, "totalSubmissionRaw": 9865}, "2298": {"acRate": 81.14100310936865, "difficulty": "Medium", "likes": 47, "dislikes": 9, "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": 6002, "totalSubmissionRaw": 7397}, "2299": {"acRate": 54.765043475945085, "difficulty": "Easy", "likes": 342, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41128, "totalSubmissionRaw": 75099}, "2300": {"acRate": 42.93409679524216, "difficulty": "Medium", "likes": 2521, "dislikes": 76, "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": 149363, "totalSubmissionRaw": 347889}, "2301": {"acRate": 40.79849012775842, "difficulty": "Hard", "likes": 374, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14051, "totalSubmissionRaw": 34440}, "2302": {"acRate": 54.47580254097566, "difficulty": "Hard", "likes": 1015, "dislikes": 25, "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": 28085, "totalSubmissionRaw": 51555}, "2303": {"acRate": 65.45707092629569, "difficulty": "Easy", "likes": 258, "dislikes": 275, "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": 37700, "totalSubmissionRaw": 57595}, "2304": {"acRate": 66.58, "difficulty": "Medium", "likes": 869, "dislikes": 151, "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": 29961, "totalSubmissionRaw": 45000}, "2305": {"acRate": 69.24612201171101, "difficulty": "Medium", "likes": 2538, "dislikes": 114, "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": 94370, "totalSubmissionRaw": 136282}, "2306": {"acRate": 46.45284212312653, "difficulty": "Hard", "likes": 1941, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60221, "totalSubmissionRaw": 129639}, "2307": {"acRate": 42.93133294864397, "difficulty": "Hard", "likes": 55, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2976, "totalSubmissionRaw": 6932}, "2308": {"acRate": 68.64910790144435, "difficulty": "Medium", "likes": 74, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5656, "totalSubmissionRaw": 8239}, "2309": {"acRate": 69.74208706211557, "difficulty": "Easy", "likes": 476, "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": 52838, "totalSubmissionRaw": 75762}, "2310": {"acRate": 26.66810137219336, "difficulty": "Medium", "likes": 400, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26023, "totalSubmissionRaw": 97581}, "2311": {"acRate": 37.81787357713732, "difficulty": "Medium", "likes": 680, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2311", "paidOnly": false, "title": "Longest Binary Subsequence Less Than or Equal to K", "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21861, "totalSubmissionRaw": 57806}, "2312": {"acRate": 49.687920107547534, "difficulty": "Hard", "likes": 539, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10349, "totalSubmissionRaw": 20828}, "2313": {"acRate": 59.371534195933464, "difficulty": "Hard", "likes": 95, "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": 3212, "totalSubmissionRaw": 5410}, "2314": {"acRate": 71.4755824667632, "difficulty": "Medium", "likes": 51, "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": 5430, "totalSubmissionRaw": 7597}, "2315": {"acRate": 82.20653133274493, "difficulty": "Easy", "likes": 618, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69855, "totalSubmissionRaw": 84975}, "2316": {"acRate": 49.33931152873148, "difficulty": "Medium", "likes": 2005, "dislikes": 48, "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": 87374, "totalSubmissionRaw": 177088}, "2317": {"acRate": 79.39951573849879, "difficulty": "Medium", "likes": 603, "dislikes": 163, "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": 24594, "totalSubmissionRaw": 30975}, "2318": {"acRate": 56.94808319520932, "difficulty": "Hard", "likes": 434, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2318", "paidOnly": false, "title": "Number of Distinct Roll Sequences", "titleSlug": "number-of-distinct-roll-sequences", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10651, "totalSubmissionRaw": 18703}, "2319": {"acRate": 65.19929062849812, "difficulty": "Easy", "likes": 484, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2319", "paidOnly": false, "title": "Check if Matrix Is X-Matrix", "titleSlug": "check-if-matrix-is-x-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51838, "totalSubmissionRaw": 79507}, "2320": {"acRate": 41.77726038028716, "difficulty": "Medium", "likes": 566, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2320", "paidOnly": false, "title": "Count Number of Ways to Place Houses", "titleSlug": "count-number-of-ways-to-place-houses", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26915, "totalSubmissionRaw": 64425}, "2321": {"acRate": 56.61795913417813, "difficulty": "Hard", "likes": 774, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2321", "paidOnly": false, "title": "Maximum Score Of Spliced Array", "titleSlug": "maximum-score-of-spliced-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18676, "totalSubmissionRaw": 32986}, "2322": {"acRate": 52.19473264166001, "difficulty": "Hard", "likes": 447, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7194, "totalSubmissionRaw": 13783}, "2323": {"acRate": 66.25350583551976, "difficulty": "Medium", "likes": 59, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7323, "totalSubmissionRaw": 11053}, "2324": {"acRate": 73.7458193979933, "difficulty": "Medium", "likes": 47, "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": 7056, "totalSubmissionRaw": 9568}, "2325": {"acRate": 84.11202891068663, "difficulty": "Easy", "likes": 969, "dislikes": 92, "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": 97754, "totalSubmissionRaw": 116219}, "2326": {"acRate": 75.11089753068165, "difficulty": "Medium", "likes": 735, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2326", "paidOnly": false, "title": "Spiral Matrix IV", "titleSlug": "spiral-matrix-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40638, "totalSubmissionRaw": 54104}, "2327": {"acRate": 45.59684224853682, "difficulty": "Medium", "likes": 835, "dislikes": 115, "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": 23450, "totalSubmissionRaw": 51429}, "2328": {"acRate": 58.45026871183813, "difficulty": "Hard", "likes": 1944, "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": 67105, "totalSubmissionRaw": 114807}, "2329": {"acRate": 69.49152542372882, "difficulty": "Easy", "likes": 32, "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": 6970, "totalSubmissionRaw": 10030}, "2330": {"acRate": 75.83050847457628, "difficulty": "Medium", "likes": 96, "dislikes": 30, "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": 11185, "totalSubmissionRaw": 14750}, "2331": {"acRate": 82.988299240317, "difficulty": "Easy", "likes": 1399, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2331", "paidOnly": false, "title": "Evaluate Boolean Binary Tree", "titleSlug": "evaluate-boolean-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181995, "totalSubmissionRaw": 219302}, "2332": {"acRate": 26.901453883551067, "difficulty": "Medium", "likes": 445, "dislikes": 732, "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": 23328, "totalSubmissionRaw": 86777}, "2333": {"acRate": 25.39523714228537, "difficulty": "Medium", "likes": 620, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13959, "totalSubmissionRaw": 54967}, "2334": {"acRate": 42.819001561634174, "difficulty": "Hard", "likes": 537, "dislikes": 7, "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": 8500, "totalSubmissionRaw": 19851}, "2335": {"acRate": 57.61894806743977, "difficulty": "Easy", "likes": 682, "dislikes": 77, "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": 46854, "totalSubmissionRaw": 81317}, "2336": {"acRate": 71.70843350725976, "difficulty": "Medium", "likes": 1629, "dislikes": 188, "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": 136599, "totalSubmissionRaw": 190489}, "2337": {"acRate": 47.55754981995061, "difficulty": "Medium", "likes": 650, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25225, "totalSubmissionRaw": 53041}, "2338": {"acRate": 26.80552510414383, "difficulty": "Hard", "likes": 478, "dislikes": 27, "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": 6113, "totalSubmissionRaw": 22805}, "2339": {"acRate": 87.56304447501147, "difficulty": "Easy", "likes": 42, "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": 7639, "totalSubmissionRaw": 8724}, "2340": {"acRate": 72.41635246266662, "difficulty": "Medium", "likes": 165, "dislikes": 24, "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": 24389, "totalSubmissionRaw": 33680}, "2341": {"acRate": 75.24408572223768, "difficulty": "Easy", "likes": 668, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2341", "paidOnly": false, "title": "Maximum Number of Pairs in Array", "titleSlug": "maximum-number-of-pairs-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67588, "totalSubmissionRaw": 89825}, "2342": {"acRate": 54.85479886262994, "difficulty": "Medium", "likes": 690, "dislikes": 19, "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": 47072, "totalSubmissionRaw": 85812}, "2343": {"acRate": 43.82490488864829, "difficulty": "Medium", "likes": 308, "dislikes": 426, "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": 29144, "totalSubmissionRaw": 66501}, "2344": {"acRate": 56.00073478385108, "difficulty": "Hard", "likes": 540, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27437, "totalSubmissionRaw": 48994}, "2345": {"acRate": 37.81749764816557, "difficulty": "Medium", "likes": 153, "dislikes": 69, "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": 8040, "totalSubmissionRaw": 21260}, "2346": {"acRate": 33.49475383373689, "difficulty": "Medium", "likes": 25, "dislikes": 71, "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": 4565, "totalSubmissionRaw": 13629}, "2347": {"acRate": 60.47440252696823, "difficulty": "Easy", "likes": 366, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40588, "totalSubmissionRaw": 67116}, "2348": {"acRate": 66.70575510291503, "difficulty": "Medium", "likes": 2250, "dislikes": 80, "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": 124577, "totalSubmissionRaw": 186756}, "2349": {"acRate": 44.746837921447316, "difficulty": "Medium", "likes": 392, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22854, "totalSubmissionRaw": 51074}, "2350": {"acRate": 68.39155613674575, "difficulty": "Hard", "likes": 633, "dislikes": 49, "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": 14644, "totalSubmissionRaw": 21412}, "2351": {"acRate": 73.53470542542644, "difficulty": "Easy", "likes": 1017, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116440, "totalSubmissionRaw": 158347}, "2352": {"acRate": 70.45336601077418, "difficulty": "Medium", "likes": 2154, "dislikes": 145, "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": 210426, "totalSubmissionRaw": 298675}, "2353": {"acRate": 45.245800167233156, "difficulty": "Medium", "likes": 1477, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2353", "paidOnly": false, "title": "Design a Food Rating System", "titleSlug": "design-a-food-rating-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83331, "totalSubmissionRaw": 184172}, "2354": {"acRate": 47.110953562566465, "difficulty": "Hard", "likes": 584, "dislikes": 21, "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": 14619, "totalSubmissionRaw": 31031}, "2355": {"acRate": 40.586309411808976, "difficulty": "Hard", "likes": 274, "dislikes": 32, "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": 10785, "totalSubmissionRaw": 26573}, "2356": {"acRate": 87.89907627813115, "difficulty": "Easy", "likes": 403, "dislikes": 32, "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": 157676, "totalSubmissionRaw": 179383}, "2357": {"acRate": 72.37872503942016, "difficulty": "Easy", "likes": 1154, "dislikes": 53, "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": 109247, "totalSubmissionRaw": 150938}, "2358": {"acRate": 67.8753145607171, "difficulty": "Medium", "likes": 662, "dislikes": 112, "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": 36952, "totalSubmissionRaw": 54441}, "2359": {"acRate": 45.49897731056462, "difficulty": "Medium", "likes": 1662, "dislikes": 398, "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": 76522, "totalSubmissionRaw": 168184}, "2360": {"acRate": 49.862766730350074, "difficulty": "Hard", "likes": 2310, "dislikes": 45, "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": 74122, "totalSubmissionRaw": 148652}, "2361": {"acRate": 78.81342821782178, "difficulty": "Hard", "likes": 181, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10189, "totalSubmissionRaw": 12928}, "2362": {"acRate": 73.53640095052927, "difficulty": "Hard", "likes": 31, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3404, "totalSubmissionRaw": 4629}, "2363": {"acRate": 75.57906623469155, "difficulty": "Easy", "likes": 551, "dislikes": 24, "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": 56221, "totalSubmissionRaw": 74387}, "2364": {"acRate": 41.509911879590994, "difficulty": "Medium", "likes": 968, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2364", "paidOnly": false, "title": "Count Number of Bad Pairs", "titleSlug": "count-number-of-bad-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31137, "totalSubmissionRaw": 75011}, "2365": {"acRate": 52.172005929152675, "difficulty": "Medium", "likes": 534, "dislikes": 54, "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": 34493, "totalSubmissionRaw": 66114}, "2366": {"acRate": 53.66206086877992, "difficulty": "Hard", "likes": 1975, "dislikes": 64, "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": 65362, "totalSubmissionRaw": 121803}, "2367": {"acRate": 84.01620030460944, "difficulty": "Easy", "likes": 1236, "dislikes": 76, "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": 123013, "totalSubmissionRaw": 146416}, "2368": {"acRate": 58.68745867313202, "difficulty": "Medium", "likes": 684, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53253, "totalSubmissionRaw": 90740}, "2369": {"acRate": 51.8085721610455, "difficulty": "Medium", "likes": 1979, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86898, "totalSubmissionRaw": 167729}, "2370": {"acRate": 47.55795948669, "difficulty": "Medium", "likes": 1435, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112106, "totalSubmissionRaw": 235725}, "2371": {"acRate": 65.69468267581475, "difficulty": "Hard", "likes": 93, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2681, "totalSubmissionRaw": 4081}, "2372": {"acRate": 82.736, "difficulty": "Medium", "likes": 36, "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": 5171, "totalSubmissionRaw": 6250}, "2373": {"acRate": 88.18566855737346, "difficulty": "Easy", "likes": 1161, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2373", "paidOnly": false, "title": "Largest Local Values in a Matrix", "titleSlug": "largest-local-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153451, "totalSubmissionRaw": 174009}, "2374": {"acRate": 47.43130055647983, "difficulty": "Medium", "likes": 433, "dislikes": 39, "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": 33071, "totalSubmissionRaw": 69724}, "2375": {"acRate": 75.85344767156576, "difficulty": "Medium", "likes": 928, "dislikes": 43, "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": 32463, "totalSubmissionRaw": 42797}, "2376": {"acRate": 38.42086248234637, "difficulty": "Hard", "likes": 564, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2376", "paidOnly": false, "title": "Count Special Integers", "titleSlug": "count-special-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11698, "totalSubmissionRaw": 30447}, "2377": {"acRate": 78.6136485760344, "difficulty": "Easy", "likes": 37, "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": 5852, "totalSubmissionRaw": 7444}, "2378": {"acRate": 58.0590717299578, "difficulty": "Medium", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1376, "totalSubmissionRaw": 2370}, "2379": {"acRate": 58.75492496099318, "difficulty": "Easy", "likes": 722, "dislikes": 19, "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": 52343, "totalSubmissionRaw": 89087}, "2380": {"acRate": 49.84711038630109, "difficulty": "Medium", "likes": 455, "dislikes": 108, "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": 29343, "totalSubmissionRaw": 58866}, "2381": {"acRate": 37.18172674818697, "difficulty": "Medium", "likes": 749, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21072, "totalSubmissionRaw": 56673}, "2382": {"acRate": 48.81612090680101, "difficulty": "Hard", "likes": 446, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2382", "paidOnly": false, "title": "Maximum Segment Sum After Removals", "titleSlug": "maximum-segment-sum-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8721, "totalSubmissionRaw": 17865}, "2383": {"acRate": 41.0867703169206, "difficulty": "Easy", "likes": 336, "dislikes": 274, "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": 31659, "totalSubmissionRaw": 77054}, "2384": {"acRate": 34.853071959734336, "difficulty": "Medium", "likes": 590, "dislikes": 226, "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": 36837, "totalSubmissionRaw": 105696}, "2385": {"acRate": 62.791698635776704, "difficulty": "Medium", "likes": 2640, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134215, "totalSubmissionRaw": 213746}, "2386": {"acRate": 38.73524748987141, "difficulty": "Hard", "likes": 562, "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": 8796, "totalSubmissionRaw": 22708}, "2387": {"acRate": 71.05202842081137, "difficulty": "Medium", "likes": 73, "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": 3100, "totalSubmissionRaw": 4363}, "2388": {"acRate": 50.26000725601645, "difficulty": "Medium", "likes": 79, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4156, "totalSubmissionRaw": 8269}, "2389": {"acRate": 71.68989661468939, "difficulty": "Easy", "likes": 1866, "dislikes": 167, "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": 109143, "totalSubmissionRaw": 152244}, "2390": {"acRate": 75.21577927466076, "difficulty": "Medium", "likes": 2837, "dislikes": 201, "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": 300038, "totalSubmissionRaw": 398903}, "2391": {"acRate": 85.31717747683535, "difficulty": "Medium", "likes": 1497, "dislikes": 233, "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": 129276, "totalSubmissionRaw": 151524}, "2392": {"acRate": 61.30863459814759, "difficulty": "Hard", "likes": 756, "dislikes": 10, "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": 14364, "totalSubmissionRaw": 23429}, "2393": {"acRate": 75.02913073875554, "difficulty": "Medium", "likes": 130, "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": 6439, "totalSubmissionRaw": 8582}, "2394": {"acRate": 40.341296928327644, "difficulty": "Medium", "likes": 27, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2394", "paidOnly": true, "title": "Employees With Deductions", "titleSlug": "employees-with-deductions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4137, "totalSubmissionRaw": 10255}, "2395": {"acRate": 65.05810051454816, "difficulty": "Easy", "likes": 533, "dislikes": 30, "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": 49437, "totalSubmissionRaw": 75989}, "2396": {"acRate": 87.51108438401403, "difficulty": "Medium", "likes": 590, "dislikes": 1530, "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": 85858, "totalSubmissionRaw": 98111}, "2397": {"acRate": 54.821162444113256, "difficulty": "Medium", "likes": 259, "dislikes": 402, "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": 14714, "totalSubmissionRaw": 26840}, "2398": {"acRate": 34.319271412219436, "difficulty": "Hard", "likes": 790, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2398", "paidOnly": false, "title": "Maximum Number of Robots Within Budget", "titleSlug": "maximum-number-of-robots-within-budget", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20688, "totalSubmissionRaw": 60281}, "2399": {"acRate": 70.47287981460295, "difficulty": "Easy", "likes": 477, "dislikes": 56, "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": 48047, "totalSubmissionRaw": 68178}, "2400": {"acRate": 35.11543554608786, "difficulty": "Medium", "likes": 785, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30496, "totalSubmissionRaw": 86845}, "2401": {"acRate": 51.243468163344296, "difficulty": "Medium", "likes": 1265, "dislikes": 29, "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": 31773, "totalSubmissionRaw": 62004}, "2402": {"acRate": 44.54584775086505, "difficulty": "Hard", "likes": 1677, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113288, "totalSubmissionRaw": 254319}, "2403": {"acRate": 56.01552393272963, "difficulty": "Hard", "likes": 46, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1299, "totalSubmissionRaw": 2319}, "2404": {"acRate": 50.427290956360025, "difficulty": "Easy", "likes": 941, "dislikes": 32, "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": 79720, "totalSubmissionRaw": 158089}, "2405": {"acRate": 78.03786024428345, "difficulty": "Medium", "likes": 2589, "dislikes": 100, "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": 190331, "totalSubmissionRaw": 243895}, "2406": {"acRate": 46.994262016695565, "difficulty": "Medium", "likes": 771, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26290, "totalSubmissionRaw": 55943}, "2407": {"acRate": 23.695659338848422, "difficulty": "Hard", "likes": 858, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2407", "paidOnly": false, "title": "Longest Increasing Subsequence II", "titleSlug": "longest-increasing-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14379, "totalSubmissionRaw": 60680}, "2408": {"acRate": 78.16431322207958, "difficulty": "Medium", "likes": 50, "dislikes": 75, "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": 6089, "totalSubmissionRaw": 7790}, "2409": {"acRate": 44.9123995933906, "difficulty": "Easy", "likes": 249, "dislikes": 581, "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": 22533, "totalSubmissionRaw": 50171}, "2410": {"acRate": 62.734791398639956, "difficulty": "Medium", "likes": 483, "dislikes": 15, "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": 34134, "totalSubmissionRaw": 54410}, "2411": {"acRate": 44.00027857093112, "difficulty": "Medium", "likes": 553, "dislikes": 27, "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": 12636, "totalSubmissionRaw": 28718}, "2412": {"acRate": 40.20266380071393, "difficulty": "Hard", "likes": 396, "dislikes": 34, "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": 10474, "totalSubmissionRaw": 26053}, "2413": {"acRate": 87.68666133849324, "difficulty": "Easy", "likes": 880, "dislikes": 101, "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": 166766, "totalSubmissionRaw": 190184}, "2414": {"acRate": 58.10263861142101, "difficulty": "Medium", "likes": 493, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2414", "paidOnly": false, "title": "Length of the Longest Alphabetical Continuous Substring", "titleSlug": "length-of-the-longest-alphabetical-continuous-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44789, "totalSubmissionRaw": 77086}, "2415": {"acRate": 77.62782247599273, "difficulty": "Medium", "likes": 1104, "dislikes": 40, "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": 50847, "totalSubmissionRaw": 65501}, "2416": {"acRate": 45.911859032106946, "difficulty": "Hard", "likes": 656, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2416", "paidOnly": false, "title": "Sum of Prefix Scores of Strings", "titleSlug": "sum-of-prefix-scores-of-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25482, "totalSubmissionRaw": 55502}, "2417": {"acRate": 44.80712166172107, "difficulty": "Medium", "likes": 27, "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": 1057, "totalSubmissionRaw": 2359}, "2418": {"acRate": 80.08358644995248, "difficulty": "Easy", "likes": 1284, "dislikes": 21, "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": 138157, "totalSubmissionRaw": 172516}, "2419": {"acRate": 49.33765350327593, "difficulty": "Medium", "likes": 456, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27561, "totalSubmissionRaw": 55862}, "2420": {"acRate": 38.6420203763316, "difficulty": "Medium", "likes": 619, "dislikes": 36, "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": 23288, "totalSubmissionRaw": 60266}, "2421": {"acRate": 56.37105099089339, "difficulty": "Hard", "likes": 2197, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55154, "totalSubmissionRaw": 97841}, "2422": {"acRate": 69.377226384965, "difficulty": "Medium", "likes": 130, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11296, "totalSubmissionRaw": 16282}, "2423": {"acRate": 17.309949221670067, "difficulty": "Easy", "likes": 648, "dislikes": 1183, "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": 44690, "totalSubmissionRaw": 258177}, "2424": {"acRate": 55.2985014610085, "difficulty": "Medium", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20628, "totalSubmissionRaw": 37303}, "2425": {"acRate": 57.99316188494128, "difficulty": "Medium", "likes": 395, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19506, "totalSubmissionRaw": 33635}, "2426": {"acRate": 44.013484982632974, "difficulty": "Hard", "likes": 527, "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": 12925, "totalSubmissionRaw": 29366}, "2427": {"acRate": 78.9893293111363, "difficulty": "Easy", "likes": 566, "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": 84314, "totalSubmissionRaw": 106741}, "2428": {"acRate": 74.78926900527074, "difficulty": "Medium", "likes": 447, "dislikes": 60, "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": 37886, "totalSubmissionRaw": 50657}, "2429": {"acRate": 44.03947288269813, "difficulty": "Medium", "likes": 473, "dislikes": 21, "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": 21689, "totalSubmissionRaw": 49249}, "2430": {"acRate": 33.13705583756345, "difficulty": "Hard", "likes": 474, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13056, "totalSubmissionRaw": 39400}, "2431": {"acRate": 64.54073848031736, "difficulty": "Medium", "likes": 45, "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": 2115, "totalSubmissionRaw": 3277}, "2432": {"acRate": 50.031251362704765, "difficulty": "Easy", "likes": 270, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2432", "paidOnly": false, "title": "The Employee That Worked on the Longest Task", "titleSlug": "the-employee-that-worked-on-the-longest-task", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34420, "totalSubmissionRaw": 68797}, "2433": {"acRate": 88.07827450789675, "difficulty": "Medium", "likes": 1369, "dislikes": 80, "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": 144887, "totalSubmissionRaw": 164498}, "2434": {"acRate": 39.73586301429472, "difficulty": "Medium", "likes": 638, "dislikes": 192, "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": 18263, "totalSubmissionRaw": 45961}, "2435": {"acRate": 42.74021966226448, "difficulty": "Hard", "likes": 885, "dislikes": 30, "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": 22298, "totalSubmissionRaw": 52171}, "2436": {"acRate": 71.39208173690932, "difficulty": "Medium", "likes": 39, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2236, "totalSubmissionRaw": 3132}, "2437": {"acRate": 46.57490687744163, "difficulty": "Easy", "likes": 282, "dislikes": 233, "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": 30759, "totalSubmissionRaw": 66042}, "2438": {"acRate": 40.131149188482986, "difficulty": "Medium", "likes": 293, "dislikes": 50, "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": 15973, "totalSubmissionRaw": 39802}, "2439": {"acRate": 46.54587933482981, "difficulty": "Medium", "likes": 2392, "dislikes": 615, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81284, "totalSubmissionRaw": 174632}, "2440": {"acRate": 52.863472267804404, "difficulty": "Hard", "likes": 381, "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": 6443, "totalSubmissionRaw": 12188}, "2441": {"acRate": 75.18976105191251, "difficulty": "Easy", "likes": 981, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216839, "totalSubmissionRaw": 288389}, "2442": {"acRate": 79.28015055674629, "difficulty": "Medium", "likes": 613, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60662, "totalSubmissionRaw": 76516}, "2443": {"acRate": 47.2237419768078, "difficulty": "Medium", "likes": 250, "dislikes": 299, "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": 35389, "totalSubmissionRaw": 74939}, "2444": {"acRate": 68.04722917978722, "difficulty": "Hard", "likes": 3097, "dislikes": 80, "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": 141543, "totalSubmissionRaw": 208006}, "2445": {"acRate": 68.83573689764333, "difficulty": "Medium", "likes": 76, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2445", "paidOnly": true, "title": "Number of Nodes With Value One", "titleSlug": "number-of-nodes-with-value-one", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1957, "totalSubmissionRaw": 2843}, "2446": {"acRate": 50.88099026581805, "difficulty": "Easy", "likes": 441, "dislikes": 65, "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": 43489, "totalSubmissionRaw": 85472}, "2447": {"acRate": 49.94686503719448, "difficulty": "Medium", "likes": 439, "dislikes": 65, "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": 25380, "totalSubmissionRaw": 50814}, "2448": {"acRate": 45.92405169461317, "difficulty": "Hard", "likes": 2370, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2448", "paidOnly": false, "title": "Minimum Cost to Make Array Equal", "titleSlug": "minimum-cost-to-make-array-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65704, "totalSubmissionRaw": 143071}, "2449": {"acRate": 61.784080052295465, "difficulty": "Hard", "likes": 416, "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": 12287, "totalSubmissionRaw": 19887}, "2450": {"acRate": 64.20373027259684, "difficulty": "Medium", "likes": 34, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 895, "totalSubmissionRaw": 1394}, "2451": {"acRate": 59.123191223725414, "difficulty": "Easy", "likes": 387, "dislikes": 109, "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": 28887, "totalSubmissionRaw": 48859}, "2452": {"acRate": 60.60979807251032, "difficulty": "Medium", "likes": 288, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21131, "totalSubmissionRaw": 34864}, "2453": {"acRate": 39.11742536716841, "difficulty": "Medium", "likes": 561, "dislikes": 21, "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": 17126, "totalSubmissionRaw": 43781}, "2454": {"acRate": 38.75747636503955, "difficulty": "Hard", "likes": 650, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2454", "paidOnly": false, "title": "Next Greater Element IV", "titleSlug": "next-greater-element-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10044, "totalSubmissionRaw": 25915}, "2455": {"acRate": 60.19645086015086, "difficulty": "Easy", "likes": 327, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2455", "paidOnly": false, "title": "Average Value of Even Numbers That Are Divisible by Three", "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55462, "totalSubmissionRaw": 92135}, "2456": {"acRate": 43.68735466281773, "difficulty": "Medium", "likes": 264, "dislikes": 364, "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": 21793, "totalSubmissionRaw": 49884}, "2457": {"acRate": 37.572531990931104, "difficulty": "Medium", "likes": 522, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19555, "totalSubmissionRaw": 52046}, "2458": {"acRate": 40.34942304566878, "difficulty": "Hard", "likes": 823, "dislikes": 18, "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": 24827, "totalSubmissionRaw": 61530}, "2459": {"acRate": 46.32516703786192, "difficulty": "Hard", "likes": 51, "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": 1664, "totalSubmissionRaw": 3592}, "2460": {"acRate": 67.45013692251405, "difficulty": "Easy", "likes": 533, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60838, "totalSubmissionRaw": 90197}, "2461": {"acRate": 33.981175433626085, "difficulty": "Medium", "likes": 1256, "dislikes": 23, "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": 53974, "totalSubmissionRaw": 158835}, "2462": {"acRate": 43.0182801200864, "difficulty": "Medium", "likes": 1839, "dislikes": 563, "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": 95002, "totalSubmissionRaw": 220841}, "2463": {"acRate": 40.62126642771804, "difficulty": "Hard", "likes": 459, "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": 8160, "totalSubmissionRaw": 20088}, "2464": {"acRate": 54.30656934306569, "difficulty": "Medium", "likes": 28, "dislikes": 6, "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": 1116, "totalSubmissionRaw": 2055}, "2465": {"acRate": 57.798809720614976, "difficulty": "Easy", "likes": 362, "dislikes": 26, "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": 41954, "totalSubmissionRaw": 72587}, "2466": {"acRate": 54.59701645263381, "difficulty": "Medium", "likes": 1686, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2466", "paidOnly": false, "title": "Count Ways To Build Good Strings", "titleSlug": "count-ways-to-build-good-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74698, "totalSubmissionRaw": 136817}, "2467": {"acRate": 49.042975803539186, "difficulty": "Medium", "likes": 679, "dislikes": 67, "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": 12222, "totalSubmissionRaw": 24921}, "2468": {"acRate": 44.392565729827744, "difficulty": "Hard", "likes": 151, "dislikes": 162, "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": 9793, "totalSubmissionRaw": 22060}, "2469": {"acRate": 89.38362117447366, "difficulty": "Easy", "likes": 595, "dislikes": 329, "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": 174829, "totalSubmissionRaw": 195594}, "2470": {"acRate": 38.76689041167914, "difficulty": "Medium", "likes": 353, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2470", "paidOnly": false, "title": "Number of Subarrays With LCM Equal to K", "titleSlug": "number-of-subarrays-with-lcm-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22120, "totalSubmissionRaw": 57059}, "2471": {"acRate": 61.84321848469819, "difficulty": "Medium", "likes": 622, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2471", "paidOnly": false, "title": "Minimum Number of Operations to Sort a Binary Tree by Level", "titleSlug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21198, "totalSubmissionRaw": 34277}, "2472": {"acRate": 40.215867305097746, "difficulty": "Hard", "likes": 449, "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": 15202, "totalSubmissionRaw": 37801}, "2473": {"acRate": 67.78717978439782, "difficulty": "Medium", "likes": 108, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5848, "totalSubmissionRaw": 8627}, "2474": {"acRate": 44.4594391962813, "difficulty": "Hard", "likes": 38, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2474", "paidOnly": true, "title": "Customers With Strictly Increasing Purchases", "titleSlug": "customers-with-strictly-increasing-purchases", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2965, "totalSubmissionRaw": 6669}, "2475": {"acRate": 71.24300732607077, "difficulty": "Easy", "likes": 396, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41135, "totalSubmissionRaw": 57739}, "2476": {"acRate": 41.497875891367016, "difficulty": "Medium", "likes": 426, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "2476", "paidOnly": false, "title": "Closest Nodes Queries in a Binary Search Tree", "titleSlug": "closest-nodes-queries-in-a-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21881, "totalSubmissionRaw": 52728}, "2477": {"acRate": 64.68302852269497, "difficulty": "Medium", "likes": 2160, "dislikes": 86, "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": 68260, "totalSubmissionRaw": 105530}, "2478": {"acRate": 30.894663139878638, "difficulty": "Hard", "likes": 342, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9928, "totalSubmissionRaw": 32135}, "2479": {"acRate": 49.07834101382488, "difficulty": "Hard", "likes": 31, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2479", "paidOnly": true, "title": "Maximum XOR of Two Non-Overlapping Subtrees", "titleSlug": "maximum-xor-of-two-non-overlapping-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 639, "totalSubmissionRaw": 1302}, "2480": {"acRate": 75.01788268955652, "difficulty": "Easy", "likes": 26, "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": 4195, "totalSubmissionRaw": 5592}, "2481": {"acRate": 53.16199780034936, "difficulty": "Easy", "likes": 218, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2481", "paidOnly": false, "title": "Minimum Cuts to Divide a Circle", "titleSlug": "minimum-cuts-to-divide-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32869, "totalSubmissionRaw": 61828}, "2482": {"acRate": 84.49070782979588, "difficulty": "Medium", "likes": 1155, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124797, "totalSubmissionRaw": 147705}, "2483": {"acRate": 67.32490988721366, "difficulty": "Medium", "likes": 1895, "dislikes": 100, "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": 104223, "totalSubmissionRaw": 154806}, "2484": {"acRate": 37.73376919568192, "difficulty": "Hard", "likes": 487, "dislikes": 26, "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": 9927, "totalSubmissionRaw": 26308}, "2485": {"acRate": 83.9348389034866, "difficulty": "Easy", "likes": 1255, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220731, "totalSubmissionRaw": 262979}, "2486": {"acRate": 73.39983757671152, "difficulty": "Medium", "likes": 1047, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175302, "totalSubmissionRaw": 238830}, "2487": {"acRate": 74.4111766713805, "difficulty": "Medium", "likes": 2004, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183113, "totalSubmissionRaw": 246083}, "2488": {"acRate": 44.33440466402571, "difficulty": "Hard", "likes": 559, "dislikes": 12, "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": 11863, "totalSubmissionRaw": 26758}, "2489": {"acRate": 58.037974683544306, "difficulty": "Medium", "likes": 46, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 917, "totalSubmissionRaw": 1580}, "2490": {"acRate": 62.69367528518334, "difficulty": "Easy", "likes": 359, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38966, "totalSubmissionRaw": 62153}, "2491": {"acRate": 59.685582177385456, "difficulty": "Medium", "likes": 477, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35498, "totalSubmissionRaw": 59475}, "2492": {"acRate": 57.45852959246365, "difficulty": "Medium", "likes": 1760, "dislikes": 299, "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": 84171, "totalSubmissionRaw": 146490}, "2493": {"acRate": 38.46725085400267, "difficulty": "Hard", "likes": 400, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2493", "paidOnly": false, "title": "Divide Nodes Into the Maximum Number of Groups", "titleSlug": "divide-nodes-into-the-maximum-number-of-groups", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7770, "totalSubmissionRaw": 20199}, "2494": {"acRate": 31.09457251769831, "difficulty": "Hard", "likes": 43, "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": 1713, "totalSubmissionRaw": 5509}, "2495": {"acRate": 64.16853094705444, "difficulty": "Medium", "likes": 44, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1721, "totalSubmissionRaw": 2682}, "2496": {"acRate": 72.10869528774747, "difficulty": "Easy", "likes": 389, "dislikes": 20, "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": 43015, "totalSubmissionRaw": 59653}, "2497": {"acRate": 39.02407566638006, "difficulty": "Medium", "likes": 365, "dislikes": 45, "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": 18154, "totalSubmissionRaw": 46520}, "2498": {"acRate": 61.834237880599765, "difficulty": "Medium", "likes": 681, "dislikes": 98, "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": 20166, "totalSubmissionRaw": 32613}, "2499": {"acRate": 43.714199577931865, "difficulty": "Hard", "likes": 225, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2499", "paidOnly": false, "title": "Minimum Total Cost to Make Arrays Unequal", "titleSlug": "minimum-total-cost-to-make-arrays-unequal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4350, "totalSubmissionRaw": 9951}, "2500": {"acRate": 77.94062129220148, "difficulty": "Easy", "likes": 622, "dislikes": 45, "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": 57807, "totalSubmissionRaw": 74168}, "2501": {"acRate": 39.582043343653254, "difficulty": "Medium", "likes": 452, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2501", "paidOnly": false, "title": "Longest Square Streak in an Array", "titleSlug": "longest-square-streak-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25570, "totalSubmissionRaw": 64600}, "2502": {"acRate": 52.86752303101076, "difficulty": "Medium", "likes": 277, "dislikes": 83, "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": 16298, "totalSubmissionRaw": 30828}, "2503": {"acRate": 37.391948629291186, "difficulty": "Hard", "likes": 465, "dislikes": 17, "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": 9084, "totalSubmissionRaw": 24294}, "2504": {"acRate": 74.50796626054358, "difficulty": "Easy", "likes": 29, "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": 3975, "totalSubmissionRaw": 5335}, "2505": {"acRate": 68.54748603351956, "difficulty": "Medium", "likes": 51, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3681, "totalSubmissionRaw": 5370}, "2506": {"acRate": 69.69741242167461, "difficulty": "Easy", "likes": 494, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42935, "totalSubmissionRaw": 61602}, "2507": {"acRate": 48.420748895745014, "difficulty": "Medium", "likes": 377, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2507", "paidOnly": false, "title": "Smallest Value After Replacing With Sum of Prime Factors", "titleSlug": "smallest-value-after-replacing-with-sum-of-prime-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21815, "totalSubmissionRaw": 45053}, "2508": {"acRate": 31.463202993654754, "difficulty": "Hard", "likes": 322, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2508", "paidOnly": false, "title": "Add Edges to Make Degrees of All Nodes Even", "titleSlug": "add-edges-to-make-degrees-of-all-nodes-even", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11603, "totalSubmissionRaw": 36878}, "2509": {"acRate": 55.951583366831926, "difficulty": "Hard", "likes": 342, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12527, "totalSubmissionRaw": 22389}, "2510": {"acRate": 50.13457303645706, "difficulty": "Medium", "likes": 91, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4098, "totalSubmissionRaw": 8174}, "2511": {"acRate": 38.2359319997998, "difficulty": "Easy", "likes": 267, "dislikes": 269, "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": 22919, "totalSubmissionRaw": 59941}, "2512": {"acRate": 45.094356700004525, "difficulty": "Medium", "likes": 323, "dislikes": 79, "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": 19929, "totalSubmissionRaw": 44194}, "2513": {"acRate": 30.237880743103407, "difficulty": "Medium", "likes": 473, "dislikes": 92, "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": 12419, "totalSubmissionRaw": 41070}, "2514": {"acRate": 32.60922110097287, "difficulty": "Hard", "likes": 401, "dislikes": 35, "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": 10793, "totalSubmissionRaw": 33098}, "2515": {"acRate": 48.89059304703476, "difficulty": "Easy", "likes": 340, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28689, "totalSubmissionRaw": 58680}, "2516": {"acRate": 34.40690771721533, "difficulty": "Medium", "likes": 695, "dislikes": 63, "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": 15939, "totalSubmissionRaw": 46325}, "2517": {"acRate": 63.26152493405351, "difficulty": "Medium", "likes": 874, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20145, "totalSubmissionRaw": 31844}, "2518": {"acRate": 31.227374919026023, "difficulty": "Hard", "likes": 424, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8195, "totalSubmissionRaw": 26243}, "2519": {"acRate": 53.406164650799845, "difficulty": "Hard", "likes": 98, "dislikes": 18, "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": 6844, "totalSubmissionRaw": 12815}, "2520": {"acRate": 84.42277887152851, "difficulty": "Easy", "likes": 490, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2520", "paidOnly": false, "title": "Count the Digits That Divide a Number", "titleSlug": "count-the-digits-that-divide-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80617, "totalSubmissionRaw": 95492}, "2521": {"acRate": 50.972308115165255, "difficulty": "Medium", "likes": 452, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2521", "paidOnly": false, "title": "Distinct Prime Factors of Product of Array", "titleSlug": "distinct-prime-factors-of-product-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29672, "totalSubmissionRaw": 58212}, "2522": {"acRate": 46.1282744559195, "difficulty": "Medium", "likes": 368, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20814, "totalSubmissionRaw": 45122}, "2523": {"acRate": 37.149035262807715, "difficulty": "Medium", "likes": 361, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2523", "paidOnly": false, "title": "Closest Prime Numbers in Range", "titleSlug": "closest-prime-numbers-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22334, "totalSubmissionRaw": 60120}, "2524": {"acRate": 40.19963702359347, "difficulty": "Hard", "likes": 22, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 886, "totalSubmissionRaw": 2204}, "2525": {"acRate": 35.48802642444261, "difficulty": "Easy", "likes": 191, "dislikes": 54, "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": 32232, "totalSubmissionRaw": 90825}, "2526": {"acRate": 49.1623686353589, "difficulty": "Medium", "likes": 305, "dislikes": 33, "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": 25355, "totalSubmissionRaw": 51574}, "2527": {"acRate": 68.1148456356497, "difficulty": "Medium", "likes": 350, "dislikes": 51, "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": 18908, "totalSubmissionRaw": 27759}, "2528": {"acRate": 32.387729589383596, "difficulty": "Hard", "likes": 447, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2528", "paidOnly": false, "title": "Maximize the Minimum Powered City", "titleSlug": "maximize-the-minimum-powered-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6736, "totalSubmissionRaw": 20798}, "2529": {"acRate": 71.00202253282272, "difficulty": "Easy", "likes": 876, "dislikes": 51, "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": 102157, "totalSubmissionRaw": 143879}, "2530": {"acRate": 45.64191705984604, "difficulty": "Medium", "likes": 384, "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": 27570, "totalSubmissionRaw": 60405}, "2531": {"acRate": 26.238110856018366, "difficulty": "Medium", "likes": 553, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18400, "totalSubmissionRaw": 70127}, "2532": {"acRate": 44.26284562856823, "difficulty": "Hard", "likes": 111, "dislikes": 215, "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": 3954, "totalSubmissionRaw": 8933}, "2533": {"acRate": 51.761025330507614, "difficulty": "Medium", "likes": 53, "dislikes": 21, "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": 5129, "totalSubmissionRaw": 9909}, "2534": {"acRate": 49.59485224022879, "difficulty": "Hard", "likes": 74, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2534", "paidOnly": true, "title": "Time Taken to Cross the Door", "titleSlug": "time-taken-to-cross-the-door", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6243, "totalSubmissionRaw": 12588}, "2535": {"acRate": 84.28481806775407, "difficulty": "Easy", "likes": 676, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2535", "paidOnly": false, "title": "Difference Between Element Sum and Digit Sum of an Array", "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 120915, "totalSubmissionRaw": 143460}, "2536": {"acRate": 49.23794413192942, "difficulty": "Medium", "likes": 453, "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": 20482, "totalSubmissionRaw": 41598}, "2537": {"acRate": 50.36967369438566, "difficulty": "Medium", "likes": 826, "dislikes": 22, "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": 19280, "totalSubmissionRaw": 38277}, "2538": {"acRate": 32.28105461064229, "difficulty": "Hard", "likes": 417, "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": 7383, "totalSubmissionRaw": 22871}, "2539": {"acRate": 52.79577633789296, "difficulty": "Medium", "likes": 26, "dislikes": 65, "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": 2200, "totalSubmissionRaw": 4167}, "2540": {"acRate": 59.195304636540705, "difficulty": "Easy", "likes": 1085, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226425, "totalSubmissionRaw": 382505}, "2541": {"acRate": 31.40826686004351, "difficulty": "Medium", "likes": 405, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21656, "totalSubmissionRaw": 68950}, "2542": {"acRate": 53.62506034974638, "difficulty": "Medium", "likes": 2635, "dislikes": 156, "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": 85523, "totalSubmissionRaw": 159485}, "2543": {"acRate": 41.97041585263746, "difficulty": "Hard", "likes": 239, "dislikes": 49, "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": 7519, "totalSubmissionRaw": 17915}, "2544": {"acRate": 68.22422315564735, "difficulty": "Easy", "likes": 384, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58797, "totalSubmissionRaw": 86182}, "2545": {"acRate": 85.26974511372728, "difficulty": "Medium", "likes": 645, "dislikes": 45, "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": 59682, "totalSubmissionRaw": 69992}, "2546": {"acRate": 41.00030873726459, "difficulty": "Medium", "likes": 248, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18592, "totalSubmissionRaw": 45346}, "2547": {"acRate": 40.03229241815246, "difficulty": "Hard", "likes": 427, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11653, "totalSubmissionRaw": 29109}, "2548": {"acRate": 65.5064935064935, "difficulty": "Medium", "likes": 39, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2548", "paidOnly": true, "title": "Maximum Price to Fill a Bag", "titleSlug": "maximum-price-to-fill-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1261, "totalSubmissionRaw": 1925}, "2549": {"acRate": 60.144354802630595, "difficulty": "Easy", "likes": 258, "dislikes": 262, "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": 40331, "totalSubmissionRaw": 67057}, "2550": {"acRate": 27.4424375731427, "difficulty": "Medium", "likes": 183, "dislikes": 494, "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": 19463, "totalSubmissionRaw": 70923}, "2551": {"acRate": 66.64151381472023, "difficulty": "Hard", "likes": 2019, "dislikes": 85, "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": 57405, "totalSubmissionRaw": 86140}, "2552": {"acRate": 33.51407561464755, "difficulty": "Hard", "likes": 367, "dislikes": 66, "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": 9024, "totalSubmissionRaw": 26926}, "2553": {"acRate": 79.17539779399912, "difficulty": "Easy", "likes": 473, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2553", "paidOnly": false, "title": "Separate the Digits in an Array", "titleSlug": "separate-the-digits-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68767, "totalSubmissionRaw": 86854}, "2554": {"acRate": 53.61780086087297, "difficulty": "Medium", "likes": 323, "dislikes": 21, "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": 30145, "totalSubmissionRaw": 56222}, "2555": {"acRate": 32.93201833954547, "difficulty": "Medium", "likes": 538, "dislikes": 45, "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": 9984, "totalSubmissionRaw": 30317}, "2556": {"acRate": 27.304082443194883, "difficulty": "Medium", "likes": 563, "dislikes": 26, "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": 13062, "totalSubmissionRaw": 47839}, "2557": {"acRate": 41.18639302783244, "difficulty": "Medium", "likes": 32, "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": 1465, "totalSubmissionRaw": 3557}, "2558": {"acRate": 66.63497959840298, "difficulty": "Easy", "likes": 371, "dislikes": 37, "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": 45562, "totalSubmissionRaw": 68376}, "2559": {"acRate": 51.84710696393744, "difficulty": "Medium", "likes": 432, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27115, "totalSubmissionRaw": 52296}, "2560": {"acRate": 43.02521412761043, "difficulty": "Medium", "likes": 890, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2560", "paidOnly": false, "title": "House Robber IV", "titleSlug": "house-robber-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17883, "totalSubmissionRaw": 41564}, "2561": {"acRate": 33.983066114213656, "difficulty": "Hard", "likes": 374, "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": 9432, "totalSubmissionRaw": 27755}, "2562": {"acRate": 69.72451384796699, "difficulty": "Easy", "likes": 348, "dislikes": 14, "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": 47329, "totalSubmissionRaw": 67880}, "2563": {"acRate": 32.72327085973454, "difficulty": "Medium", "likes": 787, "dislikes": 39, "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": 24531, "totalSubmissionRaw": 74965}, "2564": {"acRate": 33.442212423104145, "difficulty": "Medium", "likes": 364, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12286, "totalSubmissionRaw": 36738}, "2565": {"acRate": 31.558149152230854, "difficulty": "Hard", "likes": 369, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6868, "totalSubmissionRaw": 21763}, "2566": {"acRate": 59.68835349200155, "difficulty": "Easy", "likes": 226, "dislikes": 36, "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": 24477, "totalSubmissionRaw": 41008}, "2567": {"acRate": 47.767753874624105, "difficulty": "Medium", "likes": 234, "dislikes": 210, "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": 16520, "totalSubmissionRaw": 34584}, "2568": {"acRate": 57.44688951496231, "difficulty": "Medium", "likes": 348, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15089, "totalSubmissionRaw": 26266}, "2569": {"acRate": 27.53357112882921, "difficulty": "Hard", "likes": 172, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5249, "totalSubmissionRaw": 19064}, "2570": {"acRate": 73.48982448584043, "difficulty": "Easy", "likes": 326, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40950, "totalSubmissionRaw": 55722}, "2571": {"acRate": 54.80879503302092, "difficulty": "Medium", "likes": 524, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27719, "totalSubmissionRaw": 50574}, "2572": {"acRate": 22.991955211459413, "difficulty": "Medium", "likes": 450, "dislikes": 112, "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": 9117, "totalSubmissionRaw": 39653}, "2573": {"acRate": 31.809896712347264, "difficulty": "Hard", "likes": 185, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4712, "totalSubmissionRaw": 14813}, "2574": {"acRate": 86.34468659388821, "difficulty": "Easy", "likes": 1004, "dislikes": 92, "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": 129239, "totalSubmissionRaw": 149678}, "2575": {"acRate": 32.44926807062939, "difficulty": "Medium", "likes": 521, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27088, "totalSubmissionRaw": 83478}, "2576": {"acRate": 38.26849207130898, "difficulty": "Medium", "likes": 550, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19427, "totalSubmissionRaw": 50765}, "2577": {"acRate": 35.54485748900083, "difficulty": "Hard", "likes": 531, "dislikes": 10, "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": 11149, "totalSubmissionRaw": 31366}, "2578": {"acRate": 70.30560481709077, "difficulty": "Easy", "likes": 358, "dislikes": 28, "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": 34094, "totalSubmissionRaw": 48494}, "2579": {"acRate": 57.52638148190174, "difficulty": "Medium", "likes": 288, "dislikes": 22, "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": 25349, "totalSubmissionRaw": 44065}, "2580": {"acRate": 35.88338246131172, "difficulty": "Medium", "likes": 309, "dislikes": 18, "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": 15582, "totalSubmissionRaw": 43424}, "2581": {"acRate": 45.99664724195737, "difficulty": "Hard", "likes": 292, "dislikes": 9, "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": 5762, "totalSubmissionRaw": 12527}, "2582": {"acRate": 45.81674861468821, "difficulty": "Easy", "likes": 377, "dislikes": 15, "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": 35223, "totalSubmissionRaw": 76878}, "2583": {"acRate": 47.32680141953402, "difficulty": "Medium", "likes": 530, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36807, "totalSubmissionRaw": 77772}, "2584": {"acRate": 22.77483216740923, "difficulty": "Hard", "likes": 301, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11297, "totalSubmissionRaw": 49603}, "2585": {"acRate": 57.221760947258225, "difficulty": "Hard", "likes": 460, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15851, "totalSubmissionRaw": 27701}, "2586": {"acRate": 73.95557939640088, "difficulty": "Easy", "likes": 333, "dislikes": 23, "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": 57905, "totalSubmissionRaw": 78297}, "2587": {"acRate": 40.8870418905026, "difficulty": "Medium", "likes": 280, "dislikes": 43, "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": 28237, "totalSubmissionRaw": 69061}, "2588": {"acRate": 50.208406715979805, "difficulty": "Medium", "likes": 486, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17105, "totalSubmissionRaw": 34068}, "2589": {"acRate": 38.867908516145455, "difficulty": "Hard", "likes": 419, "dislikes": 16, "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": 9160, "totalSubmissionRaw": 23567}, "2590": {"acRate": 58.34382871536524, "difficulty": "Medium", "likes": 36, "dislikes": 13, "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": 1853, "totalSubmissionRaw": 3176}, "2591": {"acRate": 19.12373010357722, "difficulty": "Easy", "likes": 282, "dislikes": 813, "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": 28895, "totalSubmissionRaw": 151095}, "2592": {"acRate": 57.431244105727316, "difficulty": "Medium", "likes": 427, "dislikes": 14, "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": 22532, "totalSubmissionRaw": 39233}, "2593": {"acRate": 52.28227963436499, "difficulty": "Medium", "likes": 355, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17788, "totalSubmissionRaw": 34023}, "2594": {"acRate": 43.84623936850298, "difficulty": "Medium", "likes": 551, "dislikes": 27, "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": 15775, "totalSubmissionRaw": 35978}, "2595": {"acRate": 73.05471679331055, "difficulty": "Easy", "likes": 268, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "2595", "paidOnly": false, "title": "Number of Even and Odd Bits", "titleSlug": "number-of-even-and-odd-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44032, "totalSubmissionRaw": 60273}, "2596": {"acRate": 56.79661478517711, "difficulty": "Medium", "likes": 378, "dislikes": 53, "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": 27113, "totalSubmissionRaw": 47737}, "2597": {"acRate": 51.250286237691775, "difficulty": "Medium", "likes": 1162, "dislikes": 168, "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"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111901, "totalSubmissionRaw": 218345}, "2598": {"acRate": 39.33658170914543, "difficulty": "Medium", "likes": 341, "dislikes": 38, "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": 14693, "totalSubmissionRaw": 37352}, "2599": {"acRate": 51.06951871657755, "difficulty": "Medium", "likes": 44, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1719, "totalSubmissionRaw": 3366}, "2600": {"acRate": 61.51495271773045, "difficulty": "Easy", "likes": 276, "dislikes": 25, "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": 38445, "totalSubmissionRaw": 62497}, "2601": {"acRate": 37.662667868617525, "difficulty": "Medium", "likes": 373, "dislikes": 35, "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": 16294, "totalSubmissionRaw": 43263}, "2602": {"acRate": 35.183091062359935, "difficulty": "Medium", "likes": 681, "dislikes": 20, "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": 17112, "totalSubmissionRaw": 48637}, "2603": {"acRate": 37.154213890530166, "difficulty": "Hard", "likes": 414, "dislikes": 10, "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": 6917, "totalSubmissionRaw": 18617}, "2604": {"acRate": 41.286307053941904, "difficulty": "Hard", "likes": 39, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 995, "totalSubmissionRaw": 2410}, "2605": {"acRate": 53.63234080852022, "difficulty": "Easy", "likes": 293, "dislikes": 21, "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": 35753, "totalSubmissionRaw": 66664}, "2606": {"acRate": 56.42979208202791, "difficulty": "Medium", "likes": 349, "dislikes": 10, "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": 23775, "totalSubmissionRaw": 42132}, "2607": {"acRate": 36.48035979833884, "difficulty": "Medium", "likes": 449, "dislikes": 81, "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": 10058, "totalSubmissionRaw": 27571}, "2608": {"acRate": 36.43251146407922, "difficulty": "Hard", "likes": 486, "dislikes": 16, "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": 16446, "totalSubmissionRaw": 45141}, "2609": {"acRate": 46.12312964719562, "difficulty": "Easy", "likes": 359, "dislikes": 25, "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": 30147, "totalSubmissionRaw": 65362}, "2610": {"acRate": 87.17582432438522, "difficulty": "Medium", "likes": 1577, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193450, "totalSubmissionRaw": 221908}, "2611": {"acRate": 45.431821941222964, "difficulty": "Medium", "likes": 602, "dislikes": 51, "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": 24719, "totalSubmissionRaw": 54409}, "2612": {"acRate": 16.344250338623972, "difficulty": "Hard", "likes": 235, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4706, "totalSubmissionRaw": 28793}, "2613": {"acRate": 45.04424778761062, "difficulty": "Hard", "likes": 17, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2613", "paidOnly": true, "title": "Beautiful Pairs", "titleSlug": "beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 509, "totalSubmissionRaw": 1130}, "2614": {"acRate": 33.7838822205855, "difficulty": "Easy", "likes": 337, "dislikes": 36, "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": 41741, "totalSubmissionRaw": 123553}, "2615": {"acRate": 30.747273893521488, "difficulty": "Medium", "likes": 720, "dislikes": 86, "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": 19174, "totalSubmissionRaw": 62360}, "2616": {"acRate": 43.976917228571786, "difficulty": "Medium", "likes": 2267, "dislikes": 244, "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": 70568, "totalSubmissionRaw": 160466}, "2617": {"acRate": 24.74229920498171, "difficulty": "Hard", "likes": 364, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8185, "totalSubmissionRaw": 33081}, "2618": {"acRate": 27.660571964369435, "difficulty": "Medium", "likes": 263, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21830, "totalSubmissionRaw": 78921}, "2619": {"acRate": 73.03686414337488, "difficulty": "Easy", "likes": 484, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124541, "totalSubmissionRaw": 170518}, "2620": {"acRate": 80.66634729069271, "difficulty": "Easy", "likes": 1194, "dislikes": 96, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341813, "totalSubmissionRaw": 423737}, "2621": {"acRate": 86.52281247142727, "difficulty": "Easy", "likes": 562, "dislikes": 42, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123019, "totalSubmissionRaw": 142181}, "2622": {"acRate": 73.89163487379955, "difficulty": "Medium", "likes": 403, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39317, "totalSubmissionRaw": 53209}, "2623": {"acRate": 62.306074059481176, "difficulty": "Medium", "likes": 553, "dislikes": 74, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88555, "totalSubmissionRaw": 142129}, "2624": {"acRate": 65.1859296482412, "difficulty": "Medium", "likes": 96, "dislikes": 42, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9729, "totalSubmissionRaw": 14925}, "2625": {"acRate": 63.560350871193336, "difficulty": "Medium", "likes": 314, "dislikes": 23, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37172, "totalSubmissionRaw": 58483}, "2626": {"acRate": 84.24355608374817, "difficulty": "Easy", "likes": 565, "dislikes": 32, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138934, "totalSubmissionRaw": 164920}, "2627": {"acRate": 90.49910835141696, "difficulty": "Medium", "likes": 368, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42121, "totalSubmissionRaw": 46543}, "2628": {"acRate": 38.58213183907323, "difficulty": "Medium", "likes": 212, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12256, "totalSubmissionRaw": 31766}, "2629": {"acRate": 85.79837954837954, "difficulty": "Easy", "likes": 632, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117331, "totalSubmissionRaw": 136752}, "2630": {"acRate": 30.938806537438236, "difficulty": "Hard", "likes": 115, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4884, "totalSubmissionRaw": 15786}, "2631": {"acRate": 80.63732341367967, "difficulty": "Medium", "likes": 288, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37502, "totalSubmissionRaw": 46507}, "2632": {"acRate": 89.39696264272253, "difficulty": "Medium", "likes": 340, "dislikes": 34, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16128, "totalSubmissionRaw": 18041}, "2633": {"acRate": 77.46907321030217, "difficulty": "Medium", "likes": 202, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11460, "totalSubmissionRaw": 14793}, "2634": {"acRate": 84.36148910025942, "difficulty": "Easy", "likes": 602, "dislikes": 65, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148294, "totalSubmissionRaw": 175784}, "2635": {"acRate": 85.58919412669498, "difficulty": "Easy", "likes": 690, "dislikes": 61, "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": 163031, "totalSubmissionRaw": 190482}, "2636": {"acRate": 80.02131060202451, "difficulty": "Medium", "likes": 282, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12016, "totalSubmissionRaw": 15016}, "2637": {"acRate": 81.36528214236918, "difficulty": "Medium", "likes": 459, "dislikes": 64, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47638, "totalSubmissionRaw": 58549}, "2638": {"acRate": 46.84038071462007, "difficulty": "Medium", "likes": 74, "dislikes": 12, "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": 3002, "totalSubmissionRaw": 6409}, "2639": {"acRate": 67.27176328014542, "difficulty": "Easy", "likes": 163, "dislikes": 41, "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": 26645, "totalSubmissionRaw": 39608}, "2640": {"acRate": 70.14958807277796, "difficulty": "Medium", "likes": 275, "dislikes": 32, "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": 28184, "totalSubmissionRaw": 40177}, "2641": {"acRate": 67.79115916244697, "difficulty": "Medium", "likes": 555, "dislikes": 12, "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": 19814, "totalSubmissionRaw": 29228}, "2642": {"acRate": 70.71462233837454, "difficulty": "Hard", "likes": 788, "dislikes": 56, "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": 66022, "totalSubmissionRaw": 93364}, "2643": {"acRate": 75.45385877633943, "difficulty": "Easy", "likes": 426, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2643", "paidOnly": false, "title": "Row With Maximum Ones", "titleSlug": "row-with-maximum-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57938, "totalSubmissionRaw": 76786}, "2644": {"acRate": 49.057185512138126, "difficulty": "Easy", "likes": 167, "dislikes": 47, "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": 30230, "totalSubmissionRaw": 61623}, "2645": {"acRate": 50.35734911926075, "difficulty": "Medium", "likes": 527, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2645", "paidOnly": false, "title": "Minimum Additions to Make Valid String", "titleSlug": "minimum-additions-to-make-valid-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27902, "totalSubmissionRaw": 55408}, "2646": {"acRate": 45.033929673041335, "difficulty": "Hard", "likes": 463, "dislikes": 18, "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": 9490, "totalSubmissionRaw": 21073}, "2647": {"acRate": 66.66666666666666, "difficulty": "Hard", "likes": 10, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2647", "paidOnly": true, "title": "Color the Triangle Red", "titleSlug": "color-the-triangle-red", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 300, "totalSubmissionRaw": 450}, "2648": {"acRate": 82.72640911969602, "difficulty": "Easy", "likes": 238, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26124, "totalSubmissionRaw": 31579}, "2649": {"acRate": 78.97033158813264, "difficulty": "Medium", "likes": 160, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11765, "totalSubmissionRaw": 14898}, "2650": {"acRate": 51.02913659449345, "difficulty": "Hard", "likes": 62, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1909, "totalSubmissionRaw": 3741}, "2651": {"acRate": 78.53562899849642, "difficulty": "Easy", "likes": 225, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2651", "paidOnly": false, "title": "Calculate Delayed Arrival Time", "titleSlug": "calculate-delayed-arrival-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53277, "totalSubmissionRaw": 67838}, "2652": {"acRate": 85.3346069091488, "difficulty": "Easy", "likes": 479, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101845, "totalSubmissionRaw": 119348}, "2653": {"acRate": 32.89066032522231, "difficulty": "Medium", "likes": 605, "dislikes": 121, "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": 19640, "totalSubmissionRaw": 59713}, "2654": {"acRate": 35.053335229697055, "difficulty": "Medium", "likes": 377, "dislikes": 20, "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": 12323, "totalSubmissionRaw": 35155}, "2655": {"acRate": 53.16901408450704, "difficulty": "Medium", "likes": 25, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1208, "totalSubmissionRaw": 2272}, "2656": {"acRate": 82.01842839373484, "difficulty": "Easy", "likes": 359, "dislikes": 46, "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": 67917, "totalSubmissionRaw": 82807}, "2657": {"acRate": 80.97648230583165, "difficulty": "Medium", "likes": 458, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39838, "totalSubmissionRaw": 49197}, "2658": {"acRate": 59.62562415694441, "difficulty": "Medium", "likes": 423, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2658", "paidOnly": false, "title": "Maximum Number of Fish in a Grid", "titleSlug": "maximum-number-of-fish-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25196, "totalSubmissionRaw": 42257}, "2659": {"acRate": 25.219576461403335, "difficulty": "Hard", "likes": 529, "dislikes": 31, "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": 10337, "totalSubmissionRaw": 40988}, "2660": {"acRate": 33.84612251962411, "difficulty": "Easy", "likes": 231, "dislikes": 135, "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": 33244, "totalSubmissionRaw": 98221}, "2661": {"acRate": 50.28888938082483, "difficulty": "Medium", "likes": 422, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2661", "paidOnly": false, "title": "First Completely Painted Row or Column", "titleSlug": "first-completely-painted-row-or-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22717, "totalSubmissionRaw": 45173}, "2662": {"acRate": 38.33581904051703, "difficulty": "Medium", "likes": 536, "dislikes": 78, "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": 12338, "totalSubmissionRaw": 32184}, "2663": {"acRate": 36.597938144329895, "difficulty": "Hard", "likes": 185, "dislikes": 17, "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": 4828, "totalSubmissionRaw": 13192}, "2664": {"acRate": 66.28140703517587, "difficulty": "Medium", "likes": 34, "dislikes": 1, "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": 1319, "totalSubmissionRaw": 1990}, "2665": {"acRate": 79.6053016231386, "difficulty": "Easy", "likes": 694, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176996, "totalSubmissionRaw": 222342}, "2666": {"acRate": 85.93867911344644, "difficulty": "Easy", "likes": 448, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92244, "totalSubmissionRaw": 107337}, "2667": {"acRate": 81.22134115910748, "difficulty": "Easy", "likes": 1200, "dislikes": 159, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380821, "totalSubmissionRaw": 468868}, "2668": {"acRate": 70.77193754123599, "difficulty": "Easy", "likes": 17, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3218, "totalSubmissionRaw": 4547}, "2669": {"acRate": 71.52575315840622, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2669", "paidOnly": true, "title": "Count Artist Occurrences On Spotify Ranking List", "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2944, "totalSubmissionRaw": 4116}, "2670": {"acRate": 77.32006479981486, "difficulty": "Easy", "likes": 322, "dislikes": 30, "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": 36751, "totalSubmissionRaw": 47531}, "2671": {"acRate": 29.613066031122948, "difficulty": "Medium", "likes": 317, "dislikes": 27, "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": 21123, "totalSubmissionRaw": 71330}, "2672": {"acRate": 54.43352413867588, "difficulty": "Medium", "likes": 339, "dislikes": 93, "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": 15120, "totalSubmissionRaw": 27777}, "2673": {"acRate": 58.96845759130698, "difficulty": "Medium", "likes": 577, "dislikes": 10, "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": 15629, "totalSubmissionRaw": 26504}, "2674": {"acRate": 72.91196388261851, "difficulty": "Medium", "likes": 37, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1292, "totalSubmissionRaw": 1772}, "2675": {"acRate": 69.26632689344554, "difficulty": "Hard", "likes": 132, "dislikes": 72, "categoryTitle": "JavaScript", "frontendQuestionId": "2675", "paidOnly": true, "title": "Array of Objects to Matrix", "titleSlug": "array-of-objects-to-matrix", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5844, "totalSubmissionRaw": 8437}, "2676": {"acRate": 82.6831063673169, "difficulty": "Medium", "likes": 159, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8986, "totalSubmissionRaw": 10868}, "2677": {"acRate": 82.99344780493793, "difficulty": "Easy", "likes": 319, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54086, "totalSubmissionRaw": 65169}, "2678": {"acRate": 76.50922153120308, "difficulty": "Easy", "likes": 287, "dislikes": 19, "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": 57082, "totalSubmissionRaw": 74608}, "2679": {"acRate": 59.61896338879369, "difficulty": "Medium", "likes": 335, "dislikes": 57, "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": 32357, "totalSubmissionRaw": 54273}, "2680": {"acRate": 40.630963373345644, "difficulty": "Medium", "likes": 380, "dislikes": 44, "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": 13201, "totalSubmissionRaw": 32490}, "2681": {"acRate": 30.509909020382253, "difficulty": "Hard", "likes": 307, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8652, "totalSubmissionRaw": 28358}, "2682": {"acRate": 48.79209303180056, "difficulty": "Easy", "likes": 240, "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": 26559, "totalSubmissionRaw": 54433}, "2683": {"acRate": 61.540229224714906, "difficulty": "Medium", "likes": 269, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21424, "totalSubmissionRaw": 34813}, "2684": {"acRate": 45.668983831914396, "difficulty": "Medium", "likes": 422, "dislikes": 6, "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": 23388, "totalSubmissionRaw": 51212}, "2685": {"acRate": 65.30006397952656, "difficulty": "Medium", "likes": 629, "dislikes": 14, "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": 25514, "totalSubmissionRaw": 39073}, "2686": {"acRate": 65.86215476486689, "difficulty": "Medium", "likes": 12, "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": 2647, "totalSubmissionRaw": 4019}, "2687": {"acRate": 80.36082474226805, "difficulty": "Easy", "likes": 20, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3118, "totalSubmissionRaw": 3880}, "2688": {"acRate": 41.23442480440452, "difficulty": "Medium", "likes": 19, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2846, "totalSubmissionRaw": 6902}, "2689": {"acRate": 74.07735459108355, "difficulty": "Easy", "likes": 33, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2509, "totalSubmissionRaw": 3387}, "2690": {"acRate": 92.61410788381743, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1116, "totalSubmissionRaw": 1205}, "2691": {"acRate": 39.111111111111114, "difficulty": "Hard", "likes": 10, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 176, "totalSubmissionRaw": 450}, "2692": {"acRate": 63.97849462365591, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357, "totalSubmissionRaw": 558}, "2693": {"acRate": 80.28145831618797, "difficulty": "Medium", "likes": 138, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9755, "totalSubmissionRaw": 12151}, "2694": {"acRate": 74.73849729951459, "difficulty": "Medium", "likes": 224, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21864, "totalSubmissionRaw": 29253}, "2695": {"acRate": 87.70890036374736, "difficulty": "Easy", "likes": 221, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34481, "totalSubmissionRaw": 39313}, "2696": {"acRate": 69.45881735632351, "difficulty": "Easy", "likes": 396, "dislikes": 9, "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": 47655, "totalSubmissionRaw": 68609}, "2697": {"acRate": 81.511625971605, "difficulty": "Easy", "likes": 337, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48973, "totalSubmissionRaw": 60081}, "2698": {"acRate": 62.196498242672426, "difficulty": "Medium", "likes": 468, "dislikes": 29, "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": 19289, "totalSubmissionRaw": 31013}, "2699": {"acRate": 24.01684680570356, "difficulty": "Hard", "likes": 268, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2699", "paidOnly": false, "title": "Modify Graph Edge Weights", "titleSlug": "modify-graph-edge-weights", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4733, "totalSubmissionRaw": 19707}, "2700": {"acRate": 77.14944548149775, "difficulty": "Medium", "likes": 145, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7026, "totalSubmissionRaw": 9107}, "2701": {"acRate": 31.21978959340347, "difficulty": "Hard", "likes": 38, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2701", "paidOnly": true, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2196, "totalSubmissionRaw": 7034}, "2702": {"acRate": 52.104975396391474, "difficulty": "Hard", "likes": 36, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 953, "totalSubmissionRaw": 1829}, "2703": {"acRate": 94.09287576836677, "difficulty": "Easy", "likes": 284, "dislikes": 144, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130265, "totalSubmissionRaw": 138443}, "2704": {"acRate": 61.92607755608718, "difficulty": "Easy", "likes": 593, "dislikes": 144, "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": 150652, "totalSubmissionRaw": 243276}, "2705": {"acRate": 64.10247878888704, "difficulty": "Medium", "likes": 162, "dislikes": 18, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19266, "totalSubmissionRaw": 30055}, "2706": {"acRate": 69.33739635190022, "difficulty": "Easy", "likes": 969, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177025, "totalSubmissionRaw": 255310}, "2707": {"acRate": 52.54459908612726, "difficulty": "Medium", "likes": 2058, "dislikes": 93, "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": 85210, "totalSubmissionRaw": 162167}, "2708": {"acRate": 23.99893527350162, "difficulty": "Medium", "likes": 347, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27048, "totalSubmissionRaw": 112705}, "2709": {"acRate": 42.67922592448375, "difficulty": "Hard", "likes": 801, "dislikes": 132, "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": 69052, "totalSubmissionRaw": 161793}, "2710": {"acRate": 78.48289475370753, "difficulty": "Easy", "likes": 302, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2710", "paidOnly": false, "title": "Remove Trailing Zeros From a String", "titleSlug": "remove-trailing-zeros-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61230, "totalSubmissionRaw": 78017}, "2711": {"acRate": 70.93544918616291, "difficulty": "Medium", "likes": 121, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19132, "totalSubmissionRaw": 26971}, "2712": {"acRate": 54.14579687405708, "difficulty": "Medium", "likes": 523, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2712", "paidOnly": false, "title": "Minimum Cost to Make All Characters Equal", "titleSlug": "minimum-cost-to-make-all-characters-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17945, "totalSubmissionRaw": 33142}, "2713": {"acRate": 30.389258438038922, "difficulty": "Hard", "likes": 559, "dislikes": 19, "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": 12335, "totalSubmissionRaw": 40590}, "2714": {"acRate": 60.66666666666667, "difficulty": "Hard", "likes": 28, "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": 819, "totalSubmissionRaw": 1350}, "2715": {"acRate": 88.33727848506173, "difficulty": "Easy", "likes": 203, "dislikes": 264, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41423, "totalSubmissionRaw": 46892}, "2716": {"acRate": 75.47310900201323, "difficulty": "Easy", "likes": 274, "dislikes": 86, "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": 52484, "totalSubmissionRaw": 69540}, "2717": {"acRate": 63.49551508562109, "difficulty": "Easy", "likes": 206, "dislikes": 15, "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": 30368, "totalSubmissionRaw": 47827}, "2718": {"acRate": 30.68358673530468, "difficulty": "Medium", "likes": 685, "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": 20504, "totalSubmissionRaw": 66824}, "2719": {"acRate": 34.33870914979227, "difficulty": "Hard", "likes": 513, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2719", "paidOnly": false, "title": "Count of Integers", "titleSlug": "count-of-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10497, "totalSubmissionRaw": 30569}, "2720": {"acRate": 49.52229299363057, "difficulty": "Hard", "likes": 12, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1555, "totalSubmissionRaw": 3140}, "2721": {"acRate": 74.16994546835095, "difficulty": "Medium", "likes": 175, "dislikes": 43, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21489, "totalSubmissionRaw": 28972}, "2722": {"acRate": 54.007645815090875, "difficulty": "Medium", "likes": 148, "dislikes": 52, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25288, "totalSubmissionRaw": 46823}, "2723": {"acRate": 91.06368211001214, "difficulty": "Easy", "likes": 248, "dislikes": 24, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78719, "totalSubmissionRaw": 86444}, "2724": {"acRate": 82.0225540102784, "difficulty": "Easy", "likes": 153, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33676, "totalSubmissionRaw": 41057}, "2725": {"acRate": 79.19690828541805, "difficulty": "Easy", "likes": 142, "dislikes": 82, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33608, "totalSubmissionRaw": 42436}, "2726": {"acRate": 74.64408522672494, "difficulty": "Easy", "likes": 102, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23225, "totalSubmissionRaw": 31115}, "2727": {"acRate": 79.47981203795158, "difficulty": "Easy", "likes": 159, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53109, "totalSubmissionRaw": 66821}, "2728": {"acRate": 84.37775816416593, "difficulty": "Easy", "likes": 49, "dislikes": 8, "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": 1912, "totalSubmissionRaw": 2266}, "2729": {"acRate": 51.86749693504728, "difficulty": "Easy", "likes": 227, "dislikes": 12, "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": 42730, "totalSubmissionRaw": 82383}, "2730": {"acRate": 36.330661484900006, "difficulty": "Medium", "likes": 279, "dislikes": 83, "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": 22436, "totalSubmissionRaw": 61755}, "2731": {"acRate": 27.83100667649354, "difficulty": "Medium", "likes": 478, "dislikes": 91, "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": 12839, "totalSubmissionRaw": 46132}, "2732": {"acRate": 45.03056528607734, "difficulty": "Hard", "likes": 205, "dislikes": 25, "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": 6556, "totalSubmissionRaw": 14559}, "2733": {"acRate": 76.54352337504268, "difficulty": "Easy", "likes": 336, "dislikes": 15, "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": 87415, "totalSubmissionRaw": 114203}, "2734": {"acRate": 30.44153720359771, "difficulty": "Medium", "likes": 231, "dislikes": 183, "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": 26061, "totalSubmissionRaw": 85610}, "2735": {"acRate": 33.06950640379911, "difficulty": "Medium", "likes": 281, "dislikes": 533, "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": 11490, "totalSubmissionRaw": 34745}, "2736": {"acRate": 28.835350043215215, "difficulty": "Hard", "likes": 321, "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": 5338, "totalSubmissionRaw": 18512}, "2737": {"acRate": 55.590427618673985, "difficulty": "Medium", "likes": 33, "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": 1417, "totalSubmissionRaw": 2549}, "2738": {"acRate": 55.756843800322066, "difficulty": "Medium", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4155, "totalSubmissionRaw": 7452}, "2739": {"acRate": 39.05123553684052, "difficulty": "Easy", "likes": 276, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41547, "totalSubmissionRaw": 106391}, "2740": {"acRate": 65.0569161779924, "difficulty": "Medium", "likes": 275, "dislikes": 18, "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": 32062, "totalSubmissionRaw": 49283}, "2741": {"acRate": 28.06700607653145, "difficulty": "Medium", "likes": 545, "dislikes": 60, "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": 13672, "totalSubmissionRaw": 48712}, "2742": {"acRate": 50.94583984264334, "difficulty": "Hard", "likes": 1348, "dislikes": 78, "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": 62939, "totalSubmissionRaw": 123541}, "2743": {"acRate": 70.84771768316071, "difficulty": "Medium", "likes": 50, "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": 1847, "totalSubmissionRaw": 2607}, "2744": {"acRate": 81.07790441225023, "difficulty": "Easy", "likes": 337, "dislikes": 13, "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": 61393, "totalSubmissionRaw": 75721}, "2745": {"acRate": 53.48692755096279, "difficulty": "Medium", "likes": 296, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2745", "paidOnly": false, "title": "Construct the Longest New String", "titleSlug": "construct-the-longest-new-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18944, "totalSubmissionRaw": 35418}, "2746": {"acRate": 26.45545353647463, "difficulty": "Medium", "likes": 353, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7866, "totalSubmissionRaw": 29733}, "2747": {"acRate": 32.503349709691825, "difficulty": "Medium", "likes": 330, "dislikes": 37, "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": 5822, "totalSubmissionRaw": 17912}, "2748": {"acRate": 49.860690673052304, "difficulty": "Easy", "likes": 201, "dislikes": 35, "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": 33107, "totalSubmissionRaw": 66399}, "2749": {"acRate": 29.414229988071828, "difficulty": "Medium", "likes": 276, "dislikes": 285, "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": 9124, "totalSubmissionRaw": 31019}, "2750": {"acRate": 33.71946362187998, "difficulty": "Medium", "likes": 420, "dislikes": 12, "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": 20318, "totalSubmissionRaw": 60256}, "2751": {"acRate": 40.51524223131087, "difficulty": "Hard", "likes": 407, "dislikes": 17, "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": 9609, "totalSubmissionRaw": 23717}, "2752": {"acRate": 36.79641556986839, "difficulty": "Hard", "likes": 11, "dislikes": 24, "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": 1314, "totalSubmissionRaw": 3571}, "2753": {"acRate": 70.20364415862808, "difficulty": "Hard", "likes": 27, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2753", "paidOnly": true, "title": "Count Houses in a Circular Street II", "titleSlug": "count-houses-in-a-circular-street-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 655, "totalSubmissionRaw": 933}, "2754": {"acRate": 86.79549114331722, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 539, "totalSubmissionRaw": 621}, "2755": {"acRate": 64.48087431693989, "difficulty": "Medium", "likes": 14, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472, "totalSubmissionRaw": 732}, "2756": {"acRate": 61.82669789227167, "difficulty": "Hard", "likes": 12, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264, "totalSubmissionRaw": 427}, "2757": {"acRate": 71.45708582834331, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358, "totalSubmissionRaw": 501}, "2758": {"acRate": 86.6734486266531, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 852, "totalSubmissionRaw": 983}, "2759": {"acRate": 65.05636070853463, "difficulty": "Hard", "likes": 15, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 404, "totalSubmissionRaw": 621}, "2760": {"acRate": 29.481172850178073, "difficulty": "Easy", "likes": 283, "dislikes": 264, "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": 34105, "totalSubmissionRaw": 115684}, "2761": {"acRate": 33.80251500428694, "difficulty": "Medium", "likes": 354, "dislikes": 32, "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": 28386, "totalSubmissionRaw": 83976}, "2762": {"acRate": 40.83846888290947, "difficulty": "Medium", "likes": 670, "dislikes": 21, "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": 18820, "totalSubmissionRaw": 46084}, "2763": {"acRate": 46.13555291319857, "difficulty": "Hard", "likes": 297, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2763", "paidOnly": false, "title": "Sum of Imbalance Numbers of All Subarrays", "titleSlug": "sum-of-imbalance-numbers-of-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7372, "totalSubmissionRaw": 15979}, "2764": {"acRate": 66.77785190126751, "difficulty": "Medium", "likes": 30, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1001, "totalSubmissionRaw": 1499}, "2765": {"acRate": 33.88801599771461, "difficulty": "Easy", "likes": 207, "dislikes": 172, "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": 23725, "totalSubmissionRaw": 70010}, "2766": {"acRate": 51.47958645426732, "difficulty": "Medium", "likes": 189, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19519, "totalSubmissionRaw": 37916}, "2767": {"acRate": 52.88806812352519, "difficulty": "Medium", "likes": 342, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15465, "totalSubmissionRaw": 29241}, "2768": {"acRate": 36.09079326129017, "difficulty": "Medium", "likes": 224, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7648, "totalSubmissionRaw": 21191}, "2769": {"acRate": 90.03972589134969, "difficulty": "Easy", "likes": 317, "dislikes": 428, "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": 90661, "totalSubmissionRaw": 100690}, "2770": {"acRate": 30.58746813681902, "difficulty": "Medium", "likes": 408, "dislikes": 14, "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": 25799, "totalSubmissionRaw": 84345}, "2771": {"acRate": 29.037844123669643, "difficulty": "Medium", "likes": 575, "dislikes": 17, "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": 22973, "totalSubmissionRaw": 79114}, "2772": {"acRate": 32.60632199596004, "difficulty": "Medium", "likes": 362, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11945, "totalSubmissionRaw": 36634}, "2773": {"acRate": 73.35490830636462, "difficulty": "Medium", "likes": 9, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 680, "totalSubmissionRaw": 927}, "2774": {"acRate": 81.24165554072096, "difficulty": "Easy", "likes": 20, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1217, "totalSubmissionRaw": 1498}, "2775": {"acRate": 67.78975741239893, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503, "totalSubmissionRaw": 742}, "2776": {"acRate": 91.69139465875371, "difficulty": "Medium", "likes": 16, "dislikes": 7, "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": 618, "totalSubmissionRaw": 674}, "2777": {"acRate": 81.54205607476635, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 349, "totalSubmissionRaw": 428}, "2778": {"acRate": 80.69772808861993, "difficulty": "Easy", "likes": 256, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2778", "paidOnly": false, "title": "Sum of Squares of Special Elements ", "titleSlug": "sum-of-squares-of-special-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62941, "totalSubmissionRaw": 77996}, "2779": {"acRate": 37.80881603139533, "difficulty": "Medium", "likes": 595, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2779", "paidOnly": false, "title": "Maximum Beauty of an Array After Applying Operation", "titleSlug": "maximum-beauty-of-an-array-after-applying-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24471, "totalSubmissionRaw": 64723}, "2780": {"acRate": 61.97487505065514, "difficulty": "Medium", "likes": 326, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22940, "totalSubmissionRaw": 37015}, "2781": {"acRate": 37.019398142345885, "difficulty": "Hard", "likes": 534, "dislikes": 20, "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": 26583, "totalSubmissionRaw": 71809}, "2782": {"acRate": 83.42541436464089, "difficulty": "Medium", "likes": 31, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1963, "totalSubmissionRaw": 2353}, "2783": {"acRate": 36.8295994568907, "difficulty": "Medium", "likes": 15, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2170, "totalSubmissionRaw": 5892}, "2784": {"acRate": 49.434913067569966, "difficulty": "Easy", "likes": 263, "dislikes": 49, "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": 47284, "totalSubmissionRaw": 95649}, "2785": {"acRate": 81.40260530955491, "difficulty": "Medium", "likes": 969, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128354, "totalSubmissionRaw": 157678}, "2786": {"acRate": 35.7561749030545, "difficulty": "Medium", "likes": 468, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18718, "totalSubmissionRaw": 52349}, "2787": {"acRate": 33.590617293247234, "difficulty": "Medium", "likes": 388, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2787", "paidOnly": false, "title": "Ways to Express an Integer as Sum of Powers", "titleSlug": "ways-to-express-an-integer-as-sum-of-powers", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17843, "totalSubmissionRaw": 53119}, "2788": {"acRate": 73.85754037694713, "difficulty": "Easy", "likes": 303, "dislikes": 7, "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": 51492, "totalSubmissionRaw": 69718}, "2789": {"acRate": 46.94157199534743, "difficulty": "Medium", "likes": 456, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29461, "totalSubmissionRaw": 62761}, "2790": {"acRate": 19.71950701232469, "difficulty": "Hard", "likes": 394, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8816, "totalSubmissionRaw": 44707}, "2791": {"acRate": 47.49878187428943, "difficulty": "Hard", "likes": 369, "dislikes": 9, "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": 5849, "totalSubmissionRaw": 12314}, "2792": {"acRate": 58.56307435254804, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 701, "totalSubmissionRaw": 1197}, "2793": {"acRate": 73.7560975609756, "difficulty": "Hard", "likes": 8, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1512, "totalSubmissionRaw": 2050}, "2794": {"acRate": 63.312368972746334, "difficulty": "Easy", "likes": 9, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2794", "paidOnly": true, "title": "Create Object from Two Arrays", "titleSlug": "create-object-from-two-arrays", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 906, "totalSubmissionRaw": 1431}, "2795": {"acRate": 88.25503355704699, "difficulty": "Medium", "likes": 13, "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": 526, "totalSubmissionRaw": 596}, "2796": {"acRate": 92.67202859696158, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2074, "totalSubmissionRaw": 2238}, "2797": {"acRate": 91.8200408997955, "difficulty": "Easy", "likes": 10, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 898, "totalSubmissionRaw": 978}, "2798": {"acRate": 87.65751748874663, "difficulty": "Easy", "likes": 465, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147609, "totalSubmissionRaw": 168393}, "2799": {"acRate": 64.6877291094781, "difficulty": "Medium", "likes": 540, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2799", "paidOnly": false, "title": "Count Complete Subarrays in an Array", "titleSlug": "count-complete-subarrays-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37939, "totalSubmissionRaw": 58650}, "2800": {"acRate": 30.282871868632387, "difficulty": "Medium", "likes": 316, "dislikes": 258, "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": 15159, "totalSubmissionRaw": 50058}, "2801": {"acRate": 27.529290398644168, "difficulty": "Hard", "likes": 327, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7472, "totalSubmissionRaw": 27142}, "2802": {"acRate": 78.7033683448026, "difficulty": "Medium", "likes": 53, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4346, "totalSubmissionRaw": 5522}, "2803": {"acRate": 86.11410118406889, "difficulty": "Easy", "likes": 17, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 800, "totalSubmissionRaw": 929}, "2804": {"acRate": 88.75, "difficulty": "Easy", "likes": 8, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 781, "totalSubmissionRaw": 880}, "2805": {"acRate": 81.25, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 377, "totalSubmissionRaw": 464}, "2806": {"acRate": 52.13473394003599, "difficulty": "Easy", "likes": 194, "dislikes": 43, "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": 40846, "totalSubmissionRaw": 78347}, "2807": {"acRate": 88.48030540526875, "difficulty": "Medium", "likes": 507, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69995, "totalSubmissionRaw": 79108}, "2808": {"acRate": 26.57907766303579, "difficulty": "Medium", "likes": 508, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15031, "totalSubmissionRaw": 56552}, "2809": {"acRate": 25.38856459666643, "difficulty": "Hard", "likes": 223, "dislikes": 12, "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": 3610, "totalSubmissionRaw": 14219}, "2810": {"acRate": 83.4223870945785, "difficulty": "Easy", "likes": 415, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2810", "paidOnly": false, "title": "Faulty Keyboard", "titleSlug": "faulty-keyboard", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73533, "totalSubmissionRaw": 88144}, "2811": {"acRate": 33.55125985086758, "difficulty": "Medium", "likes": 450, "dislikes": 89, "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": 28482, "totalSubmissionRaw": 84891}, "2812": {"acRate": 49.11892954158206, "difficulty": "Medium", "likes": 1528, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "2812", "paidOnly": false, "title": "Find the Safest Path in a Grid", "titleSlug": "find-the-safest-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90230, "totalSubmissionRaw": 183697}, "2813": {"acRate": 31.87264073526998, "difficulty": "Hard", "likes": 288, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5826, "totalSubmissionRaw": 18279}, "2814": {"acRate": 62.877583465818766, "difficulty": "Hard", "likes": 19, "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": 791, "totalSubmissionRaw": 1258}, "2815": {"acRate": 57.638278616492435, "difficulty": "Easy", "likes": 322, "dislikes": 117, "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": 43944, "totalSubmissionRaw": 76241}, "2816": {"acRate": 61.64236289815291, "difficulty": "Medium", "likes": 1106, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161690, "totalSubmissionRaw": 262304}, "2817": {"acRate": 33.52269653194828, "difficulty": "Medium", "likes": 660, "dislikes": 68, "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": 24784, "totalSubmissionRaw": 73932}, "2818": {"acRate": 32.599097087860294, "difficulty": "Hard", "likes": 318, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6571, "totalSubmissionRaw": 20157}, "2819": {"acRate": 52.76532137518684, "difficulty": "Hard", "likes": 15, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 353, "totalSubmissionRaw": 669}, "2820": {"acRate": 65.08728179551122, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1827, "totalSubmissionRaw": 2807}, "2821": {"acRate": 64.80836236933798, "difficulty": "Medium", "likes": 16, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2821", "paidOnly": true, "title": "Delay the Resolution of Each Promise", "titleSlug": "delay-the-resolution-of-each-promise", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 558, "totalSubmissionRaw": 861}, "2822": {"acRate": 59.13978494623656, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 715, "totalSubmissionRaw": 1209}, "2823": {"acRate": 55.932203389830505, "difficulty": "Medium", "likes": 13, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 330, "totalSubmissionRaw": 590}, "2824": {"acRate": 87.12585348438387, "difficulty": "Easy", "likes": 542, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2824", "paidOnly": false, "title": "Count Pairs Whose Sum is Less than Target", "titleSlug": "count-pairs-whose-sum-is-less-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 136663, "totalSubmissionRaw": 156857}, "2825": {"acRate": 49.0274443278368, "difficulty": "Medium", "likes": 316, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2825", "paidOnly": false, "title": "Make String a Subsequence Using Cyclic Increments", "titleSlug": "make-string-a-subsequence-using-cyclic-increments", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34103, "totalSubmissionRaw": 69559}, "2826": {"acRate": 42.01968808760093, "difficulty": "Medium", "likes": 488, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18995, "totalSubmissionRaw": 45205}, "2827": {"acRate": 17.69634995029115, "difficulty": "Hard", "likes": 345, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2827", "paidOnly": false, "title": "Number of Beautiful Integers in the Range", "titleSlug": "number-of-beautiful-integers-in-the-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8722, "totalSubmissionRaw": 49287}, "2828": {"acRate": 82.98240553792905, "difficulty": "Easy", "likes": 305, "dislikes": 10, "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": 86310, "totalSubmissionRaw": 104010}, "2829": {"acRate": 61.12739368875303, "difficulty": "Medium", "likes": 324, "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": 33996, "totalSubmissionRaw": 55615}, "2830": {"acRate": 36.04183150435171, "difficulty": "Medium", "likes": 648, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2830", "paidOnly": false, "title": "Maximize the Profit as the Salesman", "titleSlug": "maximize-the-profit-as-the-salesman", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20954, "totalSubmissionRaw": 58138}, "2831": {"acRate": 35.54373215676097, "difficulty": "Medium", "likes": 656, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19173, "totalSubmissionRaw": 53942}, "2832": {"acRate": 73.6875, "difficulty": "Medium", "likes": 35, "dislikes": 1, "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": 1179, "totalSubmissionRaw": 1600}, "2833": {"acRate": 64.42702710281685, "difficulty": "Easy", "likes": 232, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45950, "totalSubmissionRaw": 71321}, "2834": {"acRate": 38.79741100323625, "difficulty": "Medium", "likes": 291, "dislikes": 48, "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": 29971, "totalSubmissionRaw": 77250}, "2835": {"acRate": 32.1521008866127, "difficulty": "Hard", "likes": 516, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "2835", "paidOnly": false, "title": "Minimum Operations to Form Subsequence With Target Sum", "titleSlug": "minimum-operations-to-form-subsequence-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11677, "totalSubmissionRaw": 36318}, "2836": {"acRate": 30.476711579235342, "difficulty": "Hard", "likes": 285, "dislikes": 91, "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": 4456, "totalSubmissionRaw": 14621}, "2837": {"acRate": 73.9987285441831, "difficulty": "Easy", "likes": 14, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2328, "totalSubmissionRaw": 3146}, "2838": {"acRate": 68.80733944954129, "difficulty": "Medium", "likes": 29, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1125, "totalSubmissionRaw": 1635}, "2839": {"acRate": 46.92208406282348, "difficulty": "Easy", "likes": 177, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36717, "totalSubmissionRaw": 78251}, "2840": {"acRate": 55.546073264918604, "difficulty": "Medium", "likes": 249, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26035, "totalSubmissionRaw": 46871}, "2841": {"acRate": 37.75212961942402, "difficulty": "Medium", "likes": 268, "dislikes": 134, "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": 23976, "totalSubmissionRaw": 63509}, "2842": {"acRate": 29.178670833536795, "difficulty": "Hard", "likes": 322, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2842", "paidOnly": false, "title": "Count K-Subsequences of a String With Maximum Beauty", "titleSlug": "count-k-subsequences-of-a-string-with-maximum-beauty", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11951, "totalSubmissionRaw": 40958}, "2843": {"acRate": 74.18003595292203, "difficulty": "Easy", "likes": 247, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43741, "totalSubmissionRaw": 58966}, "2844": {"acRate": 37.970225950275825, "difficulty": "Medium", "likes": 340, "dislikes": 51, "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": 25123, "totalSubmissionRaw": 66165}, "2845": {"acRate": 34.82308637778185, "difficulty": "Medium", "likes": 484, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13316, "totalSubmissionRaw": 38239}, "2846": {"acRate": 43.84615384615385, "difficulty": "Hard", "likes": 285, "dislikes": 6, "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": 5529, "totalSubmissionRaw": 12610}, "2847": {"acRate": 43.521946060285565, "difficulty": "Medium", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2847", "paidOnly": true, "title": "Smallest Number With Given Digit Product", "titleSlug": "smallest-number-with-given-digit-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 823, "totalSubmissionRaw": 1891}, "2848": {"acRate": 75.03075030750308, "difficulty": "Easy", "likes": 262, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45140, "totalSubmissionRaw": 60162}, "2849": {"acRate": 35.6955686676118, "difficulty": "Medium", "likes": 812, "dislikes": 754, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97944, "totalSubmissionRaw": 274387}, "2850": {"acRate": 43.91535507827334, "difficulty": "Medium", "likes": 486, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2850", "paidOnly": false, "title": "Minimum Moves to Spread Stones Over Grid", "titleSlug": "minimum-moves-to-spread-stones-over-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20815, "totalSubmissionRaw": 47398}, "2851": {"acRate": 28.988374969082365, "difficulty": "Hard", "likes": 160, "dislikes": 29, "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": 3516, "totalSubmissionRaw": 12129}, "2852": {"acRate": 65.16572858036272, "difficulty": "Medium", "likes": 27, "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": 1042, "totalSubmissionRaw": 1599}, "2853": {"acRate": 73.70139507272188, "difficulty": "Easy", "likes": 14, "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": 2483, "totalSubmissionRaw": 3369}, "2854": {"acRate": 65.33568904593639, "difficulty": "Medium", "likes": 14, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1849, "totalSubmissionRaw": 2830}, "2855": {"acRate": 57.78156269959549, "difficulty": "Easy", "likes": 205, "dislikes": 8, "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": 32568, "totalSubmissionRaw": 56364}, "2856": {"acRate": 21.572489016815634, "difficulty": "Medium", "likes": 327, "dislikes": 92, "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": 21360, "totalSubmissionRaw": 99015}, "2857": {"acRate": 32.04450625869263, "difficulty": "Medium", "likes": 261, "dislikes": 38, "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": 10368, "totalSubmissionRaw": 32355}, "2858": {"acRate": 58.56362217017955, "difficulty": "Hard", "likes": 279, "dislikes": 3, "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": 7502, "totalSubmissionRaw": 12810}, "2859": {"acRate": 86.41320132013202, "difficulty": "Easy", "likes": 248, "dislikes": 37, "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": 65458, "totalSubmissionRaw": 75750}, "2860": {"acRate": 51.95753151957532, "difficulty": "Medium", "likes": 157, "dislikes": 288, "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": 21141, "totalSubmissionRaw": 40689}, "2861": {"acRate": 38.20823516212275, "difficulty": "Medium", "likes": 265, "dislikes": 43, "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": 13621, "totalSubmissionRaw": 35651}, "2862": {"acRate": 43.61024284683818, "difficulty": "Hard", "likes": 182, "dislikes": 45, "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": 7255, "totalSubmissionRaw": 16636}, "2863": {"acRate": 71.4070026601481, "difficulty": "Medium", "likes": 104, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2863", "paidOnly": true, "title": "Maximum Length of Semi-Decreasing Subarrays", "titleSlug": "maximum-length-of-semi-decreasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9931, "totalSubmissionRaw": 13908}, "2864": {"acRate": 83.04582792909642, "difficulty": "Easy", "likes": 751, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2864", "paidOnly": false, "title": "Maximum Odd Binary Number", "titleSlug": "maximum-odd-binary-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192085, "totalSubmissionRaw": 231300}, "2865": {"acRate": 43.48066088015837, "difficulty": "Medium", "likes": 225, "dislikes": 40, "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": 22843, "totalSubmissionRaw": 52536}, "2866": {"acRate": 34.53646681947474, "difficulty": "Medium", "likes": 388, "dislikes": 24, "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": 12506, "totalSubmissionRaw": 36211}, "2867": {"acRate": 34.75485610521103, "difficulty": "Hard", "likes": 238, "dislikes": 6, "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": 6316, "totalSubmissionRaw": 18173}, "2868": {"acRate": 61.29032258064516, "difficulty": "Hard", "likes": 9, "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": 418, "totalSubmissionRaw": 682}, "2869": {"acRate": 59.83328946213916, "difficulty": "Easy", "likes": 163, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34096, "totalSubmissionRaw": 56985}, "2870": {"acRate": 61.924562029484186, "difficulty": "Medium", "likes": 1358, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175288, "totalSubmissionRaw": 283067}, "2871": {"acRate": 43.79782183747557, "difficulty": "Medium", "likes": 216, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2871", "paidOnly": false, "title": "Split Array Into Maximum Number of Subarrays", "titleSlug": "split-array-into-maximum-number-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15684, "totalSubmissionRaw": 35810}, "2872": {"acRate": 58.17880983625264, "difficulty": "Hard", "likes": 181, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10197, "totalSubmissionRaw": 17527}, "2873": {"acRate": 45.43590646658532, "difficulty": "Easy", "likes": 157, "dislikes": 15, "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": 36122, "totalSubmissionRaw": 79501}, "2874": {"acRate": 41.30612244897959, "difficulty": "Medium", "likes": 267, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2874", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet II", "titleSlug": "maximum-value-of-an-ordered-triplet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25300, "totalSubmissionRaw": 61250}, "2875": {"acRate": 30.753446193053, "difficulty": "Medium", "likes": 359, "dislikes": 24, "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": 18584, "totalSubmissionRaw": 60429}, "2876": {"acRate": 32.64766681351452, "difficulty": "Hard", "likes": 303, "dislikes": 5, "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": 9634, "totalSubmissionRaw": 29509}, "2877": {"acRate": 81.14533478188527, "difficulty": "Easy", "likes": 154, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82905, "totalSubmissionRaw": 102169}, "2878": {"acRate": 84.70393429593324, "difficulty": "Easy", "likes": 80, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63941, "totalSubmissionRaw": 75488}, "2879": {"acRate": 92.58296708530064, "difficulty": "Easy", "likes": 69, "dislikes": 16, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68040, "totalSubmissionRaw": 73491}, "2880": {"acRate": 78.65376912006884, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53015, "totalSubmissionRaw": 67403}, "2881": {"acRate": 89.9171320482796, "difficulty": "Easy", "likes": 57, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49910, "totalSubmissionRaw": 55505}, "2882": {"acRate": 84.79275059035844, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44166, "totalSubmissionRaw": 52087}, "2883": {"acRate": 64.17260799700463, "difficulty": "Easy", "likes": 52, "dislikes": 2, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41133, "totalSubmissionRaw": 64097}, "2884": {"acRate": 91.4556070062412, "difficulty": "Easy", "likes": 54, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45426, "totalSubmissionRaw": 49670}, "2885": {"acRate": 84.80880041906758, "difficulty": "Easy", "likes": 45, "dislikes": 2, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38856, "totalSubmissionRaw": 45816}, "2886": {"acRate": 86.85697225794598, "difficulty": "Easy", "likes": 51, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37821, "totalSubmissionRaw": 43544}, "2887": {"acRate": 71.77542029672652, "difficulty": "Easy", "likes": 50, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36331, "totalSubmissionRaw": 50618}, "2888": {"acRate": 90.27231825716315, "difficulty": "Easy", "likes": 48, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38122, "totalSubmissionRaw": 42230}, "2889": {"acRate": 80.1469284357188, "difficulty": "Easy", "likes": 73, "dislikes": 11, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31637, "totalSubmissionRaw": 39474}, "2890": {"acRate": 84.90539355714569, "difficulty": "Easy", "likes": 64, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30020, "totalSubmissionRaw": 35357}, "2891": {"acRate": 74.94096037785359, "difficulty": "Easy", "likes": 58, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31414, "totalSubmissionRaw": 41919}, "2892": {"acRate": 40.21543985637343, "difficulty": "Medium", "likes": 21, "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": 672, "totalSubmissionRaw": 1671}, "2893": {"acRate": 67.49226006191951, "difficulty": "Medium", "likes": 15, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1744, "totalSubmissionRaw": 2584}, "2894": {"acRate": 88.62236743136518, "difficulty": "Easy", "likes": 200, "dislikes": 15, "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": 75407, "totalSubmissionRaw": 85088}, "2895": {"acRate": 68.69292237442922, "difficulty": "Medium", "likes": 247, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2895", "paidOnly": false, "title": "Minimum Processing Time", "titleSlug": "minimum-processing-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31291, "totalSubmissionRaw": 45552}, "2896": {"acRate": 26.530476443971253, "difficulty": "Medium", "likes": 335, "dislikes": 66, "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": 11961, "totalSubmissionRaw": 45084}, "2897": {"acRate": 46.99727676651856, "difficulty": "Hard", "likes": 175, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6558, "totalSubmissionRaw": 13954}, "2898": {"acRate": 68.20987654320987, "difficulty": "Medium", "likes": 20, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 663, "totalSubmissionRaw": 972}, "2899": {"acRate": 65.84802904564316, "difficulty": "Easy", "likes": 152, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25391, "totalSubmissionRaw": 38560}, "2900": {"acRate": 63.607011070110694, "difficulty": "Easy", "likes": 167, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24822, "totalSubmissionRaw": 39024}, "2901": {"acRate": 27.123719464144997, "difficulty": "Medium", "likes": 190, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10326, "totalSubmissionRaw": 38070}, "2902": {"acRate": 20.566168254137178, "difficulty": "Hard", "likes": 135, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3865, "totalSubmissionRaw": 18793}, "2903": {"acRate": 61.97616683217477, "difficulty": "Easy", "likes": 128, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37446, "totalSubmissionRaw": 60420}, "2904": {"acRate": 38.69846158731167, "difficulty": "Medium", "likes": 172, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2904", "paidOnly": false, "title": "Shortest and Lexicographically Smallest Beautiful String", "titleSlug": "shortest-and-lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24375, "totalSubmissionRaw": 62987}, "2905": {"acRate": 32.12754505465952, "difficulty": "Medium", "likes": 251, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17310, "totalSubmissionRaw": 53879}, "2906": {"acRate": 30.826021827519796, "difficulty": "Medium", "likes": 218, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11524, "totalSubmissionRaw": 37384}, "2907": {"acRate": 57.08616780045352, "difficulty": "Medium", "likes": 18, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2907", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices I", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1007, "totalSubmissionRaw": 1764}, "2908": {"acRate": 64.63392874843878, "difficulty": "Easy", "likes": 149, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32602, "totalSubmissionRaw": 50441}, "2909": {"acRate": 53.937607000190226, "difficulty": "Medium", "likes": 184, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22684, "totalSubmissionRaw": 42056}, "2910": {"acRate": 25.130607844763247, "difficulty": "Medium", "likes": 364, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12122, "totalSubmissionRaw": 48236}, "2911": {"acRate": 35.793681747269886, "difficulty": "Hard", "likes": 119, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3671, "totalSubmissionRaw": 10256}, "2912": {"acRate": 64.93506493506493, "difficulty": "Hard", "likes": 15, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 800, "totalSubmissionRaw": 1232}, "2913": {"acRate": 82.56016742239275, "difficulty": "Easy", "likes": 137, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30771, "totalSubmissionRaw": 37271}, "2914": {"acRate": 59.55390091767087, "difficulty": "Medium", "likes": 136, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18236, "totalSubmissionRaw": 30621}, "2915": {"acRate": 34.846302543304404, "difficulty": "Medium", "likes": 198, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2915", "paidOnly": false, "title": "Length of the Longest Subsequence That Sums to Target", "titleSlug": "length-of-the-longest-subsequence-that-sums-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18387, "totalSubmissionRaw": 52766}, "2916": {"acRate": 20.220876380477378, "difficulty": "Hard", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2838, "totalSubmissionRaw": 14035}, "2917": {"acRate": 74.55875628715135, "difficulty": "Easy", "likes": 215, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24459, "totalSubmissionRaw": 32805}, "2918": {"acRate": 34.45301795629913, "difficulty": "Medium", "likes": 167, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2918", "paidOnly": false, "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "titleSlug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23888, "totalSubmissionRaw": 69335}, "2919": {"acRate": 34.086080730191206, "difficulty": "Medium", "likes": 302, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2919", "paidOnly": false, "title": "Minimum Increment Operations to Make Array Beautiful", "titleSlug": "minimum-increment-operations-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12996, "totalSubmissionRaw": 38127}, "2920": {"acRate": 37.28107195610889, "difficulty": "Hard", "likes": 192, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7067, "totalSubmissionRaw": 18956}, "2921": {"acRate": 49.405548216644654, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2921", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices II", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 374, "totalSubmissionRaw": 757}, "2922": {"acRate": 39.40210072717479, "difficulty": "Medium", "likes": 11, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1463, "totalSubmissionRaw": 3713}, "2923": {"acRate": 73.11275907967294, "difficulty": "Easy", "likes": 133, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34605, "totalSubmissionRaw": 47331}, "2924": {"acRate": 57.81083953241233, "difficulty": "Medium", "likes": 136, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24480, "totalSubmissionRaw": 42345}, "2925": {"acRate": 49.162350275169956, "difficulty": "Medium", "likes": 310, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12149, "totalSubmissionRaw": 24712}, "2926": {"acRate": 23.670007710100233, "difficulty": "Hard", "likes": 180, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2926", "paidOnly": false, "title": "Maximum Balanced Subsequence Sum", "titleSlug": "maximum-balanced-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5219, "totalSubmissionRaw": 22049}, "2927": {"acRate": 44.52621895124195, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2927", "paidOnly": true, "title": "Distribute Candies Among Children III", "titleSlug": "distribute-candies-among-children-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 484, "totalSubmissionRaw": 1087}, "2928": {"acRate": 75.38166106577052, "difficulty": "Easy", "likes": 98, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23553, "totalSubmissionRaw": 31245}, "2929": {"acRate": 34.99611453165162, "difficulty": "Medium", "likes": 88, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11709, "totalSubmissionRaw": 33458}, "2930": {"acRate": 55.72134575175822, "difficulty": "Medium", "likes": 161, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5863, "totalSubmissionRaw": 10522}, "2931": {"acRate": 65.00235833164881, "difficulty": "Hard", "likes": 84, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9647, "totalSubmissionRaw": 14841}, "2932": {"acRate": 75.96311103034708, "difficulty": "Easy", "likes": 125, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33442, "totalSubmissionRaw": 44024}, "2933": {"acRate": 43.959745944554115, "difficulty": "Medium", "likes": 189, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20487, "totalSubmissionRaw": 46604}, "2934": {"acRate": 44.723348894160864, "difficulty": "Medium", "likes": 176, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11688, "totalSubmissionRaw": 26134}, "2935": {"acRate": 29.971598244255098, "difficulty": "Hard", "likes": 160, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2935", "paidOnly": false, "title": "Maximum Strong Pair XOR II", "titleSlug": "maximum-strong-pair-xor-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5804, "totalSubmissionRaw": 19365}, "2936": {"acRate": 68.0081300813008, "difficulty": "Medium", "likes": 19, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2936", "paidOnly": true, "title": "Number of Equal Numbers Blocks", "titleSlug": "number-of-equal-numbers-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1673, "totalSubmissionRaw": 2460}, "2937": {"acRate": 42.7050639055169, "difficulty": "Easy", "likes": 285, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2937", "paidOnly": false, "title": "Make Three Strings Equal", "titleSlug": "make-three-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26396, "totalSubmissionRaw": 61810}, "2938": {"acRate": 52.90720875096828, "difficulty": "Medium", "likes": 174, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2938", "paidOnly": false, "title": "Separate Black and White Balls", "titleSlug": "separate-black-and-white-balls", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22539, "totalSubmissionRaw": 42601}, "2939": {"acRate": 25.683970266185497, "difficulty": "Medium", "likes": 189, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8327, "totalSubmissionRaw": 32421}, "2940": {"acRate": 35.22294049394994, "difficulty": "Hard", "likes": 223, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6375, "totalSubmissionRaw": 18099}, "2941": {"acRate": 47.39069111424541, "difficulty": "Hard", "likes": 12, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 336, "totalSubmissionRaw": 709}, "2942": {"acRate": 88.4076316552029, "difficulty": "Easy", "likes": 297, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2942", "paidOnly": false, "title": "Find Words Containing Character", "titleSlug": "find-words-containing-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115934, "totalSubmissionRaw": 131130}, "2943": {"acRate": 36.269276393831554, "difficulty": "Medium", "likes": 220, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11007, "totalSubmissionRaw": 30348}, "2944": {"acRate": 44.52617228369424, "difficulty": "Medium", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14044, "totalSubmissionRaw": 31541}, "2945": {"acRate": 15.758974842174691, "difficulty": "Hard", "likes": 142, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3345, "totalSubmissionRaw": 21226}, "2946": {"acRate": 57.74590718441348, "difficulty": "Easy", "likes": 96, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2946", "paidOnly": false, "title": "Matrix Similarity After Cyclic Shifts", "titleSlug": "matrix-similarity-after-cyclic-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21340, "totalSubmissionRaw": 36955}, "2947": {"acRate": 61.60634064946734, "difficulty": "Medium", "likes": 129, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19199, "totalSubmissionRaw": 31164}, "2948": {"acRate": 39.14242962685869, "difficulty": "Medium", "likes": 243, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8371, "totalSubmissionRaw": 21386}, "2949": {"acRate": 24.845316833795607, "difficulty": "Hard", "likes": 163, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4658, "totalSubmissionRaw": 18748}, "2950": {"acRate": 76.20320855614973, "difficulty": "Medium", "likes": 21, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1140, "totalSubmissionRaw": 1496}, "2951": {"acRate": 75.35191241291056, "difficulty": "Easy", "likes": 139, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42394, "totalSubmissionRaw": 56258}, "2952": {"acRate": 53.90797240594553, "difficulty": "Medium", "likes": 297, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2952", "paidOnly": false, "title": "Minimum Number of Coins to be Added", "titleSlug": "minimum-number-of-coins-to-be-added", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15160, "totalSubmissionRaw": 28122}, "2953": {"acRate": 26.476843613004036, "difficulty": "Hard", "likes": 184, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6100, "totalSubmissionRaw": 23039}, "2954": {"acRate": 36.25745526838966, "difficulty": "Hard", "likes": 71, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2918, "totalSubmissionRaw": 8048}, "2955": {"acRate": 70.88186356073211, "difficulty": "Medium", "likes": 25, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 852, "totalSubmissionRaw": 1202}, "2956": {"acRate": 82.81565345803592, "difficulty": "Easy", "likes": 158, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50472, "totalSubmissionRaw": 60945}, "2957": {"acRate": 51.96534128227152, "difficulty": "Medium", "likes": 153, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20571, "totalSubmissionRaw": 39586}, "2958": {"acRate": 55.73947463116229, "difficulty": "Medium", "likes": 991, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2958", "paidOnly": false, "title": "Length of Longest Subarray With at Most K Frequency", "titleSlug": "length-of-longest-subarray-with-at-most-k-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140958, "totalSubmissionRaw": 252885}, "2959": {"acRate": 50.65544586502671, "difficulty": "Hard", "likes": 144, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6260, "totalSubmissionRaw": 12358}, "2960": {"acRate": 80.75272798553786, "difficulty": "Easy", "likes": 132, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37076, "totalSubmissionRaw": 45913}, "2961": {"acRate": 47.557242852058366, "difficulty": "Medium", "likes": 103, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20043, "totalSubmissionRaw": 42145}, "2962": {"acRate": 59.085781686613906, "difficulty": "Medium", "likes": 1170, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2962", "paidOnly": false, "title": "Count Subarrays Where Max Element Appears at Least K Times", "titleSlug": "count-subarrays-where-max-element-appears-at-least-k-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126235, "totalSubmissionRaw": 213647}, "2963": {"acRate": 49.26575565980012, "difficulty": "Hard", "likes": 227, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9662, "totalSubmissionRaw": 19612}, "2964": {"acRate": 67.31662024141133, "difficulty": "Medium", "likes": 17, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1450, "totalSubmissionRaw": 2154}, "2965": {"acRate": 75.41480758505298, "difficulty": "Easy", "likes": 181, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43270, "totalSubmissionRaw": 57376}, "2966": {"acRate": 71.4104180812882, "difficulty": "Medium", "likes": 764, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147234, "totalSubmissionRaw": 206180}, "2967": {"acRate": 21.87987030435484, "difficulty": "Medium", "likes": 215, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12214, "totalSubmissionRaw": 55823}, "2968": {"acRate": 38.93869960815567, "difficulty": "Hard", "likes": 224, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5863, "totalSubmissionRaw": 15057}, "2969": {"acRate": 55.82371458551941, "difficulty": "Hard", "likes": 17, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 532, "totalSubmissionRaw": 953}, "2970": {"acRate": 50.84625634337879, "difficulty": "Easy", "likes": 131, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2970", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays I", "titleSlug": "count-the-number-of-incremovable-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17935, "totalSubmissionRaw": 35273}, "2971": {"acRate": 66.09018383981346, "difficulty": "Medium", "likes": 756, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2971", "paidOnly": false, "title": "Find Polygon With the Largest Perimeter", "titleSlug": "find-polygon-with-the-largest-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129815, "totalSubmissionRaw": 196421}, "2972": {"acRate": 39.025272935641475, "difficulty": "Hard", "likes": 183, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2972", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays II", "titleSlug": "count-the-number-of-incremovable-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6470, "totalSubmissionRaw": 16579}, "2973": {"acRate": 35.93394940160582, "difficulty": "Hard", "likes": 160, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7116, "totalSubmissionRaw": 19803}, "2974": {"acRate": 85.50754930408695, "difficulty": "Easy", "likes": 202, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69545, "totalSubmissionRaw": 81332}, "2975": {"acRate": 22.572147048257694, "difficulty": "Medium", "likes": 131, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13195, "totalSubmissionRaw": 58457}, "2976": {"acRate": 39.58404851813709, "difficulty": "Medium", "likes": 263, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13837, "totalSubmissionRaw": 34956}, "2977": {"acRate": 24.507396538300295, "difficulty": "Hard", "likes": 83, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2977", "paidOnly": false, "title": "Minimum Cost to Convert String II", "titleSlug": "minimum-cost-to-convert-string-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4092, "totalSubmissionRaw": 16697}, "2978": {"acRate": 42.150449713818475, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1031, "totalSubmissionRaw": 2446}, "2979": {"acRate": 77.77777777777779, "difficulty": "Medium", "likes": 13, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1337, "totalSubmissionRaw": 1719}, "2980": {"acRate": 70.14945713896334, "difficulty": "Easy", "likes": 95, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30884, "totalSubmissionRaw": 44026}, "2981": {"acRate": 42.46501265384698, "difficulty": "Medium", "likes": 150, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19632, "totalSubmissionRaw": 46231}, "2982": {"acRate": 33.5979897375256, "difficulty": "Medium", "likes": 229, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15911, "totalSubmissionRaw": 47357}, "2983": {"acRate": 25.381913959613694, "difficulty": "Hard", "likes": 81, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2891, "totalSubmissionRaw": 11390}, "2984": {"acRate": 60.16781836130306, "difficulty": "Medium", "likes": 4, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1219, "totalSubmissionRaw": 2026}, "2985": {"acRate": 86.85344827586206, "difficulty": "Easy", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1612, "totalSubmissionRaw": 1856}, "2986": {"acRate": 50.604288499025344, "difficulty": "Medium", "likes": 5, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1298, "totalSubmissionRaw": 2565}, "2987": {"acRate": 79.69995311767464, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1700, "totalSubmissionRaw": 2133}, "2988": {"acRate": 77.28674203494347, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2988", "paidOnly": true, "title": "Manager of the Largest Department", "titleSlug": "manager-of-the-largest-department", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1504, "totalSubmissionRaw": 1946}, "2989": {"acRate": 88.87330528284245, "difficulty": "Medium", "likes": 5, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1901, "totalSubmissionRaw": 2139}, "2990": {"acRate": 60.9989736572015, "difficulty": "Easy", "likes": 12, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1783, "totalSubmissionRaw": 2923}, "2991": {"acRate": 53.53260869565217, "difficulty": "Hard", "likes": 7, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 985, "totalSubmissionRaw": 1840}, "2992": {"acRate": 73.87140902872777, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2992", "paidOnly": true, "title": "Number of Self-Divisible Permutations", "titleSlug": "number-of-self-divisible-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1080, "totalSubmissionRaw": 1462}, "2993": {"acRate": 79.3491124260355, "difficulty": "Medium", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1341, "totalSubmissionRaw": 1690}, "2994": {"acRate": 73.71428571428571, "difficulty": "Hard", "likes": 9, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 903, "totalSubmissionRaw": 1225}, "2995": {"acRate": 42.85063752276867, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 941, "totalSubmissionRaw": 2196}, "2996": {"acRate": 31.855845762434935, "difficulty": "Easy", "likes": 96, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "2996", "paidOnly": false, "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "titleSlug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27296, "totalSubmissionRaw": 85686}, "2997": {"acRate": 86.54052241064781, "difficulty": "Medium", "likes": 555, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105788, "totalSubmissionRaw": 122241}, "2998": {"acRate": 45.19656550383411, "difficulty": "Medium", "likes": 218, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2998", "paidOnly": false, "title": "Minimum Number of Operations to Make X and Y Equal", "titleSlug": "minimum-number-of-operations-to-make-x-and-y-equal", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16739, "totalSubmissionRaw": 37036}, "2999": {"acRate": 26.02948343079922, "difficulty": "Hard", "likes": 102, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4273, "totalSubmissionRaw": 16416}, "3000": {"acRate": 35.636774597044074, "difficulty": "Easy", "likes": 91, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32479, "totalSubmissionRaw": 91139}, "3001": {"acRate": 20.415888558017464, "difficulty": "Medium", "likes": 143, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16180, "totalSubmissionRaw": 79252}, "3002": {"acRate": 44.910870107205184, "difficulty": "Medium", "likes": 273, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14411, "totalSubmissionRaw": 32088}, "3003": {"acRate": 27.696441808747217, "difficulty": "Hard", "likes": 98, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2989, "totalSubmissionRaw": 10792}, "3004": {"acRate": 66.27835683629675, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3004", "paidOnly": true, "title": "Maximum Subtree of the Same Color", "titleSlug": "maximum-subtree-of-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1081, "totalSubmissionRaw": 1631}, "3005": {"acRate": 79.10099452129626, "difficulty": "Easy", "likes": 605, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 196929, "totalSubmissionRaw": 248960}, "3006": {"acRate": 36.09569204778569, "difficulty": "Medium", "likes": 143, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23930, "totalSubmissionRaw": 66296}, "3007": {"acRate": 35.95575221238938, "difficulty": "Medium", "likes": 267, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "3007", "paidOnly": false, "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "titleSlug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8126, "totalSubmissionRaw": 22600}, "3008": {"acRate": 23.946593562798256, "difficulty": "Hard", "likes": 154, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9434, "totalSubmissionRaw": 39396}, "3009": {"acRate": 45.811204385814634, "difficulty": "Hard", "likes": 25, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2674, "totalSubmissionRaw": 5837}, "3010": {"acRate": 65.66457040877029, "difficulty": "Easy", "likes": 82, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30907, "totalSubmissionRaw": 47068}, "3011": {"acRate": 51.089611121547996, "difficulty": "Medium", "likes": 104, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21756, "totalSubmissionRaw": 42584}, "3012": {"acRate": 35.036300801028744, "difficulty": "Medium", "likes": 152, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13078, "totalSubmissionRaw": 37327}, "3013": {"acRate": 31.65651812897869, "difficulty": "Hard", "likes": 103, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4575, "totalSubmissionRaw": 14452}, "3014": {"acRate": 63.58287481424957, "difficulty": "Easy", "likes": 105, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31663, "totalSubmissionRaw": 49798}, "3015": {"acRate": 55.20955057954079, "difficulty": "Medium", "likes": 131, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17481, "totalSubmissionRaw": 31663}, "3016": {"acRate": 70.3540789268445, "difficulty": "Medium", "likes": 133, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22552, "totalSubmissionRaw": 32055}, "3017": {"acRate": 21.059718042135277, "difficulty": "Hard", "likes": 76, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2659, "totalSubmissionRaw": 12626}, "3018": {"acRate": 44.248826291079816, "difficulty": "Hard", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3018", "paidOnly": true, "title": "Maximum Number of Removal Queries That Can Be Processed I", "titleSlug": "maximum-number-of-removal-queries-that-can-be-processed-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 377, "totalSubmissionRaw": 852}, "3019": {"acRate": 80.5106599353503, "difficulty": "Easy", "likes": 96, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44334, "totalSubmissionRaw": 55066}, "3020": {"acRate": 24.46113735512016, "difficulty": "Medium", "likes": 161, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18952, "totalSubmissionRaw": 77478}, "3021": {"acRate": 47.55501532072223, "difficulty": "Medium", "likes": 88, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18779, "totalSubmissionRaw": 39489}, "3022": {"acRate": 33.55529131985731, "difficulty": "Hard", "likes": 78, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3022", "paidOnly": false, "title": "Minimize OR of Remaining Elements Using Operations", "titleSlug": "minimize-or-of-remaining-elements-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2822, "totalSubmissionRaw": 8410}, "3023": {"acRate": 59.859154929577464, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 680, "totalSubmissionRaw": 1136}, "3024": {"acRate": 38.21214180541398, "difficulty": "Easy", "likes": 79, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3024", "paidOnly": false, "title": "Type of Triangle", "titleSlug": "type-of-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40483, "totalSubmissionRaw": 105937}, "3025": {"acRate": 40.777691711851276, "difficulty": "Medium", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13161, "totalSubmissionRaw": 32275}, "3026": {"acRate": 17.833664490491056, "difficulty": "Medium", "likes": 277, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3026", "paidOnly": false, "title": "Maximum Good Subarray Sum", "titleSlug": "maximum-good-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15707, "totalSubmissionRaw": 88073}, "3027": {"acRate": 48.04958489707722, "difficulty": "Hard", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8450, "totalSubmissionRaw": 17586}, "3028": {"acRate": 74.7613007786351, "difficulty": "Easy", "likes": 86, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42439, "totalSubmissionRaw": 56766}, "3029": {"acRate": 40.034995247558975, "difficulty": "Medium", "likes": 132, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18533, "totalSubmissionRaw": 46292}, "3030": {"acRate": 43.858237910476014, "difficulty": "Medium", "likes": 47, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9269, "totalSubmissionRaw": 21134}, "3031": {"acRate": 35.506774138226724, "difficulty": "Hard", "likes": 121, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10352, "totalSubmissionRaw": 29155}, "3032": {"acRate": 87.69092542677448, "difficulty": "Easy", "likes": 17, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2928, "totalSubmissionRaw": 3339}, "3033": {"acRate": 68.00689367826976, "difficulty": "Easy", "likes": 92, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35909, "totalSubmissionRaw": 52800}, "3034": {"acRate": 66.26198430158342, "difficulty": "Medium", "likes": 82, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24397, "totalSubmissionRaw": 36819}, "3035": {"acRate": 42.203400347480766, "difficulty": "Medium", "likes": 195, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13603, "totalSubmissionRaw": 32232}, "3036": {"acRate": 32.104108064665695, "difficulty": "Hard", "likes": 133, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3036", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern II", "titleSlug": "number-of-subarrays-that-match-a-pattern-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10386, "totalSubmissionRaw": 32351}, "3037": {"acRate": 69.92481203007519, "difficulty": "Hard", "likes": 3, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 465, "totalSubmissionRaw": 665}, "3038": {"acRate": 51.52232578930812, "difficulty": "Easy", "likes": 62, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31120, "totalSubmissionRaw": 60401}, "3039": {"acRate": 56.43701514591799, "difficulty": "Medium", "likes": 122, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24442, "totalSubmissionRaw": 43310}, "3040": {"acRate": 32.4251939416328, "difficulty": "Medium", "likes": 139, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17555, "totalSubmissionRaw": 54140}, "3041": {"acRate": 31.43091206990715, "difficulty": "Hard", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6906, "totalSubmissionRaw": 21972}, "3042": {"acRate": 64.50391076264607, "difficulty": "Easy", "likes": 90, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34060, "totalSubmissionRaw": 52803}, "3043": {"acRate": 32.974028317829074, "difficulty": "Medium", "likes": 145, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20098, "totalSubmissionRaw": 60951}, "3044": {"acRate": 47.96375617792422, "difficulty": "Medium", "likes": 80, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14557, "totalSubmissionRaw": 30350}, "3045": {"acRate": 23.705301103994337, "difficulty": "Hard", "likes": 136, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7365, "totalSubmissionRaw": 31069}, "3046": {"acRate": 57.95079488224697, "difficulty": "Easy", "likes": 87, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44071, "totalSubmissionRaw": 76049}, "3047": {"acRate": 45.00905250452625, "difficulty": "Medium", "likes": 97, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18645, "totalSubmissionRaw": 41425}, "3048": {"acRate": 34.99724720132134, "difficulty": "Medium", "likes": 161, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "3048", "paidOnly": false, "title": "Earliest Second to Mark Indices I", "titleSlug": "earliest-second-to-mark-indices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7628, "totalSubmissionRaw": 21796}, "3049": {"acRate": 22.165659136705905, "difficulty": "Hard", "likes": 72, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2090, "totalSubmissionRaw": 9429}, "3050": {"acRate": 68.37416481069042, "difficulty": "Medium", "likes": 6, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 921, "totalSubmissionRaw": 1347}, "3051": {"acRate": 73.1108020398702, "difficulty": "Easy", "likes": 10, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3051", "paidOnly": true, "title": "Find Candidates for Data Scientist Position", "titleSlug": "find-candidates-for-data-scientist-position", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1577, "totalSubmissionRaw": 2157}, "3052": {"acRate": 70.05277044854881, "difficulty": "Hard", "likes": 3, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 531, "totalSubmissionRaw": 758}, "3053": {"acRate": 50.093808630394, "difficulty": "Easy", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3053", "paidOnly": true, "title": "Classifying Triangles by Lengths", "titleSlug": "classifying-triangles-by-lengths", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1068, "totalSubmissionRaw": 2132}, "3054": {"acRate": 78.49280270956817, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3054", "paidOnly": true, "title": "Binary Tree Nodes", "titleSlug": "binary-tree-nodes", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 927, "totalSubmissionRaw": 1181}, "3055": {"acRate": 60.028964518464875, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 829, "totalSubmissionRaw": 1381}, "3056": {"acRate": 58.911564625850346, "difficulty": "Medium", "likes": 2, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 866, "totalSubmissionRaw": 1470}, "3057": {"acRate": 68.18181818181817, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 660, "totalSubmissionRaw": 968}, "3058": {"acRate": 52.073085031623336, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 741, "totalSubmissionRaw": 1423}, "3059": {"acRate": 64.82300884955751, "difficulty": "Easy", "likes": 6, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1172, "totalSubmissionRaw": 1808}, "3060": {"acRate": 38.56088560885609, "difficulty": "Hard", "likes": 2, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 627, "totalSubmissionRaw": 1626}, "3061": {"acRate": 77.04280155642024, "difficulty": "Hard", "likes": 4, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 396, "totalSubmissionRaw": 514}, "3062": {"acRate": 81.84723224409855, "difficulty": "Easy", "likes": 25, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7940, "totalSubmissionRaw": 9701}, "3063": {"acRate": 86.60159716060338, "difficulty": "Easy", "likes": 36, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8784, "totalSubmissionRaw": 10143}, "3064": {"acRate": 91.48264984227129, "difficulty": "Medium", "likes": 9, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 870, "totalSubmissionRaw": 951}, "3065": {"acRate": 85.45442239030746, "difficulty": "Easy", "likes": 75, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50501, "totalSubmissionRaw": 59097}, "3066": {"acRate": 27.244648318042813, "difficulty": "Medium", "likes": 80, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26727, "totalSubmissionRaw": 98100}, "3067": {"acRate": 57.5855523061926, "difficulty": "Medium", "likes": 171, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11224, "totalSubmissionRaw": 19491}, "3068": {"acRate": 67.45334419759872, "difficulty": "Hard", "likes": 603, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68710, "totalSubmissionRaw": 101863}, "3069": {"acRate": 71.94827964058733, "difficulty": "Easy", "likes": 70, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39396, "totalSubmissionRaw": 54756}, "3070": {"acRate": 59.11169956668272, "difficulty": "Medium", "likes": 124, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24555, "totalSubmissionRaw": 41540}, "3071": {"acRate": 62.04902867715079, "difficulty": "Medium", "likes": 82, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16098, "totalSubmissionRaw": 25944}, "3072": {"acRate": 26.703325027923363, "difficulty": "Hard", "likes": 125, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9323, "totalSubmissionRaw": 34916}, "3073": {"acRate": 42.324003392705684, "difficulty": "Medium", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 499, "totalSubmissionRaw": 1179}, "3074": {"acRate": 66.23109744619438, "difficulty": "Easy", "likes": 82, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42221, "totalSubmissionRaw": 63748}, "3075": {"acRate": 55.10518997868912, "difficulty": "Medium", "likes": 629, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169626, "totalSubmissionRaw": 307823}, "3076": {"acRate": 45.119044917043055, "difficulty": "Medium", "likes": 122, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19879, "totalSubmissionRaw": 44059}, "3077": {"acRate": 27.73979292830631, "difficulty": "Hard", "likes": 116, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5680, "totalSubmissionRaw": 20476}, "3078": {"acRate": 68.66791744840526, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 366, "totalSubmissionRaw": 533}, "3079": {"acRate": 73.83111044507717, "difficulty": "Easy", "likes": 82, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39414, "totalSubmissionRaw": 53384}, "3080": {"acRate": 48.83223543502438, "difficulty": "Medium", "likes": 102, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17124, "totalSubmissionRaw": 35067}, "3081": {"acRate": 26.65158961423042, "difficulty": "Medium", "likes": 152, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12256, "totalSubmissionRaw": 45986}, "3082": {"acRate": 38.45600575401583, "difficulty": "Hard", "likes": 124, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6416, "totalSubmissionRaw": 16684}, "3083": {"acRate": 66.38931036170526, "difficulty": "Easy", "likes": 79, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40692, "totalSubmissionRaw": 61293}, "3084": {"acRate": 48.86392829617789, "difficulty": "Medium", "likes": 103, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3084", "paidOnly": false, "title": "Count Substrings Starting and Ending with Given Character", "titleSlug": "count-substrings-starting-and-ending-with-given-character", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34237, "totalSubmissionRaw": 70066}, "3085": {"acRate": 44.22620489222572, "difficulty": "Medium", "likes": 180, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3085", "paidOnly": false, "title": "Minimum Deletions to Make String K-Special", "titleSlug": "minimum-deletions-to-make-string-k-special", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18261, "totalSubmissionRaw": 41290}, "3086": {"acRate": 23.733162283515075, "difficulty": "Hard", "likes": 46, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2590, "totalSubmissionRaw": 10913}, "3087": {"acRate": 64.73526473526474, "difficulty": "Medium", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 648, "totalSubmissionRaw": 1001}, "3088": {"acRate": 54.632587859424916, "difficulty": "Hard", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 342, "totalSubmissionRaw": 626}, "3089": {"acRate": 37.5875486381323, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 483, "totalSubmissionRaw": 1285}, "3090": {"acRate": 63.683452187710884, "difficulty": "Easy", "likes": 145, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34916, "totalSubmissionRaw": 54828}, "3091": {"acRate": 44.72748509885429, "difficulty": "Medium", "likes": 145, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26039, "totalSubmissionRaw": 58217}, "3092": {"acRate": 42.487315634218284, "difficulty": "Medium", "likes": 204, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18004, "totalSubmissionRaw": 42375}, "3093": {"acRate": 41.63156272475085, "difficulty": "Hard", "likes": 112, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8104, "totalSubmissionRaw": 19466}, "3094": {"acRate": 81.86915887850468, "difficulty": "Medium", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3094", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions II", "titleSlug": "guess-the-number-using-bitwise-questions-ii", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 438, "totalSubmissionRaw": 535}, "3095": {"acRate": 40.789409960448786, "difficulty": "Easy", "likes": 76, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25266, "totalSubmissionRaw": 61944}, "3096": {"acRate": 40.813674530187924, "difficulty": "Medium", "likes": 73, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20415, "totalSubmissionRaw": 50020}, "3097": {"acRate": 29.743830671084513, "difficulty": "Medium", "likes": 172, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3097", "paidOnly": false, "title": "Shortest Subarray With OR at Least K II", "titleSlug": "shortest-subarray-with-or-at-least-k-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12029, "totalSubmissionRaw": 40442}, "3098": {"acRate": 24.48747833363218, "difficulty": "Hard", "likes": 115, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4097, "totalSubmissionRaw": 16731}, "3099": {"acRate": 82.86871494178854, "difficulty": "Easy", "likes": 97, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48900, "totalSubmissionRaw": 59009}, "3100": {"acRate": 62.98846137348261, "difficulty": "Medium", "likes": 100, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29369, "totalSubmissionRaw": 46626}, "3101": {"acRate": 57.06598077308962, "difficulty": "Medium", "likes": 191, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31283, "totalSubmissionRaw": 54819}, "3102": {"acRate": 32.1985513421389, "difficulty": "Hard", "likes": 147, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7557, "totalSubmissionRaw": 23470}, "3103": {"acRate": 66.66666666666666, "difficulty": "Hard", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 326, "totalSubmissionRaw": 489}, "3104": {"acRate": 59.0778097982709, "difficulty": "Hard", "likes": 7, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 410, "totalSubmissionRaw": 694}, "3105": {"acRate": 57.258498072285455, "difficulty": "Easy", "likes": 100, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37277, "totalSubmissionRaw": 65103}, "3106": {"acRate": 63.83387966299136, "difficulty": "Medium", "likes": 137, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23563, "totalSubmissionRaw": 36913}, "3107": {"acRate": 48.772285338564686, "difficulty": "Medium", "likes": 120, "dislikes": 173, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22624, "totalSubmissionRaw": 46387}, "3108": {"acRate": 46.25032662660047, "difficulty": "Hard", "likes": 164, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10620, "totalSubmissionRaw": 22962}, "3109": {"acRate": 42.994505494505496, "difficulty": "Medium", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 313, "totalSubmissionRaw": 728}, "3110": {"acRate": 94.44667911698511, "difficulty": "Easy", "likes": 480, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3110", "paidOnly": false, "title": "Score of a String", "titleSlug": "score-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197212, "totalSubmissionRaw": 208808}, "3111": {"acRate": 64.26503784357988, "difficulty": "Medium", "likes": 79, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24199, "totalSubmissionRaw": 37655}, "3112": {"acRate": 34.12869653509328, "difficulty": "Medium", "likes": 126, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16134, "totalSubmissionRaw": 47274}, "3113": {"acRate": 29.42075241070216, "difficulty": "Hard", "likes": 184, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8665, "totalSubmissionRaw": 29452}, "3114": {"acRate": 35.365517874351795, "difficulty": "Easy", "likes": 82, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30826, "totalSubmissionRaw": 87164}, "3115": {"acRate": 58.61459175424414, "difficulty": "Medium", "likes": 88, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34803, "totalSubmissionRaw": 59376}, "3116": {"acRate": 15.815932793861487, "difficulty": "Hard", "likes": 197, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7173, "totalSubmissionRaw": 45353}, "3117": {"acRate": 27.838676318510856, "difficulty": "Hard", "likes": 100, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3117", "paidOnly": false, "title": "Minimum Sum of Values by Dividing Array", "titleSlug": "minimum-sum-of-values-by-dividing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4038, "totalSubmissionRaw": 14505}, "3118": {"acRate": 57.54985754985755, "difficulty": "Medium", "likes": 3, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 404, "totalSubmissionRaw": 702}, "3119": {"acRate": 63.72045220966084, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3119", "paidOnly": true, "title": "Maximum Number of Potholes That Can Be Fixed", "titleSlug": "maximum-number-of-potholes-that-can-be-fixed", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 620, "totalSubmissionRaw": 973}, "3120": {"acRate": 65.39005420692907, "difficulty": "Easy", "likes": 110, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38843, "totalSubmissionRaw": 59402}, "3121": {"acRate": 41.458113030196216, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28228, "totalSubmissionRaw": 68088}, "3122": {"acRate": 41.24481590527749, "difficulty": "Medium", "likes": 195, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13028, "totalSubmissionRaw": 31587}, "3123": {"acRate": 51.07155644212572, "difficulty": "Hard", "likes": 197, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3123", "paidOnly": false, "title": "Find Edges in Shortest Paths", "titleSlug": "find-edges-in-shortest-paths", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9985, "totalSubmissionRaw": 19551}, "3124": {"acRate": 72.64957264957265, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 510, "totalSubmissionRaw": 702}, "3125": {"acRate": 70.13782542113323, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3125", "paidOnly": true, "title": "Maximum Number That Makes Result of Bitwise AND Zero", "titleSlug": "maximum-number-that-makes-result-of-bitwise-and-zero", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 458, "totalSubmissionRaw": 653}, "3126": {"acRate": 47.88990825688074, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3126", "paidOnly": true, "title": "Server Utilization Time", "titleSlug": "server-utilization-time", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 522, "totalSubmissionRaw": 1090}, "3127": {"acRate": 50.72701480627715, "difficulty": "Easy", "likes": 58, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22885, "totalSubmissionRaw": 45114}, "3128": {"acRate": 47.378029941297086, "difficulty": "Medium", "likes": 89, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16868, "totalSubmissionRaw": 35603}, "3129": {"acRate": 27.109471094710948, "difficulty": "Medium", "likes": 96, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3129", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays I", "titleSlug": "find-all-possible-stable-binary-arrays-i", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6612, "totalSubmissionRaw": 24390}, "3130": {"acRate": 29.27600749765698, "difficulty": "Hard", "likes": 52, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2499, "totalSubmissionRaw": 8536}, "3131": {"acRate": 81.89534861490813, "difficulty": "Easy", "likes": 93, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42836, "totalSubmissionRaw": 52306}, "3132": {"acRate": 30.855704159851182, "difficulty": "Medium", "likes": 134, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3132", "paidOnly": false, "title": "Find the Integer Added to Array II", "titleSlug": "find-the-integer-added-to-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19241, "totalSubmissionRaw": 62358}, "3133": {"acRate": 37.813775194757014, "difficulty": "Medium", "likes": 180, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12232, "totalSubmissionRaw": 32348}, "3134": {"acRate": 28.52005363891259, "difficulty": "Hard", "likes": 116, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4679, "totalSubmissionRaw": 16406}, "3135": {"acRate": 58.68983957219251, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 439, "totalSubmissionRaw": 748}, "3136": {"acRate": 36.178608515057114, "difficulty": "Easy", "likes": 80, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33097, "totalSubmissionRaw": 91484}, "3137": {"acRate": 63.42279942279943, "difficulty": "Medium", "likes": 100, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21976, "totalSubmissionRaw": 34650}, "3138": {"acRate": 42.57583996572578, "difficulty": "Medium", "likes": 152, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25838, "totalSubmissionRaw": 60687}, "3139": {"acRate": 15.766078622030838, "difficulty": "Hard", "likes": 105, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3405, "totalSubmissionRaw": 21597}, "3140": {"acRate": 64.23728813559322, "difficulty": "Medium", "likes": 2, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3140", "paidOnly": true, "title": "Consecutive Available Seats II", "titleSlug": "consecutive-available-seats-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 379, "totalSubmissionRaw": 590}, "3141": {"acRate": 74.94145199063233, "difficulty": "Hard", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 320, "totalSubmissionRaw": 427}, "3142": {"acRate": 42.41939988208645, "difficulty": "Easy", "likes": 47, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3142", "paidOnly": false, "title": "Check if Grid Satisfies Conditions", "titleSlug": "check-if-grid-satisfies-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27341, "totalSubmissionRaw": 64454}, "3143": {"acRate": 38.45900392852617, "difficulty": "Medium", "likes": 126, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15174, "totalSubmissionRaw": 39455}, "3144": {"acRate": 40.5458089668616, "difficulty": "Medium", "likes": 100, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11231, "totalSubmissionRaw": 27701}, "3145": {"acRate": 25.42262678803641, "difficulty": "Hard", "likes": 46, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1564, "totalSubmissionRaw": 6152}, "3146": {"acRate": 89.6477897653331, "difficulty": "Easy", "likes": 77, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42704, "totalSubmissionRaw": 47634}, "3147": {"acRate": 39.98479318734793, "difficulty": "Medium", "likes": 128, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26294, "totalSubmissionRaw": 65760}, "3148": {"acRate": 48.446242847659086, "difficulty": "Medium", "likes": 192, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15325, "totalSubmissionRaw": 31633}, "3149": {"acRate": 23.210613598673298, "difficulty": "Hard", "likes": 84, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3499, "totalSubmissionRaw": 15075}, "3150": {"acRate": 91.13924050632912, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 504, "totalSubmissionRaw": 553}, "3151": {"acRate": 75.78428601709885, "difficulty": "Easy", "likes": 60, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3151", "paidOnly": false, "title": "Special Array I", "titleSlug": "special-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42903, "totalSubmissionRaw": 56612}, "3152": {"acRate": 29.1496164380572, "difficulty": "Medium", "likes": 148, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26713, "totalSubmissionRaw": 91641}, "3153": {"acRate": 44.874931129476586, "difficulty": "Medium", "likes": 143, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3153", "paidOnly": false, "title": "Sum of Digit Differences of All Pairs", "titleSlug": "sum-of-digit-differences-of-all-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20362, "totalSubmissionRaw": 45375}, "3154": {"acRate": 36.1482169822279, "difficulty": "Hard", "likes": 109, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9336, "totalSubmissionRaw": 25827}, "3155": {"acRate": 55.61426684280053, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3155", "paidOnly": true, "title": "Maximum Number of Upgradable Servers", "titleSlug": "maximum-number-of-upgradable-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 421, "totalSubmissionRaw": 757}, "3156": {"acRate": 64.39169139465875, "difficulty": "Hard", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 217, "totalSubmissionRaw": 337}, "3157": {"acRate": 73.01349325337331, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 487, "totalSubmissionRaw": 667}, "3158": {"acRate": 83.27507864383082, "difficulty": "Easy", "likes": 57, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3158", "paidOnly": false, "title": "Find the XOR of Numbers Which Appear Twice", "titleSlug": "find-the-xor-of-numbers-which-appear-twice", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33354, "totalSubmissionRaw": 40053}, "3159": {"acRate": 74.46275818902566, "difficulty": "Medium", "likes": 73, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28552, "totalSubmissionRaw": 38344}, "3160": {"acRate": 40.6366267052501, "difficulty": "Medium", "likes": 85, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20643, "totalSubmissionRaw": 50799}, "3161": {"acRate": 12.00482606072793, "difficulty": "Hard", "likes": 68, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2985, "totalSubmissionRaw": 24865}, "3162": {"acRate": 86.48676982429656, "difficulty": "Easy", "likes": 65, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41249, "totalSubmissionRaw": 47694}, "3163": {"acRate": 55.7187983284525, "difficulty": "Medium", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3163", "paidOnly": false, "title": "String Compression III", "titleSlug": "string-compression-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33867, "totalSubmissionRaw": 60782}, "3164": {"acRate": 24.700066388467377, "difficulty": "Medium", "likes": 171, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20832, "totalSubmissionRaw": 84349}, "3165": {"acRate": 16.923532898636633, "difficulty": "Hard", "likes": 76, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4568, "totalSubmissionRaw": 26991}, "3166": {"acRate": 65.72237960339945, "difficulty": "Medium", "likes": 2, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 232, "totalSubmissionRaw": 353}, "3167": {"acRate": 85.34322820037106, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3167", "paidOnly": true, "title": "Better Compression of String", "titleSlug": "better-compression-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 460, "totalSubmissionRaw": 539}, "3168": {"acRate": 80.25182380840972, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37726, "totalSubmissionRaw": 47011}, "3169": {"acRate": 32.32868479337555, "difficulty": "Medium", "likes": 137, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29046, "totalSubmissionRaw": 89847}, "3170": {"acRate": 32.83989092325672, "difficulty": "Medium", "likes": 144, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3170", "paidOnly": false, "title": "Lexicographically Minimum String After Removing Stars", "titleSlug": "lexicographically-minimum-string-after-removing-stars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18540, "totalSubmissionRaw": 56455}, "3171": {"acRate": 29.740746180963573, "difficulty": "Hard", "likes": 114, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise AND Closest to K", "titleSlug": "find-subarray-with-bitwise-and-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8099, "totalSubmissionRaw": 27232}, "3172": {"acRate": 85.11904761904762, "difficulty": "Easy", "likes": 2, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143, "totalSubmissionRaw": 168}}
\ No newline at end of file
+{"1": {"acRate": 52.75889089696538, "difficulty": "Easy", "likes": 56485, "dislikes": 1962, "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": 13364015, "totalSubmissionRaw": 25330397}, "2": {"acRate": 43.06431258949887, "difficulty": "Medium", "likes": 30787, "dislikes": 6118, "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": 4619534, "totalSubmissionRaw": 10727070}, "3": {"acRate": 34.88713093470747, "difficulty": "Medium", "likes": 39389, "dislikes": 1865, "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": 5842977, "totalSubmissionRaw": 16748233}, "4": {"acRate": 40.272039216742535, "difficulty": "Hard", "likes": 28056, "dislikes": 3118, "categoryTitle": "Algorithms", "frontendQuestionId": "4", "paidOnly": false, "title": "Median of Two Sorted Arrays", "titleSlug": "median-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2616561, "totalSubmissionRaw": 6497210}, "5": {"acRate": 33.95480595299762, "difficulty": "Medium", "likes": 29066, "dislikes": 1764, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3090670, "totalSubmissionRaw": 9102305}, "6": {"acRate": 48.221761013148736, "difficulty": "Medium", "likes": 7549, "dislikes": 14522, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1352937, "totalSubmissionRaw": 2805659}, "7": {"acRate": 28.702942822985968, "difficulty": "Medium", "likes": 12872, "dislikes": 13480, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3250136, "totalSubmissionRaw": 11323355}, "8": {"acRate": 17.36431530220829, "difficulty": "Medium", "likes": 4421, "dislikes": 13546, "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": 1552639, "totalSubmissionRaw": 8941590}, "9": {"acRate": 56.58609622470653, "difficulty": "Easy", "likes": 12482, "dislikes": 2715, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4693477, "totalSubmissionRaw": 8294427}, "10": {"acRate": 28.193693819831424, "difficulty": "Hard", "likes": 12052, "dislikes": 2145, "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": 966552, "totalSubmissionRaw": 3428256}, "11": {"acRate": 55.4188867192588, "difficulty": "Medium", "likes": 28794, "dislikes": 1737, "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": 2999590, "totalSubmissionRaw": 5412578}, "12": {"acRate": 65.02332778330167, "difficulty": "Medium", "likes": 7020, "dislikes": 5532, "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": 1326217, "totalSubmissionRaw": 2039609}, "13": {"acRate": 61.47604671003448, "difficulty": "Easy", "likes": 13986, "dislikes": 912, "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": 3680710, "totalSubmissionRaw": 5987228}, "14": {"acRate": 42.966460859287196, "difficulty": "Easy", "likes": 17356, "dislikes": 4515, "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": 3374137, "totalSubmissionRaw": 7852953}, "15": {"acRate": 34.655971677786454, "difficulty": "Medium", "likes": 30545, "dislikes": 2840, "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": 3582781, "totalSubmissionRaw": 10338156}, "16": {"acRate": 45.84999151586236, "difficulty": "Medium", "likes": 10369, "dislikes": 562, "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": 1232157, "totalSubmissionRaw": 2687360}, "17": {"acRate": 60.67265647829662, "difficulty": "Medium", "likes": 18365, "dislikes": 987, "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": 2047196, "totalSubmissionRaw": 3374169}, "18": {"acRate": 36.328383760560016, "difficulty": "Medium", "likes": 11192, "dislikes": 1372, "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": 968497, "totalSubmissionRaw": 2665950}, "19": {"acRate": 45.576804746357844, "difficulty": "Medium", "likes": 18676, "dislikes": 789, "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": 2750213, "totalSubmissionRaw": 6034252}, "20": {"acRate": 40.63207627850801, "difficulty": "Easy", "likes": 23823, "dislikes": 1735, "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": 4656054, "totalSubmissionRaw": 11459058}, "21": {"acRate": 64.45434190664754, "difficulty": "Easy", "likes": 21589, "dislikes": 2101, "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": 4208878, "totalSubmissionRaw": 6530023}, "22": {"acRate": 74.72722141397438, "difficulty": "Medium", "likes": 20904, "dislikes": 922, "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": 1845521, "totalSubmissionRaw": 2469677}, "23": {"acRate": 53.05428540093181, "difficulty": "Hard", "likes": 19271, "dislikes": 705, "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": 2012373, "totalSubmissionRaw": 3793053}, "24": {"acRate": 64.54363395038857, "difficulty": "Medium", "likes": 11870, "dislikes": 441, "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": 1376178, "totalSubmissionRaw": 2132168}, "25": {"acRate": 59.00359875884037, "difficulty": "Hard", "likes": 13508, "dislikes": 689, "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": 937661, "totalSubmissionRaw": 1589159}, "26": {"acRate": 56.058776765822074, "difficulty": "Easy", "likes": 14342, "dislikes": 18501, "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": 4412874, "totalSubmissionRaw": 7871870}, "27": {"acRate": 57.0598164774814, "difficulty": "Easy", "likes": 2388, "dislikes": 3468, "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": 2955015, "totalSubmissionRaw": 5178819}, "28": {"acRate": 42.541937908462714, "difficulty": "Easy", "likes": 5702, "dislikes": 396, "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": 2492648, "totalSubmissionRaw": 5859287}, "29": {"acRate": 17.52830357265752, "difficulty": "Medium", "likes": 5073, "dislikes": 14777, "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": 751344, "totalSubmissionRaw": 4286470}, "30": {"acRate": 32.71619091428551, "difficulty": "Hard", "likes": 1794, "dislikes": 234, "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": 455181, "totalSubmissionRaw": 1391299}, "31": {"acRate": 40.135553553978745, "difficulty": "Medium", "likes": 18159, "dislikes": 4642, "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": 1364424, "totalSubmissionRaw": 3399541}, "32": {"acRate": 34.29479723610351, "difficulty": "Hard", "likes": 12250, "dislikes": 402, "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": 745976, "totalSubmissionRaw": 2175189}, "33": {"acRate": 40.87728793820622, "difficulty": "Medium", "likes": 25962, "dislikes": 1560, "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": 2768705, "totalSubmissionRaw": 6773219}, "34": {"acRate": 44.45075645612356, "difficulty": "Medium", "likes": 20312, "dislikes": 509, "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": 2060248, "totalSubmissionRaw": 4634901}, "35": {"acRate": 46.15626205780776, "difficulty": "Easy", "likes": 15959, "dislikes": 730, "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": 2912789, "totalSubmissionRaw": 6310725}, "36": {"acRate": 59.83621204140481, "difficulty": "Medium", "likes": 10563, "dislikes": 1121, "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": 1536991, "totalSubmissionRaw": 2568672}, "37": {"acRate": 61.46077228973873, "difficulty": "Hard", "likes": 9410, "dislikes": 258, "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": 595337, "totalSubmissionRaw": 968648}, "38": {"acRate": 55.337814351773176, "difficulty": "Medium", "likes": 3941, "dislikes": 8244, "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": 934512, "totalSubmissionRaw": 1688745}, "39": {"acRate": 71.69460958341038, "difficulty": "Medium", "likes": 18616, "dislikes": 409, "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": 1957866, "totalSubmissionRaw": 2730847}, "40": {"acRate": 54.664814383478074, "difficulty": "Medium", "likes": 10363, "dislikes": 292, "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": 985701, "totalSubmissionRaw": 1803176}, "41": {"acRate": 39.59154736356994, "difficulty": "Hard", "likes": 16696, "dislikes": 1841, "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": 1220761, "totalSubmissionRaw": 3083391}, "42": {"acRate": 62.167830680368894, "difficulty": "Hard", "likes": 31757, "dislikes": 506, "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": 2133556, "totalSubmissionRaw": 3431933}, "43": {"acRate": 40.543825601381506, "difficulty": "Medium", "likes": 7003, "dislikes": 3316, "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": 803887, "totalSubmissionRaw": 1982764}, "44": {"acRate": 28.09070199356763, "difficulty": "Hard", "likes": 8161, "dislikes": 345, "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": 576717, "totalSubmissionRaw": 2053053}, "45": {"acRate": 40.49948908574509, "difficulty": "Medium", "likes": 14379, "dislikes": 565, "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": 1258384, "totalSubmissionRaw": 3107169}, "46": {"acRate": 78.51552986850899, "difficulty": "Medium", "likes": 18887, "dislikes": 324, "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": 2092353, "totalSubmissionRaw": 2664892}, "47": {"acRate": 59.40686067450701, "difficulty": "Medium", "likes": 8465, "dislikes": 143, "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": 935253, "totalSubmissionRaw": 1574322}, "48": {"acRate": 74.62466234502834, "difficulty": "Medium", "likes": 17365, "dislikes": 799, "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": 1728824, "totalSubmissionRaw": 2316697}, "49": {"acRate": 68.71142295025614, "difficulty": "Medium", "likes": 19042, "dislikes": 614, "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": 2910260, "totalSubmissionRaw": 4235489}, "50": {"acRate": 34.93742580464446, "difficulty": "Medium", "likes": 9592, "dislikes": 9410, "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": 1676342, "totalSubmissionRaw": 4798124}, "51": {"acRate": 68.55733396523125, "difficulty": "Hard", "likes": 12223, "dislikes": 284, "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": 731973, "totalSubmissionRaw": 1067681}, "52": {"acRate": 74.16344873691128, "difficulty": "Hard", "likes": 3818, "dislikes": 261, "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": 391606, "totalSubmissionRaw": 528030}, "53": {"acRate": 50.84591386649044, "difficulty": "Medium", "likes": 33755, "dislikes": 1427, "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": 3925557, "totalSubmissionRaw": 7720491}, "54": {"acRate": 49.795570444325946, "difficulty": "Medium", "likes": 14595, "dislikes": 1284, "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": 1435306, "totalSubmissionRaw": 2882400}, "55": {"acRate": 38.534037157579874, "difficulty": "Medium", "likes": 19114, "dislikes": 1214, "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": 1924761, "totalSubmissionRaw": 4994979}, "56": {"acRate": 47.46911509948772, "difficulty": "Medium", "likes": 22005, "dislikes": 766, "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": 2415989, "totalSubmissionRaw": 5089604}, "57": {"acRate": 41.62565309503772, "difficulty": "Medium", "likes": 10254, "dislikes": 792, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1123256, "totalSubmissionRaw": 2698474}, "58": {"acRate": 52.0832297184161, "difficulty": "Easy", "likes": 5129, "dislikes": 279, "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": 2010644, "totalSubmissionRaw": 3860446}, "59": {"acRate": 71.27389289176449, "difficulty": "Medium", "likes": 6306, "dislikes": 260, "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": 577891, "totalSubmissionRaw": 810801}, "60": {"acRate": 47.222587388155596, "difficulty": "Hard", "likes": 6600, "dislikes": 478, "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": 398730, "totalSubmissionRaw": 844363}, "61": {"acRate": 37.923355547530726, "difficulty": "Medium", "likes": 9558, "dislikes": 1441, "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": 970354, "totalSubmissionRaw": 2558720}, "62": {"acRate": 64.3875313885315, "difficulty": "Medium", "likes": 16485, "dislikes": 439, "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": 1842579, "totalSubmissionRaw": 2861704}, "63": {"acRate": 41.69359249498493, "difficulty": "Medium", "likes": 8664, "dislikes": 508, "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": 940679, "totalSubmissionRaw": 2256171}, "64": {"acRate": 64.07679857882562, "difficulty": "Medium", "likes": 12341, "dislikes": 168, "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": 1180199, "totalSubmissionRaw": 1841853}, "65": {"acRate": 19.960184051175204, "difficulty": "Hard", "likes": 1244, "dislikes": 1983, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 368163, "totalSubmissionRaw": 1844487}, "66": {"acRate": 45.448998578638076, "difficulty": "Easy", "likes": 9222, "dislikes": 5370, "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": 2269616, "totalSubmissionRaw": 4993776}, "67": {"acRate": 53.71222791863644, "difficulty": "Easy", "likes": 9341, "dislikes": 965, "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": 1476915, "totalSubmissionRaw": 2749680}, "68": {"acRate": 43.77094355802172, "difficulty": "Hard", "likes": 3635, "dislikes": 4631, "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": 420600, "totalSubmissionRaw": 960914}, "69": {"acRate": 38.88424989184397, "difficulty": "Easy", "likes": 8067, "dislikes": 4489, "categoryTitle": "Algorithms", "frontendQuestionId": "69", "paidOnly": false, "title": "Sqrt(x)", "titleSlug": "sqrtx", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1980944, "totalSubmissionRaw": 5094464}, "70": {"acRate": 52.92747278506772, "difficulty": "Easy", "likes": 21750, "dislikes": 821, "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": 3287472, "totalSubmissionRaw": 6211274}, "71": {"acRate": 42.81524681754756, "difficulty": "Medium", "likes": 5507, "dislikes": 1271, "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": 768937, "totalSubmissionRaw": 1795942}, "72": {"acRate": 56.606772831051714, "difficulty": "Medium", "likes": 14660, "dislikes": 220, "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": 869253, "totalSubmissionRaw": 1535599}, "73": {"acRate": 55.98814841748383, "difficulty": "Medium", "likes": 14280, "dislikes": 719, "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": 1428938, "totalSubmissionRaw": 2552219}, "74": {"acRate": 50.269752156647954, "difficulty": "Medium", "likes": 15575, "dislikes": 412, "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": 1798870, "totalSubmissionRaw": 3578433}, "75": {"acRate": 62.59418163258796, "difficulty": "Medium", "likes": 17916, "dislikes": 631, "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": 1962257, "totalSubmissionRaw": 3134884}, "76": {"acRate": 43.13203969041501, "difficulty": "Hard", "likes": 17727, "dislikes": 727, "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": 1369636, "totalSubmissionRaw": 3175456}, "77": {"acRate": 70.5762169477216, "difficulty": "Medium", "likes": 8169, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 909527, "totalSubmissionRaw": 1288716}, "78": {"acRate": 78.39831288203114, "difficulty": "Medium", "likes": 17102, "dislikes": 277, "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": 1969147, "totalSubmissionRaw": 2511725}, "79": {"acRate": 42.93962520528588, "difficulty": "Medium", "likes": 15729, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1691922, "totalSubmissionRaw": 3940233}, "80": {"acRate": 58.65680584003694, "difficulty": "Medium", "likes": 6781, "dislikes": 1310, "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": 981969, "totalSubmissionRaw": 1674091}, "81": {"acRate": 37.76945953202123, "difficulty": "Medium", "likes": 8376, "dislikes": 1036, "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": 731532, "totalSubmissionRaw": 1936838}, "82": {"acRate": 47.63085418898355, "difficulty": "Medium", "likes": 8741, "dislikes": 237, "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": 742113, "totalSubmissionRaw": 1558051}, "83": {"acRate": 52.68561096761102, "difficulty": "Easy", "likes": 8608, "dislikes": 298, "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": 1534467, "totalSubmissionRaw": 2912492}, "84": {"acRate": 44.629285539327874, "difficulty": "Hard", "likes": 17024, "dislikes": 275, "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": 901903, "totalSubmissionRaw": 2020866}, "85": {"acRate": 50.632041584869505, "difficulty": "Hard", "likes": 10446, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "85", "paidOnly": false, "title": "Maximal Rectangle", "titleSlug": "maximal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 489251, "totalSubmissionRaw": 966298}, "86": {"acRate": 56.44886243607411, "difficulty": "Medium", "likes": 7288, "dislikes": 868, "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": 627948, "totalSubmissionRaw": 1112420}, "87": {"acRate": 40.242944995532426, "difficulty": "Hard", "likes": 3291, "dislikes": 1270, "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": 230149, "totalSubmissionRaw": 571899}, "88": {"acRate": 49.878883893660834, "difficulty": "Easy", "likes": 14615, "dislikes": 1883, "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": 3201953, "totalSubmissionRaw": 6419458}, "89": {"acRate": 59.397919221488195, "difficulty": "Medium", "likes": 2232, "dislikes": 2708, "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": 300301, "totalSubmissionRaw": 505577}, "90": {"acRate": 57.43847816069548, "difficulty": "Medium", "likes": 9641, "dislikes": 304, "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": 931130, "totalSubmissionRaw": 1621091}, "91": {"acRate": 35.00166753815552, "difficulty": "Medium", "likes": 11793, "dislikes": 4505, "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": 1260445, "totalSubmissionRaw": 3601104}, "92": {"acRate": 47.78976291093806, "difficulty": "Medium", "likes": 11484, "dislikes": 605, "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": 873818, "totalSubmissionRaw": 1828462}, "93": {"acRate": 50.175974103564016, "difficulty": "Medium", "likes": 5185, "dislikes": 789, "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": 461915, "totalSubmissionRaw": 920590}, "94": {"acRate": 76.29157513061007, "difficulty": "Easy", "likes": 13353, "dislikes": 776, "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": 2548645, "totalSubmissionRaw": 3340665}, "95": {"acRate": 57.93474292163175, "difficulty": "Medium", "likes": 7515, "dislikes": 517, "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": 453804, "totalSubmissionRaw": 783302}, "96": {"acRate": 61.1234256694793, "difficulty": "Medium", "likes": 10273, "dislikes": 399, "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": 663180, "totalSubmissionRaw": 1084985}, "97": {"acRate": 40.09334444939338, "difficulty": "Medium", "likes": 8143, "dislikes": 477, "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": 526592, "totalSubmissionRaw": 1313415}, "98": {"acRate": 33.02260711448812, "difficulty": "Medium", "likes": 16675, "dislikes": 1363, "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": 2358003, "totalSubmissionRaw": 7140579}, "99": {"acRate": 53.32063349768414, "difficulty": "Medium", "likes": 7833, "dislikes": 256, "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": 456797, "totalSubmissionRaw": 856701}, "100": {"acRate": 62.33800108849212, "difficulty": "Easy", "likes": 11430, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2181980, "totalSubmissionRaw": 3500245}, "101": {"acRate": 56.69381188894659, "difficulty": "Easy", "likes": 15167, "dislikes": 370, "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": 2007709, "totalSubmissionRaw": 3541321}, "102": {"acRate": 67.45429492980375, "difficulty": "Medium", "likes": 15167, "dislikes": 310, "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": 2256331, "totalSubmissionRaw": 3344976}, "103": {"acRate": 59.12103116260268, "difficulty": "Medium", "likes": 10703, "dislikes": 294, "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": 1180209, "totalSubmissionRaw": 1996260}, "104": {"acRate": 75.49314036282358, "difficulty": "Easy", "likes": 12706, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "104", "paidOnly": false, "title": "Maximum Depth of Binary Tree", "titleSlug": "maximum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3120860, "totalSubmissionRaw": 4133965}, "105": {"acRate": 64.12101802513791, "difficulty": "Medium", "likes": 14817, "dislikes": 498, "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": 1240534, "totalSubmissionRaw": 1934679}, "106": {"acRate": 63.11173205659294, "difficulty": "Medium", "likes": 7946, "dislikes": 130, "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": 645508, "totalSubmissionRaw": 1022806}, "107": {"acRate": 63.58896140402337, "difficulty": "Medium", "likes": 4831, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "107", "paidOnly": false, "title": "Binary Tree Level Order Traversal II", "titleSlug": "binary-tree-level-order-traversal-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 650372, "totalSubmissionRaw": 1022775}, "108": {"acRate": 71.85515422032219, "difficulty": "Easy", "likes": 10863, "dislikes": 554, "categoryTitle": "Algorithms", "frontendQuestionId": "108", "paidOnly": false, "title": "Convert Sorted Array to Binary Search Tree", "titleSlug": "convert-sorted-array-to-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1212359, "totalSubmissionRaw": 1687226}, "109": {"acRate": 62.087056450667234, "difficulty": "Medium", "likes": 7397, "dislikes": 160, "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": 529466, "totalSubmissionRaw": 852780}, "110": {"acRate": 52.30157101823084, "difficulty": "Easy", "likes": 10585, "dislikes": 679, "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": 1498910, "totalSubmissionRaw": 2865902}, "111": {"acRate": 48.208348490034034, "difficulty": "Easy", "likes": 7247, "dislikes": 1306, "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": 1209976, "totalSubmissionRaw": 2509889}, "112": {"acRate": 50.58329504219034, "difficulty": "Easy", "likes": 9615, "dislikes": 1097, "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": 1467418, "totalSubmissionRaw": 2901003}, "113": {"acRate": 58.6106698878606, "difficulty": "Medium", "likes": 7894, "dislikes": 154, "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": 862700, "totalSubmissionRaw": 1471917}, "114": {"acRate": 65.18051609485819, "difficulty": "Medium", "likes": 12118, "dislikes": 560, "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": 957344, "totalSubmissionRaw": 1468759}, "115": {"acRate": 47.193993282886595, "difficulty": "Hard", "likes": 6563, "dislikes": 288, "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": 402585, "totalSubmissionRaw": 853042}, "116": {"acRate": 62.90378730637892, "difficulty": "Medium", "likes": 9627, "dislikes": 301, "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": 1049809, "totalSubmissionRaw": 1668914}, "117": {"acRate": 52.725314379623654, "difficulty": "Medium", "likes": 5807, "dislikes": 321, "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": 635881, "totalSubmissionRaw": 1206026}, "118": {"acRate": 74.49236971479533, "difficulty": "Easy", "likes": 12727, "dislikes": 439, "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": 1682214, "totalSubmissionRaw": 2258235}, "119": {"acRate": 64.14152771050993, "difficulty": "Easy", "likes": 4796, "dislikes": 338, "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": 889954, "totalSubmissionRaw": 1387485}, "120": {"acRate": 56.7935681877844, "difficulty": "Medium", "likes": 9436, "dislikes": 552, "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": 763696, "totalSubmissionRaw": 1344689}, "121": {"acRate": 53.73895380336271, "difficulty": "Easy", "likes": 30579, "dislikes": 1129, "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": 4706462, "totalSubmissionRaw": 8758022}, "122": {"acRate": 66.68805923498094, "difficulty": "Medium", "likes": 13406, "dislikes": 2687, "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": 1922363, "totalSubmissionRaw": 2882620}, "123": {"acRate": 48.172661120032366, "difficulty": "Hard", "likes": 9564, "dislikes": 187, "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": 609570, "totalSubmissionRaw": 1265389}, "124": {"acRate": 40.10131517122949, "difficulty": "Hard", "likes": 16472, "dislikes": 728, "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": 1240936, "totalSubmissionRaw": 3094501}, "125": {"acRate": 47.71585348113969, "difficulty": "Easy", "likes": 9213, "dislikes": 8330, "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": 3027626, "totalSubmissionRaw": 6345123}, "126": {"acRate": 27.261093700069917, "difficulty": "Hard", "likes": 5956, "dislikes": 743, "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": 367687, "totalSubmissionRaw": 1348760}, "127": {"acRate": 39.415679596950795, "difficulty": "Hard", "likes": 11938, "dislikes": 1874, "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": 1077753, "totalSubmissionRaw": 2734337}, "128": {"acRate": 47.27834155768206, "difficulty": "Medium", "likes": 19716, "dislikes": 994, "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": 1792271, "totalSubmissionRaw": 3790893}, "129": {"acRate": 66.02168004377288, "difficulty": "Medium", "likes": 7983, "dislikes": 140, "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": 889272, "totalSubmissionRaw": 1346941}, "130": {"acRate": 39.690150003563026, "difficulty": "Medium", "likes": 8531, "dislikes": 1806, "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": 712921, "totalSubmissionRaw": 1796218}, "131": {"acRate": 69.36601486767306, "difficulty": "Medium", "likes": 12755, "dislikes": 487, "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": 896251, "totalSubmissionRaw": 1292062}, "132": {"acRate": 34.03706146087883, "difficulty": "Hard", "likes": 5404, "dislikes": 139, "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": 282333, "totalSubmissionRaw": 829487}, "133": {"acRate": 57.69397096221547, "difficulty": "Medium", "likes": 9399, "dislikes": 3781, "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": 1251399, "totalSubmissionRaw": 2169031}, "134": {"acRate": 45.509842072635536, "difficulty": "Medium", "likes": 11814, "dislikes": 1123, "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": 815597, "totalSubmissionRaw": 1792132}, "135": {"acRate": 43.36742984418573, "difficulty": "Hard", "likes": 7710, "dislikes": 651, "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": 528425, "totalSubmissionRaw": 1218483}, "136": {"acRate": 73.15284005882154, "difficulty": "Easy", "likes": 16343, "dislikes": 710, "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": 2820573, "totalSubmissionRaw": 3855727}, "137": {"acRate": 62.94967107870334, "difficulty": "Medium", "likes": 7849, "dislikes": 687, "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": 595672, "totalSubmissionRaw": 946270}, "138": {"acRate": 56.438337677009265, "difficulty": "Medium", "likes": 13711, "dislikes": 1457, "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": 1262937, "totalSubmissionRaw": 2237731}, "139": {"acRate": 46.872003699121514, "difficulty": "Medium", "likes": 17037, "dislikes": 776, "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": 1693867, "totalSubmissionRaw": 3613819}, "140": {"acRate": 50.93995556152598, "difficulty": "Hard", "likes": 7161, "dislikes": 537, "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": 659809, "totalSubmissionRaw": 1295271}, "141": {"acRate": 50.5416298676855, "difficulty": "Easy", "likes": 15354, "dislikes": 1347, "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": 2998127, "totalSubmissionRaw": 5931996}, "142": {"acRate": 51.532996263992246, "difficulty": "Medium", "likes": 13463, "dislikes": 944, "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": 1303908, "totalSubmissionRaw": 2530238}, "143": {"acRate": 58.978033886114076, "difficulty": "Medium", "likes": 10994, "dislikes": 397, "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": 997079, "totalSubmissionRaw": 1690596}, "144": {"acRate": 69.75003523315351, "difficulty": "Easy", "likes": 7916, "dislikes": 210, "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": 1628273, "totalSubmissionRaw": 2334443}, "145": {"acRate": 71.21245794509633, "difficulty": "Easy", "likes": 6838, "dislikes": 189, "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": 1204789, "totalSubmissionRaw": 1691827}, "146": {"acRate": 42.61519591268036, "difficulty": "Medium", "likes": 20511, "dislikes": 1007, "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": 1650996, "totalSubmissionRaw": 3874209}, "147": {"acRate": 53.805127879965184, "difficulty": "Medium", "likes": 3083, "dislikes": 864, "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": 373369, "totalSubmissionRaw": 693930}, "148": {"acRate": 58.20889103045881, "difficulty": "Medium", "likes": 11455, "dislikes": 344, "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": 798500, "totalSubmissionRaw": 1371784}, "149": {"acRate": 26.897993476259625, "difficulty": "Hard", "likes": 4138, "dislikes": 486, "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": 394745, "totalSubmissionRaw": 1467562}, "150": {"acRate": 51.68725131493145, "difficulty": "Medium", "likes": 7572, "dislikes": 1070, "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": 1058945, "totalSubmissionRaw": 2048762}, "151": {"acRate": 43.12205409124796, "difficulty": "Medium", "likes": 8277, "dislikes": 5131, "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": 1546674, "totalSubmissionRaw": 3586745}, "152": {"acRate": 35.04534987995419, "difficulty": "Medium", "likes": 18319, "dislikes": 617, "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": 1283770, "totalSubmissionRaw": 3663173}, "153": {"acRate": 50.537678332249584, "difficulty": "Medium", "likes": 13044, "dislikes": 577, "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": 1818636, "totalSubmissionRaw": 3598572}, "154": {"acRate": 43.679997525415246, "difficulty": "Hard", "likes": 4640, "dislikes": 488, "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": 451877, "totalSubmissionRaw": 1034517}, "155": {"acRate": 54.343776122793464, "difficulty": "Medium", "likes": 13947, "dislikes": 868, "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": 1688940, "totalSubmissionRaw": 3107889}, "156": {"acRate": 62.86341634427913, "difficulty": "Medium", "likes": 260, "dislikes": 348, "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": 102209, "totalSubmissionRaw": 162589}, "157": {"acRate": 41.574941642690405, "difficulty": "Easy", "likes": 571, "dislikes": 3488, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191463, "totalSubmissionRaw": 460525}, "158": {"acRate": 42.32838925047336, "difficulty": "Hard", "likes": 866, "dislikes": 1800, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 183985, "totalSubmissionRaw": 434661}, "159": {"acRate": 55.45885385049576, "difficulty": "Medium", "likes": 2207, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 260369, "totalSubmissionRaw": 469483}, "160": {"acRate": 57.73240299225688, "difficulty": "Easy", "likes": 14837, "dislikes": 1341, "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": 1583645, "totalSubmissionRaw": 2743077}, "161": {"acRate": 34.30425866565791, "difficulty": "Medium", "likes": 1390, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206760, "totalSubmissionRaw": 602724}, "162": {"acRate": 45.99791771153519, "difficulty": "Medium", "likes": 11785, "dislikes": 4652, "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": 1389464, "totalSubmissionRaw": 3020712}, "163": {"acRate": 33.84816157258647, "difficulty": "Easy", "likes": 1090, "dislikes": 2977, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243546, "totalSubmissionRaw": 719526}, "164": {"acRate": 46.20264522922509, "difficulty": "Medium", "likes": 3244, "dislikes": 397, "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": 213684, "totalSubmissionRaw": 462493}, "165": {"acRate": 40.790911203610506, "difficulty": "Medium", "likes": 2606, "dislikes": 2719, "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": 493218, "totalSubmissionRaw": 1209137}, "166": {"acRate": 25.114005189997656, "difficulty": "Medium", "likes": 2066, "dislikes": 3666, "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": 228494, "totalSubmissionRaw": 909827}, "167": {"acRate": 61.45333648256075, "difficulty": "Medium", "likes": 11611, "dislikes": 1406, "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": 2050236, "totalSubmissionRaw": 3336244}, "168": {"acRate": 40.81498505984164, "difficulty": "Easy", "likes": 5524, "dislikes": 806, "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": 529029, "totalSubmissionRaw": 1296167}, "169": {"acRate": 64.89812246330747, "difficulty": "Easy", "likes": 18938, "dislikes": 612, "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": 2913659, "totalSubmissionRaw": 4489590}, "170": {"acRate": 38.08518524882724, "difficulty": "Easy", "likes": 667, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155148, "totalSubmissionRaw": 407371}, "171": {"acRate": 63.899281347602766, "difficulty": "Easy", "likes": 4734, "dislikes": 365, "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": 690695, "totalSubmissionRaw": 1080912}, "172": {"acRate": 43.42900201001758, "difficulty": "Medium", "likes": 3159, "dislikes": 1950, "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": 454163, "totalSubmissionRaw": 1045755}, "173": {"acRate": 72.22856246946351, "difficulty": "Medium", "likes": 8468, "dislikes": 498, "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": 792376, "totalSubmissionRaw": 1097041}, "174": {"acRate": 38.19078431074725, "difficulty": "Hard", "likes": 5763, "dislikes": 106, "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": 226293, "totalSubmissionRaw": 592533}, "175": {"acRate": 76.10951092144921, "difficulty": "Easy", "likes": 3478, "dislikes": 226, "categoryTitle": "Database", "frontendQuestionId": "175", "paidOnly": false, "title": "Combine Two Tables", "titleSlug": "combine-two-tables", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1024451, "totalSubmissionRaw": 1346023}, "176": {"acRate": 40.615548793382885, "difficulty": "Medium", "likes": 3539, "dislikes": 954, "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": 873848, "totalSubmissionRaw": 2151511}, "177": {"acRate": 37.94181755606967, "difficulty": "Medium", "likes": 1950, "dislikes": 1022, "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": 396879, "totalSubmissionRaw": 1046018}, "178": {"acRate": 62.53611786582749, "difficulty": "Medium", "likes": 2141, "dislikes": 273, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393471, "totalSubmissionRaw": 629190}, "179": {"acRate": 36.324424795934455, "difficulty": "Medium", "likes": 7980, "dislikes": 661, "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": 479185, "totalSubmissionRaw": 1319182}, "180": {"acRate": 45.834700397952005, "difficulty": "Medium", "likes": 2063, "dislikes": 290, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 378577, "totalSubmissionRaw": 825959}, "181": {"acRate": 69.65289121026456, "difficulty": "Easy", "likes": 2570, "dislikes": 252, "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": 647305, "totalSubmissionRaw": 929330}, "182": {"acRate": 71.16263890198688, "difficulty": "Easy", "likes": 2060, "dislikes": 68, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 671588, "totalSubmissionRaw": 943738}, "183": {"acRate": 69.23218464878065, "difficulty": "Easy", "likes": 2612, "dislikes": 135, "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": 816464, "totalSubmissionRaw": 1179305}, "184": {"acRate": 51.906197878444196, "difficulty": "Medium", "likes": 2031, "dislikes": 185, "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": 389011, "totalSubmissionRaw": 749450}, "185": {"acRate": 53.610277219597556, "difficulty": "Hard", "likes": 2043, "dislikes": 239, "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": 330548, "totalSubmissionRaw": 616581}, "186": {"acRate": 54.70802267431469, "difficulty": "Medium", "likes": 1069, "dislikes": 143, "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": 162235, "totalSubmissionRaw": 296547}, "187": {"acRate": 49.05882413530272, "difficulty": "Medium", "likes": 3307, "dislikes": 531, "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": 381034, "totalSubmissionRaw": 776688}, "188": {"acRate": 43.06473451679855, "difficulty": "Hard", "likes": 7364, "dislikes": 209, "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": 459588, "totalSubmissionRaw": 1067204}, "189": {"acRate": 40.733854055714666, "difficulty": "Medium", "likes": 17712, "dislikes": 1950, "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": 2197038, "totalSubmissionRaw": 5393639}, "190": {"acRate": 58.89708392488502, "difficulty": "Easy", "likes": 5060, "dislikes": 1412, "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": 803976, "totalSubmissionRaw": 1365053}, "191": {"acRate": 71.30021240729712, "difficulty": "Easy", "likes": 6476, "dislikes": 1336, "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": 1483356, "totalSubmissionRaw": 2080437}, "192": {"acRate": 25.807666239927705, "difficulty": "Medium", "likes": 540, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51405, "totalSubmissionRaw": 199185}, "193": {"acRate": 26.071801047900472, "difficulty": "Easy", "likes": 415, "dislikes": 962, "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": 83995, "totalSubmissionRaw": 322168}, "194": {"acRate": 26.41469078464923, "difficulty": "Medium", "likes": 144, "dislikes": 286, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25935, "totalSubmissionRaw": 98184}, "195": {"acRate": 33.40770873020066, "difficulty": "Easy", "likes": 388, "dislikes": 466, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107503, "totalSubmissionRaw": 321791}, "196": {"acRate": 62.06749668923366, "difficulty": "Easy", "likes": 1575, "dislikes": 322, "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": 534763, "totalSubmissionRaw": 861583}, "197": {"acRate": 47.636628008523424, "difficulty": "Easy", "likes": 2841, "dislikes": 609, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 654568, "totalSubmissionRaw": 1374073}, "198": {"acRate": 51.100461902490515, "difficulty": "Medium", "likes": 20866, "dislikes": 414, "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": 2231526, "totalSubmissionRaw": 4366937}, "199": {"acRate": 63.228445248610235, "difficulty": "Medium", "likes": 11857, "dislikes": 936, "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": 1327878, "totalSubmissionRaw": 2100138}, "200": {"acRate": 59.648804809822686, "difficulty": "Medium", "likes": 22644, "dislikes": 511, "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": 2754385, "totalSubmissionRaw": 4617683}, "201": {"acRate": 46.96705561081343, "difficulty": "Medium", "likes": 3976, "dislikes": 300, "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": 395229, "totalSubmissionRaw": 841504}, "202": {"acRate": 56.23415002200658, "difficulty": "Easy", "likes": 10226, "dislikes": 1427, "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": 1475703, "totalSubmissionRaw": 2624213}, "203": {"acRate": 49.01111337394402, "difficulty": "Easy", "likes": 8243, "dislikes": 237, "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": 1140715, "totalSubmissionRaw": 2327463}, "204": {"acRate": 33.668073352734034, "difficulty": "Medium", "likes": 7862, "dislikes": 1435, "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": 871289, "totalSubmissionRaw": 2587879}, "205": {"acRate": 45.22940818507023, "difficulty": "Easy", "likes": 8905, "dislikes": 2067, "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": 1357163, "totalSubmissionRaw": 3000608}, "206": {"acRate": 76.75251562357818, "difficulty": "Easy", "likes": 21339, "dislikes": 432, "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": 4183572, "totalSubmissionRaw": 5450731}, "207": {"acRate": 46.861179862174914, "difficulty": "Medium", "likes": 16027, "dislikes": 698, "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": 1579992, "totalSubmissionRaw": 3371647}, "208": {"acRate": 65.36623472968188, "difficulty": "Medium", "likes": 11411, "dislikes": 141, "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": 1046764, "totalSubmissionRaw": 1601385}, "209": {"acRate": 47.223785435461544, "difficulty": "Medium", "likes": 12471, "dislikes": 423, "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": 1056491, "totalSubmissionRaw": 2237202}, "210": {"acRate": 50.636442463010255, "difficulty": "Medium", "likes": 10661, "dislikes": 344, "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": 1043564, "totalSubmissionRaw": 2060901}, "211": {"acRate": 45.37740773275281, "difficulty": "Medium", "likes": 7529, "dislikes": 448, "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": 641583, "totalSubmissionRaw": 1413882}, "212": {"acRate": 36.34171372471632, "difficulty": "Hard", "likes": 9341, "dislikes": 455, "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": 661131, "totalSubmissionRaw": 1819207}, "213": {"acRate": 42.072623715782676, "difficulty": "Medium", "likes": 9718, "dislikes": 146, "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": 763498, "totalSubmissionRaw": 1814718}, "214": {"acRate": 33.558186235895846, "difficulty": "Hard", "likes": 3574, "dislikes": 244, "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": 181482, "totalSubmissionRaw": 540798}, "215": {"acRate": 66.7851168044112, "difficulty": "Medium", "likes": 16893, "dislikes": 866, "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": 2322582, "totalSubmissionRaw": 3477694}, "216": {"acRate": 69.83244143276202, "difficulty": "Medium", "likes": 5909, "dislikes": 110, "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": 517537, "totalSubmissionRaw": 741112}, "217": {"acRate": 61.81674477343311, "difficulty": "Easy", "likes": 11890, "dislikes": 1291, "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": 4029443, "totalSubmissionRaw": 6518378}, "218": {"acRate": 42.75286957009185, "difficulty": "Hard", "likes": 5859, "dislikes": 263, "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": 289817, "totalSubmissionRaw": 677889}, "219": {"acRate": 45.39504997052133, "difficulty": "Easy", "likes": 6056, "dislikes": 3077, "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": 950906, "totalSubmissionRaw": 2094735}, "220": {"acRate": 22.798849960050582, "difficulty": "Hard", "likes": 967, "dislikes": 79, "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": 253672, "totalSubmissionRaw": 1112656}, "221": {"acRate": 46.7041742113855, "difficulty": "Medium", "likes": 10025, "dislikes": 223, "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": 686350, "totalSubmissionRaw": 1469570}, "222": {"acRate": 65.61928801462268, "difficulty": "Easy", "likes": 8549, "dislikes": 511, "categoryTitle": "Algorithms", "frontendQuestionId": "222", "paidOnly": false, "title": "Count Complete Tree Nodes", "titleSlug": "count-complete-tree-nodes", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 731280, "totalSubmissionRaw": 1114428}, "223": {"acRate": 46.29559136893063, "difficulty": "Medium", "likes": 1985, "dislikes": 1640, "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": 223779, "totalSubmissionRaw": 483370}, "224": {"acRate": 43.53403884586908, "difficulty": "Hard", "likes": 6242, "dislikes": 487, "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": 469209, "totalSubmissionRaw": 1077797}, "225": {"acRate": 63.94851728303894, "difficulty": "Easy", "likes": 5991, "dislikes": 1202, "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": 678053, "totalSubmissionRaw": 1060309}, "226": {"acRate": 77.13693952153996, "difficulty": "Easy", "likes": 13859, "dislikes": 222, "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": 2083741, "totalSubmissionRaw": 2701355}, "227": {"acRate": 43.75362938127951, "difficulty": "Medium", "likes": 6112, "dislikes": 832, "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": 638925, "totalSubmissionRaw": 1460269}, "228": {"acRate": 50.822819062101665, "difficulty": "Easy", "likes": 3899, "dislikes": 2134, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 568159, "totalSubmissionRaw": 1117920}, "229": {"acRate": 51.66427643078026, "difficulty": "Medium", "likes": 9548, "dislikes": 424, "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": 691669, "totalSubmissionRaw": 1338778}, "230": {"acRate": 72.74752429099716, "difficulty": "Medium", "likes": 11353, "dislikes": 225, "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": 1443731, "totalSubmissionRaw": 1984573}, "231": {"acRate": 47.774799430089146, "difficulty": "Easy", "likes": 6766, "dislikes": 428, "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": 1325497, "totalSubmissionRaw": 2774469}, "232": {"acRate": 66.34826222096638, "difficulty": "Easy", "likes": 7546, "dislikes": 424, "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": 939224, "totalSubmissionRaw": 1415598}, "233": {"acRate": 34.628698803539926, "difficulty": "Hard", "likes": 1539, "dislikes": 1462, "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": 93832, "totalSubmissionRaw": 270966}, "234": {"acRate": 53.34058747576426, "difficulty": "Easy", "likes": 16330, "dislikes": 876, "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": 1943671, "totalSubmissionRaw": 3643891}, "235": {"acRate": 64.99888275756959, "difficulty": "Medium", "likes": 10991, "dislikes": 311, "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": 1509716, "totalSubmissionRaw": 2322681}, "236": {"acRate": 62.53150107764844, "difficulty": "Medium", "likes": 16286, "dislikes": 406, "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": 1645614, "totalSubmissionRaw": 2631656}, "237": {"acRate": 79.89691601482934, "difficulty": "Medium", "likes": 4932, "dislikes": 1536, "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": 1404260, "totalSubmissionRaw": 1757591}, "238": {"acRate": 66.34017339839815, "difficulty": "Medium", "likes": 22326, "dislikes": 1384, "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": 2666860, "totalSubmissionRaw": 4019980}, "239": {"acRate": 46.600470798108894, "difficulty": "Hard", "likes": 18020, "dislikes": 669, "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": 1036534, "totalSubmissionRaw": 2224299}, "240": {"acRate": 52.80058941368344, "difficulty": "Medium", "likes": 11786, "dislikes": 198, "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": 935948, "totalSubmissionRaw": 1772609}, "241": {"acRate": 65.53354097572128, "difficulty": "Medium", "likes": 5326, "dislikes": 272, "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": 220712, "totalSubmissionRaw": 336793}, "242": {"acRate": 64.67679955764687, "difficulty": "Easy", "likes": 12015, "dislikes": 397, "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": 3553468, "totalSubmissionRaw": 5494198}, "243": {"acRate": 65.36821085044436, "difficulty": "Easy", "likes": 1263, "dislikes": 112, "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": 214411, "totalSubmissionRaw": 328005}, "244": {"acRate": 61.26131865856475, "difficulty": "Medium", "likes": 1048, "dislikes": 334, "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": 153848, "totalSubmissionRaw": 251134}, "245": {"acRate": 58.497212456944006, "difficulty": "Medium", "likes": 503, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82367, "totalSubmissionRaw": 140805}, "246": {"acRate": 47.70216291144121, "difficulty": "Easy", "likes": 593, "dislikes": 1012, "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": 174474, "totalSubmissionRaw": 365757}, "247": {"acRate": 52.40487808500999, "difficulty": "Medium", "likes": 922, "dislikes": 249, "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": 141119, "totalSubmissionRaw": 269286}, "248": {"acRate": 42.139569225089694, "difficulty": "Hard", "likes": 300, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36527, "totalSubmissionRaw": 86681}, "249": {"acRate": 65.73341215365583, "difficulty": "Medium", "likes": 1665, "dislikes": 381, "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": 240182, "totalSubmissionRaw": 365388}, "250": {"acRate": 56.47182475291341, "difficulty": "Medium", "likes": 1198, "dislikes": 424, "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": 153129, "totalSubmissionRaw": 271160}, "251": {"acRate": 49.540326601844924, "difficulty": "Medium", "likes": 712, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127172, "totalSubmissionRaw": 256704}, "252": {"acRate": 58.12403019986567, "difficulty": "Easy", "likes": 2024, "dislikes": 101, "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": 401553, "totalSubmissionRaw": 690849}, "253": {"acRate": 51.332304855450175, "difficulty": "Medium", "likes": 6920, "dislikes": 159, "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": 899727, "totalSubmissionRaw": 1752751}, "254": {"acRate": 49.55772160557162, "difficulty": "Medium", "likes": 1127, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127514, "totalSubmissionRaw": 257304}, "255": {"acRate": 49.95532991170726, "difficulty": "Medium", "likes": 1195, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81077, "totalSubmissionRaw": 162300}, "256": {"acRate": 62.57518351527369, "difficulty": "Medium", "likes": 2291, "dislikes": 129, "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": 208595, "totalSubmissionRaw": 333351}, "257": {"acRate": 63.8689483563976, "difficulty": "Easy", "likes": 6515, "dislikes": 290, "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": 731522, "totalSubmissionRaw": 1145349}, "258": {"acRate": 66.68396946308415, "difficulty": "Easy", "likes": 4791, "dislikes": 1932, "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": 793912, "totalSubmissionRaw": 1190559}, "259": {"acRate": 50.78386536789124, "difficulty": "Medium", "likes": 1546, "dislikes": 156, "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": 151243, "totalSubmissionRaw": 297816}, "260": {"acRate": 70.75450380734229, "difficulty": "Medium", "likes": 6301, "dislikes": 259, "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": 457159, "totalSubmissionRaw": 646120}, "261": {"acRate": 48.19985261043169, "difficulty": "Medium", "likes": 3253, "dislikes": 101, "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": 403547, "totalSubmissionRaw": 837237}, "262": {"acRate": 36.40096427442302, "difficulty": "Hard", "likes": 1228, "dislikes": 666, "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": 184218, "totalSubmissionRaw": 506079}, "263": {"acRate": 41.94767124506208, "difficulty": "Easy", "likes": 3310, "dislikes": 1698, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 518727, "totalSubmissionRaw": 1236594}, "264": {"acRate": 46.21203861121319, "difficulty": "Medium", "likes": 5930, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 343305, "totalSubmissionRaw": 742892}, "265": {"acRate": 54.77147463370655, "difficulty": "Hard", "likes": 1299, "dislikes": 36, "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": 123324, "totalSubmissionRaw": 225161}, "266": {"acRate": 67.38700033657368, "difficulty": "Easy", "likes": 1050, "dislikes": 70, "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": 204218, "totalSubmissionRaw": 303053}, "267": {"acRate": 41.58158158158158, "difficulty": "Medium", "likes": 878, "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": 68541, "totalSubmissionRaw": 164835}, "268": {"acRate": 67.06470838272985, "difficulty": "Easy", "likes": 11988, "dislikes": 3315, "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": 2243557, "totalSubmissionRaw": 3345364}, "269": {"acRate": 35.80450641086807, "difficulty": "Hard", "likes": 4403, "dislikes": 984, "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": 382737, "totalSubmissionRaw": 1068961}, "270": {"acRate": 51.5160232523476, "difficulty": "Easy", "likes": 1796, "dislikes": 137, "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": 345619, "totalSubmissionRaw": 670897}, "271": {"acRate": 46.79492821769565, "difficulty": "Medium", "likes": 1450, "dislikes": 404, "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": 202019, "totalSubmissionRaw": 431717}, "272": {"acRate": 59.18404938517449, "difficulty": "Hard", "likes": 1288, "dislikes": 44, "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": 118880, "totalSubmissionRaw": 200867}, "273": {"acRate": 30.660246853781114, "difficulty": "Hard", "likes": 3014, "dislikes": 6203, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 382325, "totalSubmissionRaw": 1246973}, "274": {"acRate": 39.02175562196143, "difficulty": "Medium", "likes": 1208, "dislikes": 536, "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": 473228, "totalSubmissionRaw": 1212729}, "275": {"acRate": 38.17765929619715, "difficulty": "Medium", "likes": 321, "dislikes": 85, "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": 205794, "totalSubmissionRaw": 539043}, "276": {"acRate": 46.69674867103474, "difficulty": "Medium", "likes": 1551, "dislikes": 387, "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": 113318, "totalSubmissionRaw": 242669}, "277": {"acRate": 47.300880748548224, "difficulty": "Medium", "likes": 2812, "dislikes": 277, "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": 268634, "totalSubmissionRaw": 567926}, "278": {"acRate": 44.47676169727745, "difficulty": "Easy", "likes": 8325, "dislikes": 3292, "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": 1690799, "totalSubmissionRaw": 3801540}, "279": {"acRate": 54.854372668448946, "difficulty": "Medium", "likes": 11133, "dislikes": 469, "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": 855206, "totalSubmissionRaw": 1559048}, "280": {"acRate": 67.7022567418914, "difficulty": "Medium", "likes": 1203, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "280", "paidOnly": true, "title": "Wiggle Sort", "titleSlug": "wiggle-sort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 142170, "totalSubmissionRaw": 209993}, "281": {"acRate": 63.95386094200577, "difficulty": "Medium", "likes": 675, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "281", "paidOnly": true, "title": "Zigzag Iterator", "titleSlug": "zigzag-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93812, "totalSubmissionRaw": 146687}, "282": {"acRate": 39.93776739194894, "difficulty": "Hard", "likes": 3336, "dislikes": 613, "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": 226281, "totalSubmissionRaw": 566584}, "283": {"acRate": 61.800761446070055, "difficulty": "Easy", "likes": 16512, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "283", "paidOnly": false, "title": "Move Zeroes", "titleSlug": "move-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3010311, "totalSubmissionRaw": 4870994}, "284": {"acRate": 59.57132876752974, "difficulty": "Medium", "likes": 1848, "dislikes": 1034, "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": 220847, "totalSubmissionRaw": 370727}, "285": {"acRate": 49.8382949871446, "difficulty": "Medium", "likes": 2565, "dislikes": 93, "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": 332243, "totalSubmissionRaw": 666642}, "286": {"acRate": 61.48586641730922, "difficulty": "Medium", "likes": 3107, "dislikes": 63, "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": 318249, "totalSubmissionRaw": 517597}, "287": {"acRate": 60.932432074553866, "difficulty": "Medium", "likes": 23108, "dislikes": 4489, "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": 1748614, "totalSubmissionRaw": 2869761}, "288": {"acRate": 26.307208863186034, "difficulty": "Medium", "likes": 201, "dislikes": 1819, "categoryTitle": "Algorithms", "frontendQuestionId": "288", "paidOnly": true, "title": "Unique Word Abbreviation", "titleSlug": "unique-word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73420, "totalSubmissionRaw": 279087}, "289": {"acRate": 69.28872536737394, "difficulty": "Medium", "likes": 6295, "dislikes": 562, "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": 472879, "totalSubmissionRaw": 682477}, "290": {"acRate": 42.09864031655586, "difficulty": "Easy", "likes": 7202, "dislikes": 994, "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": 721970, "totalSubmissionRaw": 1714945}, "291": {"acRate": 48.19810738271947, "difficulty": "Medium", "likes": 912, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76501, "totalSubmissionRaw": 158722}, "292": {"acRate": 56.928437818288735, "difficulty": "Easy", "likes": 1700, "dislikes": 2686, "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": 379514, "totalSubmissionRaw": 666651}, "293": {"acRate": 64.58331504034702, "difficulty": "Easy", "likes": 224, "dislikes": 465, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73552, "totalSubmissionRaw": 113887}, "294": {"acRate": 52.101272141352304, "difficulty": "Medium", "likes": 618, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70976, "totalSubmissionRaw": 136227}, "295": {"acRate": 51.98204052696875, "difficulty": "Hard", "likes": 11763, "dislikes": 237, "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": 791907, "totalSubmissionRaw": 1523427}, "296": {"acRate": 60.95712413947866, "difficulty": "Hard", "likes": 1175, "dislikes": 103, "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": 84208, "totalSubmissionRaw": 138143}, "297": {"acRate": 56.91904646353198, "difficulty": "Hard", "likes": 10056, "dislikes": 388, "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": 874922, "totalSubmissionRaw": 1537137}, "298": {"acRate": 53.551583074873356, "difficulty": "Medium", "likes": 1135, "dislikes": 236, "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": 148316, "totalSubmissionRaw": 276957}, "299": {"acRate": 50.334964800536376, "difficulty": "Medium", "likes": 2416, "dislikes": 1776, "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": 375373, "totalSubmissionRaw": 745750}, "300": {"acRate": 55.5068989562559, "difficulty": "Medium", "likes": 20678, "dislikes": 433, "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": 1694705, "totalSubmissionRaw": 3053143}, "301": {"acRate": 48.29795593974085, "difficulty": "Hard", "likes": 5830, "dislikes": 284, "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": 432681, "totalSubmissionRaw": 895861}, "302": {"acRate": 58.96197521556802, "difficulty": "Hard", "likes": 525, "dislikes": 100, "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": 50054, "totalSubmissionRaw": 84892}, "303": {"acRate": 63.67117450359542, "difficulty": "Easy", "likes": 3191, "dislikes": 1897, "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": 537909, "totalSubmissionRaw": 844824}, "304": {"acRate": 54.72749247942793, "difficulty": "Medium", "likes": 4928, "dislikes": 341, "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": 368582, "totalSubmissionRaw": 673486}, "305": {"acRate": 39.87898246480612, "difficulty": "Hard", "likes": 1855, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145322, "totalSubmissionRaw": 364409}, "306": {"acRate": 31.633396169217846, "difficulty": "Medium", "likes": 1158, "dislikes": 797, "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": 90784, "totalSubmissionRaw": 286989}, "307": {"acRate": 41.01658314102777, "difficulty": "Medium", "likes": 4706, "dislikes": 251, "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": 271232, "totalSubmissionRaw": 661274}, "308": {"acRate": 44.11978882213727, "difficulty": "Hard", "likes": 800, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77552, "totalSubmissionRaw": 175776}, "309": {"acRate": 58.287798065837116, "difficulty": "Medium", "likes": 9316, "dislikes": 313, "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": 512129, "totalSubmissionRaw": 878622}, "310": {"acRate": 41.75948964887628, "difficulty": "Medium", "likes": 8176, "dislikes": 377, "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": 373252, "totalSubmissionRaw": 893813}, "311": {"acRate": 68.11095803117847, "difficulty": "Medium", "likes": 1056, "dislikes": 359, "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": 191323, "totalSubmissionRaw": 280899}, "312": {"acRate": 58.95311901830335, "difficulty": "Hard", "likes": 8885, "dislikes": 246, "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": 284887, "totalSubmissionRaw": 483244}, "313": {"acRate": 45.26120543383182, "difficulty": "Medium", "likes": 2139, "dislikes": 382, "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": 128841, "totalSubmissionRaw": 284661}, "314": {"acRate": 54.56068838792585, "difficulty": "Medium", "likes": 3233, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 414807, "totalSubmissionRaw": 760267}, "315": {"acRate": 42.451541946306506, "difficulty": "Hard", "likes": 8776, "dislikes": 239, "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": 321136, "totalSubmissionRaw": 756477}, "316": {"acRate": 49.731681241180574, "difficulty": "Medium", "likes": 8596, "dislikes": 624, "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": 334455, "totalSubmissionRaw": 672520}, "317": {"acRate": 43.267954362658934, "difficulty": "Hard", "likes": 1865, "dislikes": 296, "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": 176988, "totalSubmissionRaw": 409051}, "318": {"acRate": 60.031667043655276, "difficulty": "Medium", "likes": 3494, "dislikes": 139, "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": 217628, "totalSubmissionRaw": 362522}, "319": {"acRate": 52.80507588593677, "difficulty": "Medium", "likes": 2612, "dislikes": 3103, "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": 219714, "totalSubmissionRaw": 416085}, "320": {"acRate": 58.464396708932284, "difficulty": "Medium", "likes": 682, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68287, "totalSubmissionRaw": 116801}, "321": {"acRate": 30.27791949200814, "difficulty": "Hard", "likes": 1907, "dislikes": 351, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61129, "totalSubmissionRaw": 201893}, "322": {"acRate": 44.09499356582715, "difficulty": "Medium", "likes": 18740, "dislikes": 443, "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": 1804106, "totalSubmissionRaw": 4091411}, "323": {"acRate": 62.89163090965525, "difficulty": "Medium", "likes": 2658, "dislikes": 100, "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": 403218, "totalSubmissionRaw": 641132}, "324": {"acRate": 34.40035718445471, "difficulty": "Medium", "likes": 3044, "dislikes": 955, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159489, "totalSubmissionRaw": 463626}, "325": {"acRate": 49.505678415604415, "difficulty": "Medium", "likes": 2034, "dislikes": 63, "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": 185175, "totalSubmissionRaw": 374048}, "326": {"acRate": 46.65792472322106, "difficulty": "Easy", "likes": 3065, "dislikes": 274, "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": 841860, "totalSubmissionRaw": 1804325}, "327": {"acRate": 35.964439154127994, "difficulty": "Hard", "likes": 2281, "dislikes": 239, "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": 77348, "totalSubmissionRaw": 215068}, "328": {"acRate": 61.4180659410666, "difficulty": "Medium", "likes": 9824, "dislikes": 524, "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": 933223, "totalSubmissionRaw": 1519455}, "329": {"acRate": 53.70513201434311, "difficulty": "Hard", "likes": 8894, "dislikes": 131, "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": 527798, "totalSubmissionRaw": 982771}, "330": {"acRate": 41.94375051311823, "difficulty": "Hard", "likes": 1566, "dislikes": 136, "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": 71525, "totalSubmissionRaw": 170526}, "331": {"acRate": 45.286486970309184, "difficulty": "Medium", "likes": 2318, "dislikes": 121, "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": 141667, "totalSubmissionRaw": 312824}, "332": {"acRate": 43.242499145917485, "difficulty": "Hard", "likes": 5846, "dislikes": 1862, "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": 430355, "totalSubmissionRaw": 995215}, "333": {"acRate": 43.909411894066814, "difficulty": "Medium", "likes": 1481, "dislikes": 126, "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": 107820, "totalSubmissionRaw": 245551}, "334": {"acRate": 39.763680439643714, "difficulty": "Medium", "likes": 8007, "dislikes": 501, "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": 575082, "totalSubmissionRaw": 1446245}, "335": {"acRate": 30.576765568443026, "difficulty": "Hard", "likes": 381, "dislikes": 509, "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": 34718, "totalSubmissionRaw": 113546}, "336": {"acRate": 35.380462984687625, "difficulty": "Hard", "likes": 4448, "dislikes": 463, "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": 206589, "totalSubmissionRaw": 583907}, "337": {"acRate": 54.27813056669978, "difficulty": "Medium", "likes": 8474, "dislikes": 140, "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": 383012, "totalSubmissionRaw": 705646}, "338": {"acRate": 78.38177296944534, "difficulty": "Easy", "likes": 11018, "dislikes": 529, "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": 1114561, "totalSubmissionRaw": 1421965}, "339": {"acRate": 83.78792974258221, "difficulty": "Medium", "likes": 1715, "dislikes": 418, "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": 284025, "totalSubmissionRaw": 338981}, "340": {"acRate": 48.87104647586477, "difficulty": "Medium", "likes": 2822, "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": 346397, "totalSubmissionRaw": 708798}, "341": {"acRate": 64.53506390380937, "difficulty": "Medium", "likes": 4862, "dislikes": 1746, "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": 451869, "totalSubmissionRaw": 700192}, "342": {"acRate": 48.073087840660925, "difficulty": "Easy", "likes": 3901, "dislikes": 394, "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": 669636, "totalSubmissionRaw": 1392954}, "343": {"acRate": 60.39645754571017, "difficulty": "Medium", "likes": 5083, "dislikes": 446, "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": 359127, "totalSubmissionRaw": 594616}, "344": {"acRate": 78.60784562076219, "difficulty": "Easy", "likes": 8566, "dislikes": 1170, "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": 2674898, "totalSubmissionRaw": 3402839}, "345": {"acRate": 53.30846237764033, "difficulty": "Easy", "likes": 4497, "dislikes": 2777, "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": 863923, "totalSubmissionRaw": 1620613}, "346": {"acRate": 78.48185152909227, "difficulty": "Easy", "likes": 1649, "dislikes": 165, "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": 387250, "totalSubmissionRaw": 493427}, "347": {"acRate": 62.83494691872614, "difficulty": "Medium", "likes": 17147, "dislikes": 651, "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": 2140333, "totalSubmissionRaw": 3406279}, "348": {"acRate": 58.045505002331346, "difficulty": "Medium", "likes": 2059, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245241, "totalSubmissionRaw": 422499}, "349": {"acRate": 74.60440314900167, "difficulty": "Easy", "likes": 5981, "dislikes": 2291, "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": 1220298, "totalSubmissionRaw": 1635692}, "350": {"acRate": 56.54819673230496, "difficulty": "Easy", "likes": 7146, "dislikes": 937, "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": 1214272, "totalSubmissionRaw": 2147317}, "351": {"acRate": 51.85225008243373, "difficulty": "Medium", "likes": 159, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72337, "totalSubmissionRaw": 139506}, "352": {"acRate": 60.054156004588364, "difficulty": "Hard", "likes": 1727, "dislikes": 362, "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": 108895, "totalSubmissionRaw": 181328}, "353": {"acRate": 38.77443138985419, "difficulty": "Medium", "likes": 936, "dislikes": 332, "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": 84353, "totalSubmissionRaw": 217548}, "354": {"acRate": 37.082249655573094, "difficulty": "Hard", "likes": 5918, "dislikes": 145, "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": 218288, "totalSubmissionRaw": 588659}, "355": {"acRate": 39.639244840928164, "difficulty": "Medium", "likes": 3823, "dislikes": 516, "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": 180003, "totalSubmissionRaw": 454102}, "356": {"acRate": 35.575302722329354, "difficulty": "Medium", "likes": 297, "dislikes": 619, "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": 40955, "totalSubmissionRaw": 115122}, "357": {"acRate": 53.065933395371545, "difficulty": "Medium", "likes": 1509, "dislikes": 1490, "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": 139141, "totalSubmissionRaw": 262204}, "358": {"acRate": 38.77944248361305, "difficulty": "Hard", "likes": 957, "dislikes": 38, "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": 64605, "totalSubmissionRaw": 166596}, "359": {"acRate": 75.91641306360412, "difficulty": "Easy", "likes": 1715, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 319806, "totalSubmissionRaw": 421259}, "360": {"acRate": 55.83667845965438, "difficulty": "Medium", "likes": 669, "dislikes": 210, "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": 65655, "totalSubmissionRaw": 117584}, "361": {"acRate": 51.79071940205543, "difficulty": "Medium", "likes": 957, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78161, "totalSubmissionRaw": 150917}, "362": {"acRate": 68.72226108777605, "difficulty": "Medium", "likes": 2024, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242637, "totalSubmissionRaw": 353069}, "363": {"acRate": 44.16624778991251, "difficulty": "Hard", "likes": 3440, "dislikes": 171, "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": 125649, "totalSubmissionRaw": 284491}, "364": {"acRate": 65.07048142112589, "difficulty": "Medium", "likes": 1122, "dislikes": 449, "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": 136961, "totalSubmissionRaw": 210480}, "365": {"acRate": 40.74753932335348, "difficulty": "Medium", "likes": 1484, "dislikes": 1467, "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": 103000, "totalSubmissionRaw": 252776}, "366": {"acRate": 80.60430073771778, "difficulty": "Medium", "likes": 3213, "dislikes": 56, "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": 256765, "totalSubmissionRaw": 318550}, "367": {"acRate": 43.67937858141932, "difficulty": "Easy", "likes": 4192, "dislikes": 305, "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": 612699, "totalSubmissionRaw": 1402722}, "368": {"acRate": 45.32711791583314, "difficulty": "Medium", "likes": 5871, "dislikes": 273, "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": 294332, "totalSubmissionRaw": 649352}, "369": {"acRate": 61.056809611238506, "difficulty": "Medium", "likes": 939, "dislikes": 45, "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": 80145, "totalSubmissionRaw": 131263}, "370": {"acRate": 71.63105935570634, "difficulty": "Medium", "likes": 1632, "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": 93745, "totalSubmissionRaw": 130872}, "371": {"acRate": 51.98618845685129, "difficulty": "Medium", "likes": 4141, "dislikes": 5484, "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": 483745, "totalSubmissionRaw": 930526}, "372": {"acRate": 35.13122171945701, "difficulty": "Medium", "likes": 916, "dislikes": 1427, "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": 71817, "totalSubmissionRaw": 204425}, "373": {"acRate": 39.97185826653361, "difficulty": "Medium", "likes": 6167, "dislikes": 444, "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": 297995, "totalSubmissionRaw": 745507}, "374": {"acRate": 53.64527613171488, "difficulty": "Easy", "likes": 3687, "dislikes": 516, "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": 654879, "totalSubmissionRaw": 1220758}, "375": {"acRate": 49.116725103664734, "difficulty": "Medium", "likes": 2129, "dislikes": 2111, "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": 124255, "totalSubmissionRaw": 252979}, "376": {"acRate": 48.5442754522443, "difficulty": "Medium", "likes": 5077, "dislikes": 163, "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": 246052, "totalSubmissionRaw": 506861}, "377": {"acRate": 54.19413005903863, "difficulty": "Medium", "likes": 7331, "dislikes": 658, "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": 485681, "totalSubmissionRaw": 896189}, "378": {"acRate": 62.50849042947655, "difficulty": "Medium", "likes": 9864, "dislikes": 350, "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": 617505, "totalSubmissionRaw": 987874}, "379": {"acRate": 51.728561148828334, "difficulty": "Medium", "likes": 351, "dislikes": 469, "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": 66136, "totalSubmissionRaw": 127852}, "380": {"acRate": 54.45953322313579, "difficulty": "Medium", "likes": 9150, "dislikes": 612, "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": 918875, "totalSubmissionRaw": 1687266}, "381": {"acRate": 35.46901058380685, "difficulty": "Hard", "likes": 2276, "dislikes": 150, "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": 143131, "totalSubmissionRaw": 403540}, "382": {"acRate": 63.21365708060662, "difficulty": "Medium", "likes": 3062, "dislikes": 704, "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": 243133, "totalSubmissionRaw": 384621}, "383": {"acRate": 61.616885588732316, "difficulty": "Easy", "likes": 4931, "dislikes": 497, "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": 1160569, "totalSubmissionRaw": 1883530}, "384": {"acRate": 58.358804896781656, "difficulty": "Medium", "likes": 1336, "dislikes": 924, "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": 336606, "totalSubmissionRaw": 576787}, "385": {"acRate": 38.25694926105746, "difficulty": "Medium", "likes": 454, "dislikes": 1367, "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": 57364, "totalSubmissionRaw": 149944}, "386": {"acRate": 64.08813265801128, "difficulty": "Medium", "likes": 1945, "dislikes": 143, "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": 122864, "totalSubmissionRaw": 191711}, "387": {"acRate": 62.200080666933154, "difficulty": "Easy", "likes": 8917, "dislikes": 293, "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": 1725657, "totalSubmissionRaw": 2774367}, "388": {"acRate": 47.45579136207759, "difficulty": "Medium", "likes": 1270, "dislikes": 2487, "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": 155543, "totalSubmissionRaw": 327764}, "389": {"acRate": 59.65206270987227, "difficulty": "Easy", "likes": 4963, "dislikes": 478, "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": 737933, "totalSubmissionRaw": 1237061}, "390": {"acRate": 45.72414924770272, "difficulty": "Medium", "likes": 1532, "dislikes": 699, "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": 72448, "totalSubmissionRaw": 158447}, "391": {"acRate": 33.77437590827126, "difficulty": "Hard", "likes": 869, "dislikes": 118, "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": 44390, "totalSubmissionRaw": 131431}, "392": {"acRate": 48.018785000801344, "difficulty": "Easy", "likes": 9520, "dislikes": 520, "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": 1447128, "totalSubmissionRaw": 3013662}, "393": {"acRate": 45.17235954973972, "difficulty": "Medium", "likes": 901, "dislikes": 2864, "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": 123480, "totalSubmissionRaw": 273353}, "394": {"acRate": 59.281538045553106, "difficulty": "Medium", "likes": 12536, "dislikes": 597, "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": 809007, "totalSubmissionRaw": 1364685}, "395": {"acRate": 44.985036972770686, "difficulty": "Medium", "likes": 6177, "dislikes": 505, "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": 225030, "totalSubmissionRaw": 500233}, "396": {"acRate": 42.62506382704482, "difficulty": "Medium", "likes": 1554, "dislikes": 266, "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": 85982, "totalSubmissionRaw": 201717}, "397": {"acRate": 35.77010829106275, "difficulty": "Medium", "likes": 1321, "dislikes": 477, "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": 118679, "totalSubmissionRaw": 331782}, "398": {"acRate": 63.417331586899515, "difficulty": "Medium", "likes": 1274, "dislikes": 1283, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 227073, "totalSubmissionRaw": 358062}, "399": {"acRate": 61.754037006987886, "difficulty": "Medium", "likes": 9145, "dislikes": 914, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 471912, "totalSubmissionRaw": 764180}, "400": {"acRate": 34.83092480367196, "difficulty": "Medium", "likes": 1061, "dislikes": 2043, "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": 97133, "totalSubmissionRaw": 278866}, "401": {"acRate": 54.5591440758044, "difficulty": "Easy", "likes": 1371, "dislikes": 2538, "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": 144926, "totalSubmissionRaw": 265631}, "402": {"acRate": 33.58641755918173, "difficulty": "Medium", "likes": 9395, "dislikes": 482, "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": 484783, "totalSubmissionRaw": 1443392}, "403": {"acRate": 46.101929161882296, "difficulty": "Hard", "likes": 5530, "dislikes": 252, "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": 266193, "totalSubmissionRaw": 577400}, "404": {"acRate": 60.66573212792132, "difficulty": "Easy", "likes": 5449, "dislikes": 306, "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": 622318, "totalSubmissionRaw": 1025814}, "405": {"acRate": 48.587692511949015, "difficulty": "Easy", "likes": 1306, "dislikes": 217, "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": 146385, "totalSubmissionRaw": 301280}, "406": {"acRate": 73.5113723795955, "difficulty": "Medium", "likes": 7052, "dislikes": 713, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302871, "totalSubmissionRaw": 412006}, "407": {"acRate": 47.97728539953553, "difficulty": "Hard", "likes": 3717, "dislikes": 94, "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": 88627, "totalSubmissionRaw": 184727}, "408": {"acRate": 35.873120115584165, "difficulty": "Easy", "likes": 721, "dislikes": 2193, "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": 191185, "totalSubmissionRaw": 532946}, "409": {"acRate": 55.295602417155386, "difficulty": "Easy", "likes": 5838, "dislikes": 405, "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": 775497, "totalSubmissionRaw": 1402460}, "410": {"acRate": 55.48032142235619, "difficulty": "Hard", "likes": 9664, "dislikes": 217, "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": 347496, "totalSubmissionRaw": 626341}, "411": {"acRate": 39.765055360518495, "difficulty": "Hard", "likes": 179, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14725, "totalSubmissionRaw": 37030}, "412": {"acRate": 72.30668213811744, "difficulty": "Easy", "likes": 2705, "dislikes": 364, "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": 1248761, "totalSubmissionRaw": 1727039}, "413": {"acRate": 65.05031905774786, "difficulty": "Medium", "likes": 5320, "dislikes": 294, "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": 307353, "totalSubmissionRaw": 472485}, "414": {"acRate": 35.01658320658648, "difficulty": "Easy", "likes": 3001, "dislikes": 3141, "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": 541721, "totalSubmissionRaw": 1547040}, "415": {"acRate": 51.67316633021349, "difficulty": "Easy", "likes": 4997, "dislikes": 745, "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": 675756, "totalSubmissionRaw": 1307752}, "416": {"acRate": 46.351361837510666, "difficulty": "Medium", "likes": 12138, "dislikes": 242, "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": 836262, "totalSubmissionRaw": 1804180}, "417": {"acRate": 55.35076967869789, "difficulty": "Medium", "likes": 7291, "dislikes": 1451, "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": 471465, "totalSubmissionRaw": 851777}, "418": {"acRate": 36.17147365527483, "difficulty": "Medium", "likes": 1112, "dislikes": 542, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101321, "totalSubmissionRaw": 280113}, "419": {"acRate": 75.42959491976191, "difficulty": "Medium", "likes": 2275, "dislikes": 968, "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": 208457, "totalSubmissionRaw": 276359}, "420": {"acRate": 13.682122945383146, "difficulty": "Hard", "likes": 861, "dislikes": 1724, "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": 41670, "totalSubmissionRaw": 304558}, "421": {"acRate": 53.220183034027244, "difficulty": "Medium", "likes": 5431, "dislikes": 394, "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": 161957, "totalSubmissionRaw": 304315}, "422": {"acRate": 41.12373236643816, "difficulty": "Easy", "likes": 424, "dislikes": 269, "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": 58070, "totalSubmissionRaw": 141208}, "423": {"acRate": 51.09304897113588, "difficulty": "Medium", "likes": 824, "dislikes": 2707, "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": 80399, "totalSubmissionRaw": 157358}, "424": {"acRate": 54.11345736027783, "difficulty": "Medium", "likes": 10466, "dislikes": 497, "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": 747446, "totalSubmissionRaw": 1381255}, "425": {"acRate": 53.385545538653524, "difficulty": "Hard", "likes": 1086, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74436, "totalSubmissionRaw": 139431}, "426": {"acRate": 64.82061155203712, "difficulty": "Medium", "likes": 2589, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "426", "paidOnly": true, "title": "Convert Binary Search Tree to Sorted Doubly Linked List", "titleSlug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288867, "totalSubmissionRaw": 445645}, "427": {"acRate": 75.48810006512096, "difficulty": "Medium", "likes": 1487, "dislikes": 1825, "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": 122874, "totalSubmissionRaw": 162773}, "428": {"acRate": 67.25497530477797, "difficulty": "Hard", "likes": 1047, "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": 88102, "totalSubmissionRaw": 130997}, "429": {"acRate": 70.84366329182883, "difficulty": "Medium", "likes": 3603, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 306899, "totalSubmissionRaw": 433206}, "430": {"acRate": 60.132777946355496, "difficulty": "Medium", "likes": 4980, "dislikes": 323, "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": 326981, "totalSubmissionRaw": 543765}, "431": {"acRate": 79.5109272614123, "difficulty": "Hard", "likes": 518, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21720, "totalSubmissionRaw": 27317}, "432": {"acRate": 36.82526155464089, "difficulty": "Hard", "likes": 1562, "dislikes": 171, "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": 81238, "totalSubmissionRaw": 220604}, "433": {"acRate": 53.843131698268756, "difficulty": "Medium", "likes": 2935, "dislikes": 317, "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": 167198, "totalSubmissionRaw": 310528}, "434": {"acRate": 36.34207048283831, "difficulty": "Easy", "likes": 783, "dislikes": 1256, "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": 183683, "totalSubmissionRaw": 505428}, "435": {"acRate": 53.39756313868036, "difficulty": "Medium", "likes": 8046, "dislikes": 219, "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": 573792, "totalSubmissionRaw": 1074567}, "436": {"acRate": 52.19780969757083, "difficulty": "Medium", "likes": 2123, "dislikes": 351, "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": 114724, "totalSubmissionRaw": 219787}, "437": {"acRate": 46.26447616924166, "difficulty": "Medium", "likes": 10853, "dislikes": 516, "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": 564397, "totalSubmissionRaw": 1219935}, "438": {"acRate": 50.981944884383914, "difficulty": "Medium", "likes": 12256, "dislikes": 339, "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": 878784, "totalSubmissionRaw": 1723714}, "439": {"acRate": 60.88407624415931, "difficulty": "Medium", "likes": 484, "dislikes": 67, "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": 32836, "totalSubmissionRaw": 53932}, "440": {"acRate": 32.33918534452849, "difficulty": "Hard", "likes": 758, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "440", "paidOnly": false, "title": "K-th Smallest in Lexicographical Order", "titleSlug": "k-th-smallest-in-lexicographical-order", "topicTags": [{"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23302, "totalSubmissionRaw": 72055}, "441": {"acRate": 46.64222886277688, "difficulty": "Easy", "likes": 3840, "dislikes": 1322, "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": 442034, "totalSubmissionRaw": 947711}, "442": {"acRate": 75.71597871709531, "difficulty": "Medium", "likes": 10360, "dislikes": 397, "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": 773699, "totalSubmissionRaw": 1021845}, "443": {"acRate": 54.675947807102176, "difficulty": "Medium", "likes": 4972, "dislikes": 7815, "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": 586515, "totalSubmissionRaw": 1072712}, "444": {"acRate": 28.25324599308811, "difficulty": "Medium", "likes": 567, "dislikes": 1506, "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": 55510, "totalSubmissionRaw": 196473}, "445": {"acRate": 61.18034728211201, "difficulty": "Medium", "likes": 5848, "dislikes": 287, "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": 475302, "totalSubmissionRaw": 776888}, "446": {"acRate": 54.57290483344938, "difficulty": "Hard", "likes": 3327, "dislikes": 153, "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": 148924, "totalSubmissionRaw": 272890}, "447": {"acRate": 55.481913058859945, "difficulty": "Medium", "likes": 828, "dislikes": 1013, "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": 100368, "totalSubmissionRaw": 180903}, "448": {"acRate": 61.0326793806388, "difficulty": "Easy", "likes": 9355, "dislikes": 487, "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": 891597, "totalSubmissionRaw": 1460853}, "449": {"acRate": 57.70643054115898, "difficulty": "Medium", "likes": 3475, "dislikes": 168, "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": 236047, "totalSubmissionRaw": 409048}, "450": {"acRate": 51.33235778194906, "difficulty": "Medium", "likes": 8986, "dislikes": 273, "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": 506193, "totalSubmissionRaw": 986105}, "451": {"acRate": 72.62193230150532, "difficulty": "Medium", "likes": 8196, "dislikes": 285, "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": 739661, "totalSubmissionRaw": 1018511}, "452": {"acRate": 59.01893579476042, "difficulty": "Medium", "likes": 7401, "dislikes": 234, "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": 521748, "totalSubmissionRaw": 884037}, "453": {"acRate": 56.76361288282115, "difficulty": "Medium", "likes": 2543, "dislikes": 1891, "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": 172298, "totalSubmissionRaw": 303536}, "454": {"acRate": 57.27860269369137, "difficulty": "Medium", "likes": 4887, "dislikes": 140, "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": 326232, "totalSubmissionRaw": 569553}, "455": {"acRate": 52.61952048029121, "difficulty": "Easy", "likes": 3819, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "455", "paidOnly": false, "title": "Assign Cookies", "titleSlug": "assign-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 450148, "totalSubmissionRaw": 855478}, "456": {"acRate": 33.759699392330376, "difficulty": "Medium", "likes": 7160, "dislikes": 433, "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": 258391, "totalSubmissionRaw": 765383}, "457": {"acRate": 34.11740960486425, "difficulty": "Medium", "likes": 674, "dislikes": 767, "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": 81137, "totalSubmissionRaw": 237817}, "458": {"acRate": 59.63406719584644, "difficulty": "Hard", "likes": 1779, "dislikes": 3353, "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": 119453, "totalSubmissionRaw": 200310}, "459": {"acRate": 46.08082229896722, "difficulty": "Easy", "likes": 6362, "dislikes": 518, "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": 450463, "totalSubmissionRaw": 977550}, "460": {"acRate": 44.29262843722305, "difficulty": "Hard", "likes": 5606, "dislikes": 326, "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": 251393, "totalSubmissionRaw": 567573}, "461": {"acRate": 75.42912659037749, "difficulty": "Easy", "likes": 3821, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "461", "paidOnly": false, "title": "Hamming Distance", "titleSlug": "hamming-distance", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575307, "totalSubmissionRaw": 762712}, "462": {"acRate": 60.09867263394844, "difficulty": "Medium", "likes": 3330, "dislikes": 123, "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": 181016, "totalSubmissionRaw": 301198}, "463": {"acRate": 72.82724105672159, "difficulty": "Easy", "likes": 6802, "dislikes": 376, "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": 634458, "totalSubmissionRaw": 871183}, "464": {"acRate": 29.70967098952299, "difficulty": "Medium", "likes": 2643, "dislikes": 394, "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": 95393, "totalSubmissionRaw": 321084}, "465": {"acRate": 49.54794188209289, "difficulty": "Hard", "likes": 1447, "dislikes": 147, "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": 91904, "totalSubmissionRaw": 185485}, "466": {"acRate": 30.257407288386144, "difficulty": "Hard", "likes": 402, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18831, "totalSubmissionRaw": 62236}, "467": {"acRate": 39.75818049464695, "difficulty": "Medium", "likes": 1435, "dislikes": 174, "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": 44786, "totalSubmissionRaw": 112646}, "468": {"acRate": 27.08741774317564, "difficulty": "Medium", "likes": 1003, "dislikes": 2699, "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": 162758, "totalSubmissionRaw": 600862}, "469": {"acRate": 39.47030084854718, "difficulty": "Medium", "likes": 98, "dislikes": 237, "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": 10745, "totalSubmissionRaw": 27223}, "470": {"acRate": 45.88626072778151, "difficulty": "Medium", "likes": 1100, "dislikes": 369, "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": 83301, "totalSubmissionRaw": 181538}, "471": {"acRate": 50.44140529031201, "difficulty": "Hard", "likes": 622, "dislikes": 52, "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": 30797, "totalSubmissionRaw": 61055}, "472": {"acRate": 49.41198436058516, "difficulty": "Hard", "likes": 3843, "dislikes": 281, "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": 224953, "totalSubmissionRaw": 455260}, "473": {"acRate": 40.271233642385404, "difficulty": "Medium", "likes": 3797, "dislikes": 294, "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": 164272, "totalSubmissionRaw": 407914}, "474": {"acRate": 47.63548119888465, "difficulty": "Medium", "likes": 5385, "dislikes": 453, "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": 204149, "totalSubmissionRaw": 428565}, "475": {"acRate": 37.96503178637508, "difficulty": "Medium", "likes": 2078, "dislikes": 1162, "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": 118602, "totalSubmissionRaw": 312398}, "476": {"acRate": 67.66648104085455, "difficulty": "Easy", "likes": 2661, "dislikes": 123, "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": 334154, "totalSubmissionRaw": 493825}, "477": {"acRate": 52.72428878760606, "difficulty": "Medium", "likes": 2199, "dislikes": 90, "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": 109550, "totalSubmissionRaw": 207779}, "478": {"acRate": 39.894875673998214, "difficulty": "Medium", "likes": 452, "dislikes": 767, "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": 41138, "totalSubmissionRaw": 103116}, "479": {"acRate": 33.38405521439052, "difficulty": "Hard", "likes": 176, "dislikes": 1557, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24572, "totalSubmissionRaw": 73604}, "480": {"acRate": 39.09431610154178, "difficulty": "Hard", "likes": 3184, "dislikes": 199, "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": 149274, "totalSubmissionRaw": 381830}, "481": {"acRate": 51.34626641023496, "difficulty": "Medium", "likes": 313, "dislikes": 1280, "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": 36843, "totalSubmissionRaw": 71754}, "482": {"acRate": 43.828440026519964, "difficulty": "Easy", "likes": 1090, "dislikes": 1406, "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": 282274, "totalSubmissionRaw": 644043}, "483": {"acRate": 40.75317954082475, "difficulty": "Hard", "likes": 383, "dislikes": 499, "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": 22206, "totalSubmissionRaw": 54489}, "484": {"acRate": 66.89300129985634, "difficulty": "Medium", "likes": 698, "dislikes": 146, "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": 39111, "totalSubmissionRaw": 58468}, "485": {"acRate": 59.29835493832589, "difficulty": "Easy", "likes": 5657, "dislikes": 454, "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": 1179975, "totalSubmissionRaw": 1989895}, "486": {"acRate": 55.41076300065133, "difficulty": "Medium", "likes": 5795, "dislikes": 283, "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": 234801, "totalSubmissionRaw": 423747}, "487": {"acRate": 50.383137791412736, "difficulty": "Medium", "likes": 1535, "dislikes": 25, "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": 145834, "totalSubmissionRaw": 289451}, "488": {"acRate": 32.702451991637474, "difficulty": "Hard", "likes": 451, "dislikes": 492, "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": 23620, "totalSubmissionRaw": 72227}, "489": {"acRate": 76.71947602226255, "difficulty": "Hard", "likes": 2760, "dislikes": 176, "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": 165276, "totalSubmissionRaw": 215429}, "490": {"acRate": 57.99850211525616, "difficulty": "Medium", "likes": 1839, "dislikes": 181, "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": 171917, "totalSubmissionRaw": 296417}, "491": {"acRate": 60.774485994105056, "difficulty": "Medium", "likes": 3623, "dislikes": 228, "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": 168665, "totalSubmissionRaw": 277526}, "492": {"acRate": 57.78180039138944, "difficulty": "Easy", "likes": 694, "dislikes": 388, "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": 118105, "totalSubmissionRaw": 204399}, "493": {"acRate": 30.6428882480618, "difficulty": "Hard", "likes": 6035, "dislikes": 260, "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": 178732, "totalSubmissionRaw": 583274}, "494": {"acRate": 46.92724841540769, "difficulty": "Medium", "likes": 10765, "dislikes": 358, "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": 599770, "totalSubmissionRaw": 1278083}, "495": {"acRate": 56.61188425663796, "difficulty": "Easy", "likes": 1131, "dislikes": 121, "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": 151977, "totalSubmissionRaw": 268455}, "496": {"acRate": 72.31630360086932, "difficulty": "Easy", "likes": 7855, "dislikes": 713, "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": 725054, "totalSubmissionRaw": 1002616}, "497": {"acRate": 40.01594493165069, "difficulty": "Medium", "likes": 473, "dislikes": 669, "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": 41158, "totalSubmissionRaw": 102854}, "498": {"acRate": 60.41079147413922, "difficulty": "Medium", "likes": 3416, "dislikes": 684, "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": 303972, "totalSubmissionRaw": 503175}, "499": {"acRate": 48.856384217636375, "difficulty": "Hard", "likes": 479, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31464, "totalSubmissionRaw": 64401}, "500": {"acRate": 70.7834448366949, "difficulty": "Easy", "likes": 1588, "dislikes": 1130, "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": 229378, "totalSubmissionRaw": 324056}, "501": {"acRate": 56.17522530585703, "difficulty": "Easy", "likes": 3870, "dislikes": 781, "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": 307547, "totalSubmissionRaw": 547478}, "502": {"acRate": 49.53446445852715, "difficulty": "Hard", "likes": 3073, "dislikes": 196, "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": 126935, "totalSubmissionRaw": 256259}, "503": {"acRate": 63.95801812419373, "difficulty": "Medium", "likes": 7862, "dislikes": 195, "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": 401586, "totalSubmissionRaw": 627890}, "504": {"acRate": 50.122805831587016, "difficulty": "Easy", "likes": 791, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 133464, "totalSubmissionRaw": 266274}, "505": {"acRate": 53.43520915791249, "difficulty": "Medium", "likes": 1320, "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": 107735, "totalSubmissionRaw": 201618}, "506": {"acRate": 71.65126493367339, "difficulty": "Easy", "likes": 1885, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290215, "totalSubmissionRaw": 405038}, "507": {"acRate": 40.701349306781104, "difficulty": "Easy", "likes": 1067, "dislikes": 1220, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190727, "totalSubmissionRaw": 468606}, "508": {"acRate": 66.49315272957946, "difficulty": "Medium", "likes": 2234, "dislikes": 315, "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": 142556, "totalSubmissionRaw": 214392}, "509": {"acRate": 71.17295385486042, "difficulty": "Easy", "likes": 8076, "dislikes": 356, "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": 1808475, "totalSubmissionRaw": 2540957}, "510": {"acRate": 60.9056163762389, "difficulty": "Medium", "likes": 860, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65814, "totalSubmissionRaw": 108059}, "511": {"acRate": 74.70662252728559, "difficulty": "Easy", "likes": 841, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "511", "paidOnly": false, "title": "Game Play Analysis I", "titleSlug": "game-play-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276670, "totalSubmissionRaw": 370340}, "512": {"acRate": 52.85930926523823, "difficulty": "Easy", "likes": 265, "dislikes": 43, "categoryTitle": "Database", "frontendQuestionId": "512", "paidOnly": true, "title": "Game Play Analysis II", "titleSlug": "game-play-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86444, "totalSubmissionRaw": 163536}, "513": {"acRate": 71.17989429523219, "difficulty": "Medium", "likes": 3768, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359182, "totalSubmissionRaw": 504612}, "514": {"acRate": 58.96304619638559, "difficulty": "Hard", "likes": 1461, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107048, "totalSubmissionRaw": 181551}, "515": {"acRate": 65.67066442150922, "difficulty": "Medium", "likes": 3592, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "515", "paidOnly": false, "title": "Find Largest Value in Each Tree Row", "titleSlug": "find-largest-value-in-each-tree-row", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343977, "totalSubmissionRaw": 523792}, "516": {"acRate": 62.681348361826736, "difficulty": "Medium", "likes": 9456, "dislikes": 322, "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": 489211, "totalSubmissionRaw": 780473}, "517": {"acRate": 41.27499405319938, "difficulty": "Hard", "likes": 763, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29498, "totalSubmissionRaw": 71467}, "518": {"acRate": 64.0105821627295, "difficulty": "Medium", "likes": 9262, "dislikes": 165, "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": 623280, "totalSubmissionRaw": 973715}, "519": {"acRate": 42.030371642723296, "difficulty": "Medium", "likes": 430, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21533, "totalSubmissionRaw": 51232}, "520": {"acRate": 56.430867119948616, "difficulty": "Easy", "likes": 3386, "dislikes": 459, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433156, "totalSubmissionRaw": 767587}, "521": {"acRate": 60.76861102159201, "difficulty": "Easy", "likes": 27, "dislikes": 79, "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": 113139, "totalSubmissionRaw": 186180}, "522": {"acRate": 41.543532170785234, "difficulty": "Medium", "likes": 502, "dislikes": 1291, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52435, "totalSubmissionRaw": 126217}, "523": {"acRate": 28.975185508552602, "difficulty": "Medium", "likes": 5519, "dislikes": 551, "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": 462291, "totalSubmissionRaw": 1595476}, "524": {"acRate": 51.206237517690155, "difficulty": "Medium", "likes": 1784, "dislikes": 358, "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": 154862, "totalSubmissionRaw": 302428}, "525": {"acRate": 48.928557568335584, "difficulty": "Medium", "likes": 7865, "dislikes": 371, "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": 453875, "totalSubmissionRaw": 927628}, "526": {"acRate": 64.21676464312779, "difficulty": "Medium", "likes": 3186, "dislikes": 368, "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": 174563, "totalSubmissionRaw": 271834}, "527": {"acRate": 61.04278731334956, "difficulty": "Hard", "likes": 386, "dislikes": 290, "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": 27349, "totalSubmissionRaw": 44803}, "528": {"acRate": 46.90956083420795, "difficulty": "Medium", "likes": 1866, "dislikes": 806, "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": 459910, "totalSubmissionRaw": 980415}, "529": {"acRate": 66.74325438906563, "difficulty": "Medium", "likes": 1945, "dislikes": 1062, "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": 158603, "totalSubmissionRaw": 237633}, "530": {"acRate": 58.36140745614102, "difficulty": "Easy", "likes": 4347, "dislikes": 222, "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": 382327, "totalSubmissionRaw": 655104}, "531": {"acRate": 62.2794192156806, "difficulty": "Medium", "likes": 430, "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": 43022, "totalSubmissionRaw": 69079}, "532": {"acRate": 42.88604752035024, "difficulty": "Medium", "likes": 3834, "dislikes": 2248, "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": 339133, "totalSubmissionRaw": 790777}, "533": {"acRate": 48.5869922860381, "difficulty": "Medium", "likes": 86, "dislikes": 772, "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": 13290, "totalSubmissionRaw": 27353}, "534": {"acRate": 80.83015034968734, "difficulty": "Medium", "likes": 395, "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": 76395, "totalSubmissionRaw": 94513}, "535": {"acRate": 86.40212783642257, "difficulty": "Medium", "likes": 1996, "dislikes": 3776, "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": 259876, "totalSubmissionRaw": 300775}, "536": {"acRate": 56.968168886826774, "difficulty": "Medium", "likes": 1058, "dislikes": 164, "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": 93315, "totalSubmissionRaw": 163802}, "537": {"acRate": 71.83551435568442, "difficulty": "Medium", "likes": 705, "dislikes": 1248, "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": 95626, "totalSubmissionRaw": 133118}, "538": {"acRate": 69.08261886751802, "difficulty": "Medium", "likes": 5156, "dislikes": 172, "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": 294989, "totalSubmissionRaw": 427009}, "539": {"acRate": 56.85749114494687, "difficulty": "Medium", "likes": 1850, "dislikes": 261, "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": 148321, "totalSubmissionRaw": 260866}, "540": {"acRate": 59.08007021837333, "difficulty": "Medium", "likes": 11046, "dislikes": 188, "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": 649879, "totalSubmissionRaw": 1099997}, "541": {"acRate": 50.8111368224115, "difficulty": "Easy", "likes": 1963, "dislikes": 3778, "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": 247686, "totalSubmissionRaw": 487464}, "542": {"acRate": 48.593419286978964, "difficulty": "Medium", "likes": 9360, "dislikes": 412, "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": 564551, "totalSubmissionRaw": 1161786}, "543": {"acRate": 60.566323521366414, "difficulty": "Easy", "likes": 13692, "dislikes": 994, "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": 1516692, "totalSubmissionRaw": 2504184}, "544": {"acRate": 77.1618120212978, "difficulty": "Medium", "likes": 390, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27100, "totalSubmissionRaw": 35121}, "545": {"acRate": 45.496694369380855, "difficulty": "Medium", "likes": 1317, "dislikes": 2179, "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": 133849, "totalSubmissionRaw": 294195}, "546": {"acRate": 47.7949554182738, "difficulty": "Hard", "likes": 2249, "dislikes": 124, "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": 45724, "totalSubmissionRaw": 95667}, "547": {"acRate": 66.32446943851615, "difficulty": "Medium", "likes": 9591, "dislikes": 357, "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": 894086, "totalSubmissionRaw": 1348050}, "548": {"acRate": 50.085914253384175, "difficulty": "Hard", "likes": 414, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "548", "paidOnly": true, "title": "Split Array with Equal Sum", "titleSlug": "split-array-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23902, "totalSubmissionRaw": 47722}, "549": {"acRate": 49.48340092859371, "difficulty": "Medium", "likes": 1151, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "549", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence II", "titleSlug": "binary-tree-longest-consecutive-sequence-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53928, "totalSubmissionRaw": 108982}, "550": {"acRate": 36.43915006114668, "difficulty": "Medium", "likes": 841, "dislikes": 185, "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": 162091, "totalSubmissionRaw": 444826}, "551": {"acRate": 49.09024076456534, "difficulty": "Easy", "likes": 757, "dislikes": 48, "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": 219022, "totalSubmissionRaw": 446162}, "552": {"acRate": 55.00762130407184, "difficulty": "Hard", "likes": 2251, "dislikes": 285, "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": 136052, "totalSubmissionRaw": 247333}, "553": {"acRate": 60.79652273308367, "difficulty": "Medium", "likes": 371, "dislikes": 1595, "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": 40423, "totalSubmissionRaw": 66489}, "554": {"acRate": 54.914394419784394, "difficulty": "Medium", "likes": 2505, "dislikes": 167, "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": 139426, "totalSubmissionRaw": 253897}, "555": {"acRate": 43.43563785480874, "difficulty": "Medium", "likes": 75, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6779, "totalSubmissionRaw": 15607}, "556": {"acRate": 34.056090358973, "difficulty": "Medium", "likes": 3640, "dislikes": 461, "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": 154317, "totalSubmissionRaw": 453126}, "557": {"acRate": 83.10211591199169, "difficulty": "Easy", "likes": 5882, "dislikes": 248, "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": 906974, "totalSubmissionRaw": 1091397}, "558": {"acRate": 49.67898080607752, "difficulty": "Medium", "likes": 188, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14779, "totalSubmissionRaw": 29749}, "559": {"acRate": 72.19838712548733, "difficulty": "Easy", "likes": 2752, "dislikes": 87, "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": 283891, "totalSubmissionRaw": 393210}, "560": {"acRate": 43.67040411914877, "difficulty": "Medium", "likes": 21314, "dislikes": 650, "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": 1255932, "totalSubmissionRaw": 2875933}, "561": {"acRate": 78.9090217214802, "difficulty": "Easy", "likes": 2031, "dislikes": 257, "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": 481087, "totalSubmissionRaw": 609673}, "562": {"acRate": 50.40267086348701, "difficulty": "Medium", "likes": 888, "dislikes": 116, "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": 76542, "totalSubmissionRaw": 151861}, "563": {"acRate": 61.96079798701789, "difficulty": "Easy", "likes": 2224, "dislikes": 2176, "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": 213248, "totalSubmissionRaw": 344166}, "564": {"acRate": 22.424639898953096, "difficulty": "Hard", "likes": 763, "dislikes": 1442, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46160, "totalSubmissionRaw": 205838}, "565": {"acRate": 56.33906761154221, "difficulty": "Medium", "likes": 2197, "dislikes": 152, "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": 130541, "totalSubmissionRaw": 231706}, "566": {"acRate": 63.12423304700422, "difficulty": "Easy", "likes": 3480, "dislikes": 407, "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": 378604, "totalSubmissionRaw": 599776}, "567": {"acRate": 44.42743306723537, "difficulty": "Medium", "likes": 11200, "dislikes": 404, "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": 863286, "totalSubmissionRaw": 1943138}, "568": {"acRate": 45.67664410583083, "difficulty": "Hard", "likes": 566, "dislikes": 112, "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": 37860, "totalSubmissionRaw": 82887}, "569": {"acRate": 65.92931894500049, "difficulty": "Hard", "likes": 323, "dislikes": 151, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40445, "totalSubmissionRaw": 61346}, "570": {"acRate": 50.09981902248446, "difficulty": "Medium", "likes": 1052, "dislikes": 119, "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": 338285, "totalSubmissionRaw": 675222}, "571": {"acRate": 42.454314235728255, "difficulty": "Hard", "likes": 307, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28877, "totalSubmissionRaw": 68019}, "572": {"acRate": 48.03799997090183, "difficulty": "Easy", "likes": 8134, "dislikes": 505, "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": 858457, "totalSubmissionRaw": 1787041}, "573": {"acRate": 57.15601258537334, "difficulty": "Medium", "likes": 411, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "573", "paidOnly": true, "title": "Squirrel Simulation", "titleSlug": "squirrel-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 22344, "totalSubmissionRaw": 39093}, "574": {"acRate": 60.78274233238735, "difficulty": "Medium", "likes": 172, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64468, "totalSubmissionRaw": 106063}, "575": {"acRate": 67.80486064023411, "difficulty": "Easy", "likes": 1518, "dislikes": 1357, "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": 284994, "totalSubmissionRaw": 420315}, "576": {"acRate": 48.06451687787711, "difficulty": "Medium", "likes": 3862, "dislikes": 290, "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": 207048, "totalSubmissionRaw": 430771}, "577": {"acRate": 75.2316167264836, "difficulty": "Easy", "likes": 873, "dislikes": 212, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360538, "totalSubmissionRaw": 479238}, "578": {"acRate": 40.280245430546465, "difficulty": "Medium", "likes": 127, "dislikes": 913, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55997, "totalSubmissionRaw": 139018}, "579": {"acRate": 46.980765364251724, "difficulty": "Hard", "likes": 237, "dislikes": 402, "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": 35050, "totalSubmissionRaw": 74605}, "580": {"acRate": 58.991456736035055, "difficulty": "Medium", "likes": 243, "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": 67323, "totalSubmissionRaw": 114122}, "581": {"acRate": 36.88729172740116, "difficulty": "Medium", "likes": 7715, "dislikes": 259, "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": 328982, "totalSubmissionRaw": 891858}, "582": {"acRate": 69.42968127813806, "difficulty": "Medium", "likes": 1105, "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": 85436, "totalSubmissionRaw": 123054}, "583": {"acRate": 61.71668175584, "difficulty": "Medium", "likes": 5701, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "583", "paidOnly": false, "title": "Delete Operation for Two Strings", "titleSlug": "delete-operation-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251543, "totalSubmissionRaw": 407577}, "584": {"acRate": 69.93045498979991, "difficulty": "Easy", "likes": 1976, "dislikes": 355, "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": 864867, "totalSubmissionRaw": 1236753}, "585": {"acRate": 47.767816162296135, "difficulty": "Medium", "likes": 528, "dislikes": 468, "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": 109275, "totalSubmissionRaw": 228765}, "586": {"acRate": 64.73241752082997, "difficulty": "Easy", "likes": 976, "dislikes": 72, "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": 259878, "totalSubmissionRaw": 401465}, "587": {"acRate": 51.954549537411296, "difficulty": "Hard", "likes": 1459, "dislikes": 643, "categoryTitle": "Algorithms", "frontendQuestionId": "587", "paidOnly": false, "title": "Erect the Fence", "titleSlug": "erect-the-fence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57841, "totalSubmissionRaw": 111330}, "588": {"acRate": 48.09267515187914, "difficulty": "Hard", "likes": 1477, "dislikes": 166, "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": 104099, "totalSubmissionRaw": 216455}, "589": {"acRate": 75.52990352563538, "difficulty": "Easy", "likes": 3122, "dislikes": 200, "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": 428245, "totalSubmissionRaw": 566985}, "590": {"acRate": 77.9279265600374, "difficulty": "Easy", "likes": 2324, "dislikes": 98, "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": 256619, "totalSubmissionRaw": 329303}, "591": {"acRate": 38.27578367728409, "difficulty": "Hard", "likes": 167, "dislikes": 644, "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": 15153, "totalSubmissionRaw": 39589}, "592": {"acRate": 53.315833714294136, "difficulty": "Medium", "likes": 392, "dislikes": 505, "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": 36154, "totalSubmissionRaw": 67811}, "593": {"acRate": 44.02648942127432, "difficulty": "Medium", "likes": 1038, "dislikes": 907, "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": 108498, "totalSubmissionRaw": 246438}, "594": {"acRate": 54.73088500903071, "difficulty": "Easy", "likes": 2131, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "594", "paidOnly": false, "title": "Longest Harmonious Subsequence", "titleSlug": "longest-harmonious-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159087, "totalSubmissionRaw": 290673}, "595": {"acRate": 68.13292468661005, "difficulty": "Easy", "likes": 2635, "dislikes": 1309, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1174203, "totalSubmissionRaw": 1723402}, "596": {"acRate": 55.21374420653979, "difficulty": "Easy", "likes": 1015, "dislikes": 1075, "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": 410400, "totalSubmissionRaw": 743294}, "597": {"acRate": 41.899223727776075, "difficulty": "Easy", "likes": 304, "dislikes": 764, "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": 75295, "totalSubmissionRaw": 179705}, "598": {"acRate": 56.14263218825957, "difficulty": "Easy", "likes": 931, "dislikes": 966, "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": 102325, "totalSubmissionRaw": 182259}, "599": {"acRate": 55.592987845373244, "difficulty": "Easy", "likes": 1934, "dislikes": 392, "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": 230200, "totalSubmissionRaw": 414081}, "600": {"acRate": 39.84230290393433, "difficulty": "Hard", "likes": 1512, "dislikes": 133, "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": 39363, "totalSubmissionRaw": 98797}, "601": {"acRate": 48.62502563026613, "difficulty": "Hard", "likes": 665, "dislikes": 563, "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": 101973, "totalSubmissionRaw": 209713}, "602": {"acRate": 57.360875798253616, "difficulty": "Medium", "likes": 611, "dislikes": 115, "categoryTitle": "Database", "frontendQuestionId": "602", "paidOnly": false, "title": "Friend Requests II: Who Has the Most Friends", "titleSlug": "friend-requests-ii-who-has-the-most-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132038, "totalSubmissionRaw": 230189}, "603": {"acRate": 66.0196322200273, "difficulty": "Easy", "likes": 640, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "603", "paidOnly": true, "title": "Consecutive Available Seats", "titleSlug": "consecutive-available-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86558, "totalSubmissionRaw": 131107}, "604": {"acRate": 39.782084636131465, "difficulty": "Easy", "likes": 437, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33335, "totalSubmissionRaw": 83794}, "605": {"acRate": 29.12223975870068, "difficulty": "Easy", "likes": 6454, "dislikes": 1152, "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": 788632, "totalSubmissionRaw": 2708005}, "606": {"acRate": 69.26756326813187, "difficulty": "Medium", "likes": 50, "dislikes": 24, "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": 319168, "totalSubmissionRaw": 460776}, "607": {"acRate": 65.73527651699979, "difficulty": "Easy", "likes": 1154, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214203, "totalSubmissionRaw": 325857}, "608": {"acRate": 72.31652816587328, "difficulty": "Medium", "likes": 1221, "dislikes": 127, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158904, "totalSubmissionRaw": 219734}, "609": {"acRate": 67.64323032756192, "difficulty": "Medium", "likes": 1504, "dislikes": 1648, "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": 151740, "totalSubmissionRaw": 224324}, "610": {"acRate": 71.58639010276845, "difficulty": "Easy", "likes": 564, "dislikes": 157, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178391, "totalSubmissionRaw": 249198}, "611": {"acRate": 51.190049662769134, "difficulty": "Medium", "likes": 3789, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "611", "paidOnly": false, "title": "Valid Triangle Number", "titleSlug": "valid-triangle-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195740, "totalSubmissionRaw": 382379}, "612": {"acRate": 61.35567334471297, "difficulty": "Medium", "likes": 217, "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": 40977, "totalSubmissionRaw": 66786}, "613": {"acRate": 80.1713339894426, "difficulty": "Easy", "likes": 328, "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": 71686, "totalSubmissionRaw": 89416}, "614": {"acRate": 38.658802970729575, "difficulty": "Medium", "likes": 158, "dislikes": 743, "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": 53094, "totalSubmissionRaw": 137340}, "615": {"acRate": 56.057916428692714, "difficulty": "Hard", "likes": 236, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "615", "paidOnly": true, "title": "Average Salary: Departments VS Company", "titleSlug": "average-salary-departments-vs-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36316, "totalSubmissionRaw": 64783}, "616": {"acRate": 49.798339524904385, "difficulty": "Medium", "likes": 1068, "dislikes": 191, "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": 90751, "totalSubmissionRaw": 182237}, "617": {"acRate": 78.96098789300625, "difficulty": "Easy", "likes": 8741, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "617", "paidOnly": false, "title": "Merge Two Binary Trees", "titleSlug": "merge-two-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 771086, "totalSubmissionRaw": 976539}, "618": {"acRate": 63.45834541285612, "difficulty": "Hard", "likes": 185, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24078, "totalSubmissionRaw": 37943}, "619": {"acRate": 63.13278658924821, "difficulty": "Easy", "likes": 590, "dislikes": 179, "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": 199297, "totalSubmissionRaw": 315681}, "620": {"acRate": 73.71894107642902, "difficulty": "Easy", "likes": 1094, "dislikes": 541, "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": 473337, "totalSubmissionRaw": 642084}, "621": {"acRate": 59.976693154300406, "difficulty": "Medium", "likes": 10371, "dislikes": 2057, "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": 633558, "totalSubmissionRaw": 1056341}, "622": {"acRate": 51.47278311102593, "difficulty": "Medium", "likes": 3505, "dislikes": 287, "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": 316938, "totalSubmissionRaw": 615739}, "623": {"acRate": 64.02677639831651, "difficulty": "Medium", "likes": 3531, "dislikes": 264, "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": 273071, "totalSubmissionRaw": 426495}, "624": {"acRate": 42.40842184673679, "difficulty": "Medium", "likes": 761, "dislikes": 72, "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": 49469, "totalSubmissionRaw": 116649}, "625": {"acRate": 33.60548661005878, "difficulty": "Medium", "likes": 127, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11319, "totalSubmissionRaw": 33682}, "626": {"acRate": 69.79499681592168, "difficulty": "Medium", "likes": 1388, "dislikes": 581, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217005, "totalSubmissionRaw": 310917}, "627": {"acRate": 83.28554685440602, "difficulty": "Easy", "likes": 1713, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 410736, "totalSubmissionRaw": 493166}, "628": {"acRate": 45.232510828101546, "difficulty": "Easy", "likes": 4179, "dislikes": 668, "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": 325727, "totalSubmissionRaw": 720117}, "629": {"acRate": 49.8527297728054, "difficulty": "Hard", "likes": 2642, "dislikes": 320, "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": 127619, "totalSubmissionRaw": 255992}, "630": {"acRate": 40.214974854848805, "difficulty": "Hard", "likes": 3761, "dislikes": 96, "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": 111792, "totalSubmissionRaw": 277986}, "631": {"acRate": 43.82900482647667, "difficulty": "Hard", "likes": 233, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17163, "totalSubmissionRaw": 39159}, "632": {"acRate": 62.63284797977433, "difficulty": "Hard", "likes": 3429, "dislikes": 72, "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": 107021, "totalSubmissionRaw": 170871}, "633": {"acRate": 33.94757899125196, "difficulty": "Medium", "likes": 2521, "dislikes": 545, "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": 201946, "totalSubmissionRaw": 594876}, "634": {"acRate": 41.928587502812995, "difficulty": "Medium", "likes": 218, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "634", "paidOnly": true, "title": "Find the Derangement of An Array", "titleSlug": "find-the-derangement-of-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11179, "totalSubmissionRaw": 26662}, "635": {"acRate": 61.04538722885269, "difficulty": "Medium", "likes": 471, "dislikes": 210, "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": 35037, "totalSubmissionRaw": 57395}, "636": {"acRate": 62.152556966869454, "difficulty": "Medium", "likes": 1937, "dislikes": 2772, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 220879, "totalSubmissionRaw": 355380}, "637": {"acRate": 72.7641119123194, "difficulty": "Easy", "likes": 5236, "dislikes": 325, "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": 513725, "totalSubmissionRaw": 706015}, "638": {"acRate": 52.06587568015444, "difficulty": "Medium", "likes": 1494, "dislikes": 754, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60953, "totalSubmissionRaw": 117069}, "639": {"acRate": 30.714459365355374, "difficulty": "Hard", "likes": 1557, "dislikes": 816, "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": 74540, "totalSubmissionRaw": 242687}, "640": {"acRate": 43.791485972209934, "difficulty": "Medium", "likes": 490, "dislikes": 831, "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": 39584, "totalSubmissionRaw": 90392}, "641": {"acRate": 56.922915624949596, "difficulty": "Medium", "likes": 1163, "dislikes": 75, "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": 70581, "totalSubmissionRaw": 123994}, "642": {"acRate": 48.94488721208129, "difficulty": "Hard", "likes": 2100, "dislikes": 168, "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": "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": 141925, "totalSubmissionRaw": 289969}, "643": {"acRate": 43.37523946360153, "difficulty": "Easy", "likes": 3442, "dislikes": 312, "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": 470940, "totalSubmissionRaw": 1085748}, "644": {"acRate": 36.7244722102542, "difficulty": "Hard", "likes": 616, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20457, "totalSubmissionRaw": 55704}, "645": {"acRate": 44.517023451933404, "difficulty": "Easy", "likes": 4687, "dislikes": 1139, "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": 448910, "totalSubmissionRaw": 1008400}, "646": {"acRate": 59.907696850594135, "difficulty": "Medium", "likes": 4545, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "646", "paidOnly": false, "title": "Maximum Length of Pair Chain", "titleSlug": "maximum-length-of-pair-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235339, "totalSubmissionRaw": 392836}, "647": {"acRate": 70.21494141289544, "difficulty": "Medium", "likes": 10683, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 815140, "totalSubmissionRaw": 1160921}, "648": {"acRate": 62.935057556778986, "difficulty": "Medium", "likes": 2233, "dislikes": 174, "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": 139578, "totalSubmissionRaw": 221781}, "649": {"acRate": 47.605460337111985, "difficulty": "Medium", "likes": 2307, "dislikes": 1781, "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": 147655, "totalSubmissionRaw": 310164}, "650": {"acRate": 54.16062534200887, "difficulty": "Medium", "likes": 3478, "dislikes": 209, "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": 135594, "totalSubmissionRaw": 250357}, "651": {"acRate": 55.79605126950368, "difficulty": "Medium", "likes": 705, "dislikes": 92, "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": 29640, "totalSubmissionRaw": 53126}, "652": {"acRate": 59.45527070168175, "difficulty": "Medium", "likes": 5781, "dislikes": 464, "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": 262781, "totalSubmissionRaw": 441981}, "653": {"acRate": 61.25716089216259, "difficulty": "Easy", "likes": 6673, "dislikes": 265, "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": 539567, "totalSubmissionRaw": 880824}, "654": {"acRate": 85.38518341929145, "difficulty": "Medium", "likes": 5184, "dislikes": 340, "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": 293696, "totalSubmissionRaw": 343966}, "655": {"acRate": 63.83449732313221, "difficulty": "Medium", "likes": 479, "dislikes": 450, "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": 68917, "totalSubmissionRaw": 107962}, "656": {"acRate": 32.116937312891224, "difficulty": "Hard", "likes": 246, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "656", "paidOnly": true, "title": "Coin Path", "titleSlug": "coin-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14161, "totalSubmissionRaw": 44092}, "657": {"acRate": 75.75592059243806, "difficulty": "Easy", "likes": 2410, "dislikes": 744, "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": 429955, "totalSubmissionRaw": 567553}, "658": {"acRate": 47.46742472347133, "difficulty": "Medium", "likes": 8099, "dislikes": 678, "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": 548691, "totalSubmissionRaw": 1155929}, "659": {"acRate": 51.07665129060752, "difficulty": "Medium", "likes": 4401, "dislikes": 799, "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": 130105, "totalSubmissionRaw": 254725}, "660": {"acRate": 57.395532756225286, "difficulty": "Hard", "likes": 162, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10741, "totalSubmissionRaw": 18714}, "661": {"acRate": 67.33893670886076, "difficulty": "Easy", "likes": 1116, "dislikes": 2899, "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": 166243, "totalSubmissionRaw": 246875}, "662": {"acRate": 43.001443001443, "difficulty": "Medium", "likes": 8628, "dislikes": 1191, "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": 376671, "totalSubmissionRaw": 875950}, "663": {"acRate": 41.53305807281892, "difficulty": "Medium", "likes": 482, "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": 30982, "totalSubmissionRaw": 74596}, "664": {"acRate": 54.95607504466945, "difficulty": "Hard", "likes": 2194, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "664", "paidOnly": false, "title": "Strange Printer", "titleSlug": "strange-printer", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73817, "totalSubmissionRaw": 134320}, "665": {"acRate": 24.718784597311938, "difficulty": "Medium", "likes": 5691, "dislikes": 778, "categoryTitle": "Algorithms", "frontendQuestionId": "665", "paidOnly": false, "title": "Non-decreasing Array", "titleSlug": "non-decreasing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263238, "totalSubmissionRaw": 1064931}, "666": {"acRate": 61.24771748187282, "difficulty": "Medium", "likes": 397, "dislikes": 507, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34548, "totalSubmissionRaw": 56407}, "667": {"acRate": 60.187099730638984, "difficulty": "Medium", "likes": 793, "dislikes": 1051, "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": 53850, "totalSubmissionRaw": 89471}, "668": {"acRate": 51.71457591049059, "difficulty": "Hard", "likes": 2131, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "668", "paidOnly": false, "title": "Kth Smallest Number in Multiplication Table", "titleSlug": "kth-smallest-number-in-multiplication-table", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64154, "totalSubmissionRaw": 124054}, "669": {"acRate": 66.26380406780883, "difficulty": "Medium", "likes": 5808, "dislikes": 255, "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": 294259, "totalSubmissionRaw": 444072}, "670": {"acRate": 48.78897839285056, "difficulty": "Medium", "likes": 3365, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "670", "paidOnly": false, "title": "Maximum Swap", "titleSlug": "maximum-swap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251293, "totalSubmissionRaw": 515058}, "671": {"acRate": 44.55633796309131, "difficulty": "Easy", "likes": 1832, "dislikes": 1869, "categoryTitle": "Algorithms", "frontendQuestionId": "671", "paidOnly": false, "title": "Second Minimum Node In a Binary Tree", "titleSlug": "second-minimum-node-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 192863, "totalSubmissionRaw": 432852}, "672": {"acRate": 50.13021688223579, "difficulty": "Medium", "likes": 156, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22906, "totalSubmissionRaw": 45693}, "673": {"acRate": 48.06686865175997, "difficulty": "Medium", "likes": 6698, "dislikes": 266, "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": 229564, "totalSubmissionRaw": 477593}, "674": {"acRate": 50.278221575170875, "difficulty": "Easy", "likes": 2335, "dislikes": 179, "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": 265919, "totalSubmissionRaw": 528895}, "675": {"acRate": 34.383803609761465, "difficulty": "Hard", "likes": 1218, "dislikes": 670, "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": 68715, "totalSubmissionRaw": 199847}, "676": {"acRate": 57.46241542184533, "difficulty": "Medium", "likes": 1392, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83821, "totalSubmissionRaw": 145871}, "677": {"acRate": 56.713050018804054, "difficulty": "Medium", "likes": 1634, "dislikes": 154, "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": 116116, "totalSubmissionRaw": 204743}, "678": {"acRate": 37.99904506555992, "difficulty": "Medium", "likes": 6054, "dislikes": 184, "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": 372455, "totalSubmissionRaw": 980171}, "679": {"acRate": 49.37094308413323, "difficulty": "Hard", "likes": 1463, "dislikes": 249, "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": 78798, "totalSubmissionRaw": 159604}, "680": {"acRate": 40.80272113290472, "difficulty": "Easy", "likes": 8150, "dislikes": 433, "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": 749015, "totalSubmissionRaw": 1835694}, "681": {"acRate": 46.67064449385726, "difficulty": "Medium", "likes": 726, "dislikes": 1063, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108723, "totalSubmissionRaw": 232958}, "682": {"acRate": 76.38895163597796, "difficulty": "Easy", "likes": 2795, "dislikes": 1897, "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": 355075, "totalSubmissionRaw": 464826}, "683": {"acRate": 37.084398976982094, "difficulty": "Hard", "likes": 796, "dislikes": 692, "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": true, "hasVideoSolution": false, "totalAcceptedRaw": 61190, "totalSubmissionRaw": 165002}, "684": {"acRate": 62.95589264307364, "difficulty": "Medium", "likes": 6122, "dislikes": 395, "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": 360785, "totalSubmissionRaw": 573077}, "685": {"acRate": 34.48252257714366, "difficulty": "Hard", "likes": 2313, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70524, "totalSubmissionRaw": 204521}, "686": {"acRate": 35.05072986217778, "difficulty": "Medium", "likes": 2507, "dislikes": 978, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167723, "totalSubmissionRaw": 478515}, "687": {"acRate": 41.577840080542124, "difficulty": "Medium", "likes": 4218, "dislikes": 672, "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": 184189, "totalSubmissionRaw": 442998}, "688": {"acRate": 56.196943972835314, "difficulty": "Medium", "likes": 3822, "dislikes": 469, "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": 155901, "totalSubmissionRaw": 277419}, "689": {"acRate": 50.05272339096022, "difficulty": "Hard", "likes": 1962, "dislikes": 115, "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": 76897, "totalSubmissionRaw": 153632}, "690": {"acRate": 66.95159935053037, "difficulty": "Medium", "likes": 2083, "dislikes": 1335, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211945, "totalSubmissionRaw": 316565}, "691": {"acRate": 48.74304276758188, "difficulty": "Hard", "likes": 1206, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70674, "totalSubmissionRaw": 144993}, "692": {"acRate": 58.080506068230456, "difficulty": "Medium", "likes": 7613, "dislikes": 344, "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": 617728, "totalSubmissionRaw": 1063572}, "693": {"acRate": 62.52265397734138, "difficulty": "Easy", "likes": 1350, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "693", "paidOnly": false, "title": "Binary Number with Alternating Bits", "titleSlug": "binary-number-with-alternating-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134545, "totalSubmissionRaw": 215194}, "694": {"acRate": 61.32130918708445, "difficulty": "Medium", "likes": 2212, "dislikes": 139, "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": 166935, "totalSubmissionRaw": 272230}, "695": {"acRate": 72.03246211358424, "difficulty": "Medium", "likes": 9884, "dislikes": 200, "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": 869209, "totalSubmissionRaw": 1206692}, "696": {"acRate": 65.56902051833815, "difficulty": "Easy", "likes": 3944, "dislikes": 859, "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": 208419, "totalSubmissionRaw": 317862}, "697": {"acRate": 56.596144011725066, "difficulty": "Easy", "likes": 3012, "dislikes": 1728, "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": 214702, "totalSubmissionRaw": 379358}, "698": {"acRate": 38.3199087594099, "difficulty": "Medium", "likes": 7072, "dislikes": 503, "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": 269127, "totalSubmissionRaw": 702318}, "699": {"acRate": 45.02822770347469, "difficulty": "Hard", "likes": 626, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "699", "paidOnly": false, "title": "Falling Squares", "titleSlug": "falling-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26799, "totalSubmissionRaw": 59516}, "700": {"acRate": 79.8455862680254, "difficulty": "Easy", "likes": 5880, "dislikes": 191, "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": 877386, "totalSubmissionRaw": 1098856}, "701": {"acRate": 73.75719013884166, "difficulty": "Medium", "likes": 5766, "dislikes": 172, "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": 531493, "totalSubmissionRaw": 720599}, "702": {"acRate": 72.14019961022855, "difficulty": "Medium", "likes": 907, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97724, "totalSubmissionRaw": 135464}, "703": {"acRate": 56.855127892434396, "difficulty": "Easy", "likes": 5410, "dislikes": 3471, "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": 547796, "totalSubmissionRaw": 963498}, "704": {"acRate": 57.65660173278363, "difficulty": "Easy", "likes": 11687, "dislikes": 246, "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": 2428582, "totalSubmissionRaw": 4212156}, "705": {"acRate": 66.8114721966956, "difficulty": "Easy", "likes": 3759, "dislikes": 307, "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": 415864, "totalSubmissionRaw": 622444}, "706": {"acRate": 65.58236191618137, "difficulty": "Easy", "likes": 5080, "dislikes": 462, "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": 584148, "totalSubmissionRaw": 890709}, "707": {"acRate": 28.228271425981426, "difficulty": "Medium", "likes": 2620, "dislikes": 1609, "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": 331638, "totalSubmissionRaw": 1174841}, "708": {"acRate": 36.251561169606305, "difficulty": "Medium", "likes": 1208, "dislikes": 771, "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": 173275, "totalSubmissionRaw": 477980}, "709": {"acRate": 83.40331908072257, "difficulty": "Easy", "likes": 1827, "dislikes": 2768, "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": 522370, "totalSubmissionRaw": 626318}, "710": {"acRate": 33.42437827980793, "difficulty": "Hard", "likes": 854, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "710", "paidOnly": false, "title": "Random Pick with Blacklist", "titleSlug": "random-pick-with-blacklist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41974, "totalSubmissionRaw": 125579}, "711": {"acRate": 53.023012053933016, "difficulty": "Hard", "likes": 259, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "711", "paidOnly": true, "title": "Number of Distinct Islands II", "titleSlug": "number-of-distinct-islands-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11129, "totalSubmissionRaw": 20989}, "712": {"acRate": 65.1067800965687, "difficulty": "Medium", "likes": 3953, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "712", "paidOnly": false, "title": "Minimum ASCII Delete Sum for Two Strings", "titleSlug": "minimum-ascii-delete-sum-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144414, "totalSubmissionRaw": 221811}, "713": {"acRate": 51.39886219974715, "difficulty": "Medium", "likes": 6790, "dislikes": 215, "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": 406565, "totalSubmissionRaw": 791000}, "714": {"acRate": 68.62543199799306, "difficulty": "Medium", "likes": 7074, "dislikes": 209, "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": 366560, "totalSubmissionRaw": 534146}, "715": {"acRate": 43.998271307354244, "difficulty": "Hard", "likes": 1472, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72282, "totalSubmissionRaw": 164285}, "716": {"acRate": 45.047755690071206, "difficulty": "Hard", "likes": 1909, "dislikes": 509, "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": 151964, "totalSubmissionRaw": 337340}, "717": {"acRate": 45.24943814176323, "difficulty": "Easy", "likes": 862, "dislikes": 2092, "categoryTitle": "Algorithms", "frontendQuestionId": "717", "paidOnly": false, "title": "1-bit and 2-bit Characters", "titleSlug": "1-bit-and-2-bit-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134494, "totalSubmissionRaw": 297228}, "718": {"acRate": 50.95507353115868, "difficulty": "Medium", "likes": 6749, "dislikes": 167, "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": 300265, "totalSubmissionRaw": 589274}, "719": {"acRate": 38.08918746645196, "difficulty": "Hard", "likes": 2957, "dislikes": 96, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 90829, "totalSubmissionRaw": 238464}, "720": {"acRate": 52.474242413814466, "difficulty": "Medium", "likes": 1948, "dislikes": 1484, "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": 152487, "totalSubmissionRaw": 290594}, "721": {"acRate": 57.28908442469598, "difficulty": "Medium", "likes": 6636, "dislikes": 1147, "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": 391948, "totalSubmissionRaw": 684158}, "722": {"acRate": 38.694523426876, "difficulty": "Medium", "likes": 708, "dislikes": 1799, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71990, "totalSubmissionRaw": 186047}, "723": {"acRate": 76.8788094756885, "difficulty": "Medium", "likes": 1014, "dislikes": 524, "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": 72273, "totalSubmissionRaw": 94009}, "724": {"acRate": 57.75254264014086, "difficulty": "Easy", "likes": 8267, "dislikes": 840, "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": 1098769, "totalSubmissionRaw": 1902548}, "725": {"acRate": 64.0915833062526, "difficulty": "Medium", "likes": 3907, "dislikes": 312, "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": 199196, "totalSubmissionRaw": 310799}, "726": {"acRate": 52.88898756660746, "difficulty": "Hard", "likes": 1256, "dislikes": 291, "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": 59553, "totalSubmissionRaw": 112600}, "727": {"acRate": 43.482283501926325, "difficulty": "Hard", "likes": 1450, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91645, "totalSubmissionRaw": 210764}, "728": {"acRate": 78.62958614144858, "difficulty": "Easy", "likes": 1773, "dislikes": 372, "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": 244424, "totalSubmissionRaw": 310855}, "729": {"acRate": 56.59481570548029, "difficulty": "Medium", "likes": 4187, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 283350, "totalSubmissionRaw": 500665}, "730": {"acRate": 45.47207118141374, "difficulty": "Hard", "likes": 1914, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36796, "totalSubmissionRaw": 80920}, "731": {"acRate": 55.537675592564625, "difficulty": "Medium", "likes": 1734, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100777, "totalSubmissionRaw": 181457}, "732": {"acRate": 71.60388398646298, "difficulty": "Hard", "likes": 1950, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90555, "totalSubmissionRaw": 126467}, "733": {"acRate": 64.03900615422596, "difficulty": "Easy", "likes": 8306, "dislikes": 856, "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": 907897, "totalSubmissionRaw": 1417723}, "734": {"acRate": 44.29505185106298, "difficulty": "Easy", "likes": 42, "dislikes": 56, "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": 66548, "totalSubmissionRaw": 150238}, "735": {"acRate": 44.46724857790622, "difficulty": "Medium", "likes": 7797, "dislikes": 1036, "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": 511320, "totalSubmissionRaw": 1149884}, "736": {"acRate": 51.82648401826484, "difficulty": "Hard", "likes": 473, "dislikes": 359, "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": 22246, "totalSubmissionRaw": 42924}, "737": {"acRate": 50.0182853927843, "difficulty": "Medium", "likes": 838, "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": 71121, "totalSubmissionRaw": 142190}, "738": {"acRate": 48.092699301703554, "difficulty": "Medium", "likes": 1311, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53582, "totalSubmissionRaw": 111414}, "739": {"acRate": 66.0711276932671, "difficulty": "Medium", "likes": 13047, "dislikes": 315, "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": 984245, "totalSubmissionRaw": 1489679}, "740": {"acRate": 56.50126362986182, "difficulty": "Medium", "likes": 7469, "dislikes": 375, "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": 340493, "totalSubmissionRaw": 602629}, "741": {"acRate": 36.86179920577419, "difficulty": "Hard", "likes": 4227, "dislikes": 158, "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": 80386, "totalSubmissionRaw": 218074}, "742": {"acRate": 46.28272462424016, "difficulty": "Medium", "likes": 857, "dislikes": 177, "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": 45912, "totalSubmissionRaw": 99199}, "743": {"acRate": 53.97140561829309, "difficulty": "Medium", "likes": 7326, "dislikes": 363, "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": 495798, "totalSubmissionRaw": 918635}, "744": {"acRate": 52.18104501644129, "difficulty": "Easy", "likes": 4384, "dislikes": 2190, "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": 483842, "totalSubmissionRaw": 927238}, "745": {"acRate": 41.16132710940525, "difficulty": "Hard", "likes": 2267, "dislikes": 483, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96732, "totalSubmissionRaw": 235007}, "746": {"acRate": 65.76050301995761, "difficulty": "Easy", "likes": 11331, "dislikes": 1753, "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": 1180766, "totalSubmissionRaw": 1795555}, "747": {"acRate": 48.95514629142411, "difficulty": "Easy", "likes": 1190, "dislikes": 900, "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": 246731, "totalSubmissionRaw": 503994}, "748": {"acRate": 60.05391389587187, "difficulty": "Easy", "likes": 541, "dislikes": 1104, "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": 75967, "totalSubmissionRaw": 126498}, "749": {"acRate": 50.93471151128518, "difficulty": "Hard", "likes": 392, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12615, "totalSubmissionRaw": 24767}, "750": {"acRate": 67.71736830971018, "difficulty": "Medium", "likes": 617, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38412, "totalSubmissionRaw": 56724}, "751": {"acRate": 55.44654550467569, "difficulty": "Medium", "likes": 88, "dislikes": 315, "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": 24132, "totalSubmissionRaw": 43523}, "752": {"acRate": 60.2867048611965, "difficulty": "Medium", "likes": 4733, "dislikes": 218, "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": 318734, "totalSubmissionRaw": 528695}, "753": {"acRate": 56.88145378460585, "difficulty": "Hard", "likes": 547, "dislikes": 98, "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": 58721, "totalSubmissionRaw": 103234}, "754": {"acRate": 43.11307272626783, "difficulty": "Medium", "likes": 1795, "dislikes": 807, "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": 54604, "totalSubmissionRaw": 126653}, "755": {"acRate": 46.94424962779767, "difficulty": "Medium", "likes": 298, "dislikes": 762, "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": 38153, "totalSubmissionRaw": 81273}, "756": {"acRate": 52.84196589010435, "difficulty": "Medium", "likes": 529, "dislikes": 478, "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": 33524, "totalSubmissionRaw": 63442}, "757": {"acRate": 44.52953627092553, "difficulty": "Hard", "likes": 704, "dislikes": 82, "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": 23142, "totalSubmissionRaw": 51970}, "758": {"acRate": 51.49130186989442, "difficulty": "Medium", "likes": 268, "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": 18973, "totalSubmissionRaw": 36847}, "759": {"acRate": 72.15959670240353, "difficulty": "Hard", "likes": 1890, "dislikes": 132, "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": 149151, "totalSubmissionRaw": 206696}, "760": {"acRate": 83.63643854806148, "difficulty": "Easy", "likes": 611, "dislikes": 230, "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": 101497, "totalSubmissionRaw": 121355}, "761": {"acRate": 61.15044559512487, "difficulty": "Hard", "likes": 699, "dislikes": 216, "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": 17360, "totalSubmissionRaw": 28389}, "762": {"acRate": 69.51346452065174, "difficulty": "Easy", "likes": 711, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98169, "totalSubmissionRaw": 141223}, "763": {"acRate": 79.87563981605985, "difficulty": "Medium", "likes": 10242, "dislikes": 392, "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": 537599, "totalSubmissionRaw": 673045}, "764": {"acRate": 48.23183197045635, "difficulty": "Medium", "likes": 1449, "dislikes": 229, "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": 58511, "totalSubmissionRaw": 121312}, "765": {"acRate": 57.30966403364316, "difficulty": "Hard", "likes": 2326, "dislikes": 117, "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": 61597, "totalSubmissionRaw": 107481}, "766": {"acRate": 69.03559094078969, "difficulty": "Easy", "likes": 3507, "dislikes": 167, "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": 332619, "totalSubmissionRaw": 481808}, "767": {"acRate": 54.65821970243313, "difficulty": "Medium", "likes": 8441, "dislikes": 249, "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": 394112, "totalSubmissionRaw": 721048}, "768": {"acRate": 53.24746436634431, "difficulty": "Hard", "likes": 1822, "dislikes": 53, "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": 63209, "totalSubmissionRaw": 118708}, "769": {"acRate": 58.35497835497836, "difficulty": "Medium", "likes": 2799, "dislikes": 238, "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": 105818, "totalSubmissionRaw": 181335}, "770": {"acRate": 55.48119821542383, "difficulty": "Hard", "likes": 161, "dislikes": 1407, "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": 10446, "totalSubmissionRaw": 18828}, "771": {"acRate": 88.62563700110938, "difficulty": "Easy", "likes": 5063, "dislikes": 588, "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": 1045732, "totalSubmissionRaw": 1179943}, "772": {"acRate": 50.73600313686577, "difficulty": "Hard", "likes": 1131, "dislikes": 288, "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": 126804, "totalSubmissionRaw": 249930}, "773": {"acRate": 64.81753821950134, "difficulty": "Hard", "likes": 2015, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94760, "totalSubmissionRaw": 146195}, "774": {"acRate": 52.31641329554238, "difficulty": "Hard", "likes": 677, "dislikes": 96, "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": 30456, "totalSubmissionRaw": 58215}, "775": {"acRate": 42.4553849640247, "difficulty": "Medium", "likes": 1819, "dislikes": 374, "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": 74938, "totalSubmissionRaw": 176510}, "776": {"acRate": 82.68064847567432, "difficulty": "Medium", "likes": 1015, "dislikes": 101, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 105417, "totalSubmissionRaw": 127499}, "777": {"acRate": 36.814280413106445, "difficulty": "Medium", "likes": 1213, "dislikes": 928, "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": 76390, "totalSubmissionRaw": 207501}, "778": {"acRate": 60.86301925329649, "difficulty": "Hard", "likes": 3623, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 162103, "totalSubmissionRaw": 266341}, "779": {"acRate": 46.51979844925569, "difficulty": "Medium", "likes": 3756, "dislikes": 392, "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": 202188, "totalSubmissionRaw": 434624}, "780": {"acRate": 33.22273535697739, "difficulty": "Hard", "likes": 1481, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66687, "totalSubmissionRaw": 200727}, "781": {"acRate": 53.18944489614902, "difficulty": "Medium", "likes": 1315, "dislikes": 609, "categoryTitle": "Algorithms", "frontendQuestionId": "781", "paidOnly": false, "title": "Rabbits in Forest", "titleSlug": "rabbits-in-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57568, "totalSubmissionRaw": 108232}, "782": {"acRate": 50.929314468489764, "difficulty": "Hard", "likes": 353, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "782", "paidOnly": false, "title": "Transform to Chessboard", "titleSlug": "transform-to-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17674, "totalSubmissionRaw": 34703}, "783": {"acRate": 59.544899965648355, "difficulty": "Easy", "likes": 3465, "dislikes": 417, "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": 251342, "totalSubmissionRaw": 422105}, "784": {"acRate": 74.25199672081253, "difficulty": "Medium", "likes": 4627, "dislikes": 155, "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": 302516, "totalSubmissionRaw": 407418}, "785": {"acRate": 55.73262783432731, "difficulty": "Medium", "likes": 8146, "dislikes": 379, "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": 559302, "totalSubmissionRaw": 1003545}, "786": {"acRate": 68.03775120310914, "difficulty": "Medium", "likes": 1970, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145479, "totalSubmissionRaw": 213821}, "787": {"acRate": 39.32497105742012, "difficulty": "Medium", "likes": 9790, "dislikes": 407, "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": 563186, "totalSubmissionRaw": 1432138}, "788": {"acRate": 56.42338002577591, "difficulty": "Medium", "likes": 742, "dislikes": 1923, "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": 106823, "totalSubmissionRaw": 189324}, "789": {"acRate": 61.827117302846666, "difficulty": "Medium", "likes": 289, "dislikes": 28, "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": 29690, "totalSubmissionRaw": 48021}, "790": {"acRate": 50.53073886282704, "difficulty": "Medium", "likes": 3390, "dislikes": 1100, "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": 133242, "totalSubmissionRaw": 263686}, "791": {"acRate": 70.7821102275194, "difficulty": "Medium", "likes": 3581, "dislikes": 409, "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": 430443, "totalSubmissionRaw": 608124}, "792": {"acRate": 50.96959232571386, "difficulty": "Medium", "likes": 5471, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "792", "paidOnly": false, "title": "Number of Matching Subsequences", "titleSlug": "number-of-matching-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229959, "totalSubmissionRaw": 451169}, "793": {"acRate": 44.52907433413467, "difficulty": "Hard", "likes": 429, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "793", "paidOnly": false, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18708, "totalSubmissionRaw": 42013}, "794": {"acRate": 34.700060112964756, "difficulty": "Medium", "likes": 546, "dislikes": 1145, "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": 58302, "totalSubmissionRaw": 168017}, "795": {"acRate": 53.195928094473075, "difficulty": "Medium", "likes": 2279, "dislikes": 118, "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": 69867, "totalSubmissionRaw": 131339}, "796": {"acRate": 58.2596555679735, "difficulty": "Easy", "likes": 3551, "dislikes": 158, "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": 315897, "totalSubmissionRaw": 542222}, "797": {"acRate": 82.47751535392513, "difficulty": "Medium", "likes": 7171, "dislikes": 146, "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": 522806, "totalSubmissionRaw": 633877}, "798": {"acRate": 51.196296296296296, "difficulty": "Hard", "likes": 533, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13823, "totalSubmissionRaw": 27000}, "799": {"acRate": 58.145673855821634, "difficulty": "Medium", "likes": 3629, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "799", "paidOnly": false, "title": "Champagne Tower", "titleSlug": "champagne-tower", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153968, "totalSubmissionRaw": 264797}, "800": {"acRate": 67.39723890492161, "difficulty": "Easy", "likes": 108, "dislikes": 683, "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": 17282, "totalSubmissionRaw": 25642}, "801": {"acRate": 39.98050843943101, "difficulty": "Hard", "likes": 2791, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "801", "paidOnly": false, "title": "Minimum Swaps To Make Sequences Increasing", "titleSlug": "minimum-swaps-to-make-sequences-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77124, "totalSubmissionRaw": 192904}, "802": {"acRate": 62.727993655828705, "difficulty": "Medium", "likes": 5642, "dislikes": 448, "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": 247582, "totalSubmissionRaw": 394691}, "803": {"acRate": 34.75855130784708, "difficulty": "Hard", "likes": 1094, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "803", "paidOnly": false, "title": "Bricks Falling When Hit", "titleSlug": "bricks-falling-when-hit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30404, "totalSubmissionRaw": 87472}, "804": {"acRate": 82.86343829415782, "difficulty": "Easy", "likes": 2500, "dislikes": 1532, "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": 353128, "totalSubmissionRaw": 426157}, "805": {"acRate": 25.370926243567755, "difficulty": "Hard", "likes": 1256, "dislikes": 135, "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": 35499, "totalSubmissionRaw": 139920}, "806": {"acRate": 68.41983456906527, "difficulty": "Easy", "likes": 594, "dislikes": 1326, "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": 79822, "totalSubmissionRaw": 116665}, "807": {"acRate": 86.11816027348421, "difficulty": "Medium", "likes": 2548, "dislikes": 524, "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": 164246, "totalSubmissionRaw": 190722}, "808": {"acRate": 53.9438301744238, "difficulty": "Medium", "likes": 973, "dislikes": 2645, "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": 66400, "totalSubmissionRaw": 123091}, "809": {"acRate": 46.12630646169427, "difficulty": "Medium", "likes": 855, "dislikes": 1901, "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": 116599, "totalSubmissionRaw": 252782}, "810": {"acRate": 59.75636523266022, "difficulty": "Hard", "likes": 220, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "810", "paidOnly": false, "title": "Chalkboard XOR Game", "titleSlug": "chalkboard-xor-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10890, "totalSubmissionRaw": 18224}, "811": {"acRate": 76.21900167450761, "difficulty": "Medium", "likes": 1536, "dislikes": 1296, "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": 229407, "totalSubmissionRaw": 300984}, "812": {"acRate": 60.66059385537655, "difficulty": "Easy", "likes": 526, "dislikes": 1585, "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": 51809, "totalSubmissionRaw": 85408}, "813": {"acRate": 53.48087322251152, "difficulty": "Medium", "likes": 2086, "dislikes": 98, "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": 53406, "totalSubmissionRaw": 99860}, "814": {"acRate": 72.23627418787034, "difficulty": "Medium", "likes": 4498, "dislikes": 112, "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": 244181, "totalSubmissionRaw": 338031}, "815": {"acRate": 47.818925768437545, "difficulty": "Hard", "likes": 4225, "dislikes": 118, "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": 202648, "totalSubmissionRaw": 423782}, "816": {"acRate": 56.74237114769003, "difficulty": "Medium", "likes": 317, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29956, "totalSubmissionRaw": 52793}, "817": {"acRate": 56.80093012497033, "difficulty": "Medium", "likes": 1065, "dislikes": 2204, "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": 93311, "totalSubmissionRaw": 164277}, "818": {"acRate": 43.70988031842162, "difficulty": "Hard", "likes": 1889, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87908, "totalSubmissionRaw": 201117}, "819": {"acRate": 44.322025612241994, "difficulty": "Easy", "likes": 1686, "dislikes": 3051, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358109, "totalSubmissionRaw": 807971}, "820": {"acRate": 60.437699880855334, "difficulty": "Medium", "likes": 1746, "dislikes": 651, "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": 96380, "totalSubmissionRaw": 159470}, "821": {"acRate": 71.59151203907034, "difficulty": "Easy", "likes": 3121, "dislikes": 174, "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": 184850, "totalSubmissionRaw": 258201}, "822": {"acRate": 47.469097265576224, "difficulty": "Medium", "likes": 168, "dislikes": 754, "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": 19009, "totalSubmissionRaw": 40045}, "823": {"acRate": 52.91201369194537, "difficulty": "Medium", "likes": 3293, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "823", "paidOnly": false, "title": "Binary Trees With Factors", "titleSlug": "binary-trees-with-factors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149631, "totalSubmissionRaw": 282793}, "824": {"acRate": 68.26870688265944, "difficulty": "Easy", "likes": 900, "dislikes": 1239, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 177926, "totalSubmissionRaw": 260626}, "825": {"acRate": 47.63391991728951, "difficulty": "Medium", "likes": 743, "dislikes": 1209, "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": 88460, "totalSubmissionRaw": 185706}, "826": {"acRate": 46.59048009060486, "difficulty": "Medium", "likes": 1587, "dislikes": 138, "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": 72813, "totalSubmissionRaw": 156283}, "827": {"acRate": 47.39035075959481, "difficulty": "Hard", "likes": 3847, "dislikes": 72, "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": 176747, "totalSubmissionRaw": 372959}, "828": {"acRate": 52.37292078632081, "difficulty": "Hard", "likes": 2136, "dislikes": 249, "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": 72040, "totalSubmissionRaw": 137552}, "829": {"acRate": 41.8079424340592, "difficulty": "Hard", "likes": 1365, "dislikes": 1378, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86338, "totalSubmissionRaw": 206511}, "830": {"acRate": 52.25225717895013, "difficulty": "Easy", "likes": 868, "dislikes": 123, "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": 95549, "totalSubmissionRaw": 182861}, "831": {"acRate": 48.72259102796218, "difficulty": "Medium", "likes": 166, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19376, "totalSubmissionRaw": 39768}, "832": {"acRate": 81.97057024426013, "difficulty": "Easy", "likes": 3421, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "832", "paidOnly": false, "title": "Flipping an Image", "titleSlug": "flipping-an-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431498, "totalSubmissionRaw": 526406}, "833": {"acRate": 52.531445816030896, "difficulty": "Medium", "likes": 1176, "dislikes": 1007, "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": 148135, "totalSubmissionRaw": 281993}, "834": {"acRate": 65.2878611648814, "difficulty": "Hard", "likes": 5533, "dislikes": 133, "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": 155485, "totalSubmissionRaw": 238153}, "835": {"acRate": 63.65438591710494, "difficulty": "Medium", "likes": 1318, "dislikes": 478, "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": 93437, "totalSubmissionRaw": 146788}, "836": {"acRate": 44.82978743088343, "difficulty": "Easy", "likes": 1981, "dislikes": 467, "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": 145370, "totalSubmissionRaw": 324271}, "837": {"acRate": 44.987011142605226, "difficulty": "Medium", "likes": 1967, "dislikes": 1820, "categoryTitle": "Algorithms", "frontendQuestionId": "837", "paidOnly": false, "title": "New 21 Game", "titleSlug": "new-21-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76024, "totalSubmissionRaw": 168991}, "838": {"acRate": 57.15449962013951, "difficulty": "Medium", "likes": 3368, "dislikes": 226, "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": 124131, "totalSubmissionRaw": 217185}, "839": {"acRate": 54.895513228579404, "difficulty": "Hard", "likes": 2322, "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": 119866, "totalSubmissionRaw": 218353}, "840": {"acRate": 38.96245802215428, "difficulty": "Medium", "likes": 326, "dislikes": 1591, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38867, "totalSubmissionRaw": 99755}, "841": {"acRate": 73.06192052980133, "difficulty": "Medium", "likes": 6048, "dislikes": 277, "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": 441292, "totalSubmissionRaw": 603998}, "842": {"acRate": 39.03350502723705, "difficulty": "Medium", "likes": 1124, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39481, "totalSubmissionRaw": 101147}, "843": {"acRate": 39.20275840246161, "difficulty": "Hard", "likes": 1529, "dislikes": 1777, "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": 143713, "totalSubmissionRaw": 366586}, "844": {"acRate": 49.15303408816182, "difficulty": "Easy", "likes": 7481, "dislikes": 350, "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": 823419, "totalSubmissionRaw": 1675215}, "845": {"acRate": 40.41186662113346, "difficulty": "Medium", "likes": 2753, "dislikes": 78, "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": 128987, "totalSubmissionRaw": 319181}, "846": {"acRate": 55.9168125463045, "difficulty": "Medium", "likes": 2538, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "846", "paidOnly": false, "title": "Hand of Straights", "titleSlug": "hand-of-straights", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170410, "totalSubmissionRaw": 304833}, "847": {"acRate": 65.36405099315596, "difficulty": "Hard", "likes": 4272, "dislikes": 166, "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": 123106, "totalSubmissionRaw": 188339}, "848": {"acRate": 44.76783357483687, "difficulty": "Medium", "likes": 1355, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97011, "totalSubmissionRaw": 216697}, "849": {"acRate": 48.14839225424579, "difficulty": "Medium", "likes": 3207, "dislikes": 195, "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": 226465, "totalSubmissionRaw": 470348}, "850": {"acRate": 54.16086835513498, "difficulty": "Hard", "likes": 954, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35028, "totalSubmissionRaw": 64674}, "851": {"acRate": 59.43247503941146, "difficulty": "Medium", "likes": 1269, "dislikes": 806, "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": 46371, "totalSubmissionRaw": 78023}, "852": {"acRate": 68.38186706482318, "difficulty": "Medium", "likes": 7419, "dislikes": 1914, "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": 813390, "totalSubmissionRaw": 1189482}, "853": {"acRate": 51.135503481314736, "difficulty": "Medium", "likes": 3454, "dislikes": 949, "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": 258738, "totalSubmissionRaw": 505981}, "854": {"acRate": 39.87273184391445, "difficulty": "Hard", "likes": 1122, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "854", "paidOnly": false, "title": "K-Similar Strings", "titleSlug": "k-similar-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45992, "totalSubmissionRaw": 115346}, "855": {"acRate": 43.38546850561638, "difficulty": "Medium", "likes": 1322, "dislikes": 476, "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": 61026, "totalSubmissionRaw": 140660}, "856": {"acRate": 64.14861407102413, "difficulty": "Medium", "likes": 5391, "dislikes": 199, "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": 186020, "totalSubmissionRaw": 289983}, "857": {"acRate": 63.26584311987591, "difficulty": "Hard", "likes": 2864, "dislikes": 389, "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": 137049, "totalSubmissionRaw": 216624}, "858": {"acRate": 62.56989356627278, "difficulty": "Medium", "likes": 1101, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80010, "totalSubmissionRaw": 127873}, "859": {"acRate": 33.12530004800768, "difficulty": "Easy", "likes": 3161, "dislikes": 1789, "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": 243570, "totalSubmissionRaw": 735299}, "860": {"acRate": 53.43968724383631, "difficulty": "Easy", "likes": 2315, "dislikes": 162, "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": 186448, "totalSubmissionRaw": 348896}, "861": {"acRate": 80.42879312671495, "difficulty": "Medium", "likes": 2247, "dislikes": 213, "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": 143040, "totalSubmissionRaw": 177847}, "862": {"acRate": 26.012109730697176, "difficulty": "Hard", "likes": 4236, "dislikes": 116, "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": 99411, "totalSubmissionRaw": 382170}, "863": {"acRate": 64.50427036848099, "difficulty": "Medium", "likes": 10872, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 441292, "totalSubmissionRaw": 684129}, "864": {"acRate": 53.588850665463575, "difficulty": "Hard", "likes": 2319, "dislikes": 100, "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": 76017, "totalSubmissionRaw": 141852}, "865": {"acRate": 70.6660134621371, "difficulty": "Medium", "likes": 2622, "dislikes": 372, "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": 138475, "totalSubmissionRaw": 195957}, "866": {"acRate": 25.983519299767377, "difficulty": "Medium", "likes": 432, "dislikes": 825, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32951, "totalSubmissionRaw": 126815}, "867": {"acRate": 71.66728908870232, "difficulty": "Easy", "likes": 3706, "dislikes": 444, "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": 399161, "totalSubmissionRaw": 556964}, "868": {"acRate": 63.462710987967796, "difficulty": "Easy", "likes": 632, "dislikes": 657, "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": 82228, "totalSubmissionRaw": 129569}, "869": {"acRate": 62.6724615214262, "difficulty": "Medium", "likes": 2113, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113199, "totalSubmissionRaw": 180620}, "870": {"acRate": 52.53746073770043, "difficulty": "Medium", "likes": 1601, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67073, "totalSubmissionRaw": 127667}, "871": {"acRate": 40.05965121996461, "difficulty": "Hard", "likes": 4623, "dislikes": 87, "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": 136059, "totalSubmissionRaw": 339641}, "872": {"acRate": 70.07532456023749, "difficulty": "Easy", "likes": 4083, "dislikes": 112, "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": 474456, "totalSubmissionRaw": 677066}, "873": {"acRate": 48.36639881357728, "difficulty": "Medium", "likes": 2013, "dislikes": 72, "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": 63922, "totalSubmissionRaw": 132162}, "874": {"acRate": 40.156042496679945, "difficulty": "Medium", "likes": 202, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41123, "totalSubmissionRaw": 102408}, "875": {"acRate": 48.71949876657439, "difficulty": "Medium", "likes": 10368, "dislikes": 631, "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": 659240, "totalSubmissionRaw": 1353136}, "876": {"acRate": 78.59210678294897, "difficulty": "Easy", "likes": 11500, "dislikes": 364, "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": 1925608, "totalSubmissionRaw": 2450129}, "877": {"acRate": 70.57816089885483, "difficulty": "Medium", "likes": 3200, "dislikes": 2872, "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": 235309, "totalSubmissionRaw": 333402}, "878": {"acRate": 35.376088095522604, "difficulty": "Hard", "likes": 1267, "dislikes": 158, "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": 38486, "totalSubmissionRaw": 108791}, "879": {"acRate": 48.332131957118534, "difficulty": "Hard", "likes": 1823, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "879", "paidOnly": false, "title": "Profitable Schemes", "titleSlug": "profitable-schemes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63028, "totalSubmissionRaw": 130406}, "880": {"acRate": 36.429639680498966, "difficulty": "Medium", "likes": 2498, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97191, "totalSubmissionRaw": 266791}, "881": {"acRate": 59.379897648555136, "difficulty": "Medium", "likes": 6372, "dislikes": 159, "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": 414115, "totalSubmissionRaw": 697400}, "882": {"acRate": 50.364287141844876, "difficulty": "Hard", "likes": 800, "dislikes": 222, "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": 27720, "totalSubmissionRaw": 55039}, "883": {"acRate": 72.67459195975991, "difficulty": "Easy", "likes": 583, "dislikes": 1405, "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": 56059, "totalSubmissionRaw": 77137}, "884": {"acRate": 67.35389399402146, "difficulty": "Easy", "likes": 1328, "dislikes": 166, "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": 139923, "totalSubmissionRaw": 207743}, "885": {"acRate": 74.50414335716637, "difficulty": "Medium", "likes": 917, "dislikes": 863, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 49809, "totalSubmissionRaw": 66854}, "886": {"acRate": 50.612232065337004, "difficulty": "Medium", "likes": 4645, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "886", "paidOnly": false, "title": "Possible Bipartition", "titleSlug": "possible-bipartition", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209271, "totalSubmissionRaw": 413483}, "887": {"acRate": 27.688194856997367, "difficulty": "Hard", "likes": 3586, "dislikes": 185, "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": 71773, "totalSubmissionRaw": 259221}, "888": {"acRate": 61.769684999697695, "difficulty": "Easy", "likes": 2092, "dislikes": 373, "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": 122598, "totalSubmissionRaw": 198476}, "889": {"acRate": 71.41344663904138, "difficulty": "Medium", "likes": 2726, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101852, "totalSubmissionRaw": 142623}, "890": {"acRate": 76.82954001551437, "difficulty": "Medium", "likes": 3896, "dislikes": 172, "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": 186201, "totalSubmissionRaw": 242356}, "891": {"acRate": 37.83851286259678, "difficulty": "Hard", "likes": 709, "dislikes": 170, "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": 21210, "totalSubmissionRaw": 56054}, "892": {"acRate": 65.99234823730316, "difficulty": "Easy", "likes": 563, "dislikes": 745, "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": 40190, "totalSubmissionRaw": 60901}, "893": {"acRate": 71.72610846012154, "difficulty": "Medium", "likes": 528, "dislikes": 1480, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49453, "totalSubmissionRaw": 68947}, "894": {"acRate": 82.68104107382793, "difficulty": "Medium", "likes": 5024, "dislikes": 348, "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": 182759, "totalSubmissionRaw": 221041}, "895": {"acRate": 66.36660586587702, "difficulty": "Hard", "likes": 4667, "dislikes": 69, "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": 173919, "totalSubmissionRaw": 262058}, "896": {"acRate": 61.164439844525255, "difficulty": "Easy", "likes": 3018, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 430221, "totalSubmissionRaw": 703387}, "897": {"acRate": 78.30071113189639, "difficulty": "Easy", "likes": 4292, "dislikes": 670, "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": 284627, "totalSubmissionRaw": 363505}, "898": {"acRate": 38.79235916252968, "difficulty": "Medium", "likes": 1438, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35945, "totalSubmissionRaw": 92660}, "899": {"acRate": 65.93106049889188, "difficulty": "Hard", "likes": 1741, "dislikes": 612, "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": 69910, "totalSubmissionRaw": 106035}, "900": {"acRate": 59.5356738391846, "difficulty": "Medium", "likes": 739, "dislikes": 192, "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": 73598, "totalSubmissionRaw": 123620}, "901": {"acRate": 65.87395435514736, "difficulty": "Medium", "likes": 6240, "dislikes": 400, "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": 315307, "totalSubmissionRaw": 478651}, "902": {"acRate": 42.42059856466636, "difficulty": "Hard", "likes": 1385, "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": 44450, "totalSubmissionRaw": 104784}, "903": {"acRate": 57.272333357405934, "difficulty": "Hard", "likes": 716, "dislikes": 42, "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": 15861, "totalSubmissionRaw": 27694}, "904": {"acRate": 44.370180843472056, "difficulty": "Medium", "likes": 4599, "dislikes": 338, "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": 407872, "totalSubmissionRaw": 919248}, "905": {"acRate": 76.23476697394332, "difficulty": "Easy", "likes": 5336, "dislikes": 147, "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": 801357, "totalSubmissionRaw": 1051170}, "906": {"acRate": 38.90728212017977, "difficulty": "Hard", "likes": 356, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24326, "totalSubmissionRaw": 62523}, "907": {"acRate": 37.38003025895355, "difficulty": "Medium", "likes": 7977, "dislikes": 609, "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": 255962, "totalSubmissionRaw": 684755}, "908": {"acRate": 70.05662071927838, "difficulty": "Easy", "likes": 702, "dislikes": 2026, "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": 89704, "totalSubmissionRaw": 128045}, "909": {"acRate": 43.76947698430577, "difficulty": "Medium", "likes": 2853, "dislikes": 986, "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": 186521, "totalSubmissionRaw": 426143}, "910": {"acRate": 36.26236141242863, "difficulty": "Medium", "likes": 1641, "dislikes": 456, "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": 54490, "totalSubmissionRaw": 150266}, "911": {"acRate": 51.92596121609938, "difficulty": "Medium", "likes": 993, "dislikes": 656, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58856, "totalSubmissionRaw": 113346}, "912": {"acRate": 56.35359881093607, "difficulty": "Medium", "likes": 5974, "dislikes": 742, "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": 610425, "totalSubmissionRaw": 1083202}, "913": {"acRate": 33.91322321167129, "difficulty": "Hard", "likes": 905, "dislikes": 158, "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": 19689, "totalSubmissionRaw": 58057}, "914": {"acRate": 29.958118065762502, "difficulty": "Easy", "likes": 1805, "dislikes": 506, "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": 121887, "totalSubmissionRaw": 406857}, "915": {"acRate": 48.78814154176473, "difficulty": "Medium", "likes": 1655, "dislikes": 79, "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": 82712, "totalSubmissionRaw": 169533}, "916": {"acRate": 52.129065179555866, "difficulty": "Medium", "likes": 2701, "dislikes": 231, "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": 114416, "totalSubmissionRaw": 219486}, "917": {"acRate": 64.65451930990021, "difficulty": "Easy", "likes": 2242, "dislikes": 76, "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": 217620, "totalSubmissionRaw": 336589}, "918": {"acRate": 44.95769357732574, "difficulty": "Medium", "likes": 6553, "dislikes": 296, "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": 262851, "totalSubmissionRaw": 584663}, "919": {"acRate": 65.60701956271576, "difficulty": "Medium", "likes": 1097, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54732, "totalSubmissionRaw": 83424}, "920": {"acRate": 60.47312576100191, "difficulty": "Hard", "likes": 2339, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "920", "paidOnly": false, "title": "Number of Music Playlists", "titleSlug": "number-of-music-playlists", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69532, "totalSubmissionRaw": 114980}, "921": {"acRate": 75.13765090100722, "difficulty": "Medium", "likes": 4030, "dislikes": 201, "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": 350162, "totalSubmissionRaw": 466029}, "922": {"acRate": 70.73598747160842, "difficulty": "Easy", "likes": 2590, "dislikes": 94, "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": 254750, "totalSubmissionRaw": 360142}, "923": {"acRate": 45.424162257495595, "difficulty": "Medium", "likes": 2602, "dislikes": 313, "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": 103022, "totalSubmissionRaw": 226800}, "924": {"acRate": 42.05438115347588, "difficulty": "Hard", "likes": 977, "dislikes": 586, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51983, "totalSubmissionRaw": 123609}, "925": {"acRate": 32.31356461982834, "difficulty": "Easy", "likes": 2412, "dislikes": 372, "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": 141631, "totalSubmissionRaw": 438302}, "926": {"acRate": 61.42329109837785, "difficulty": "Medium", "likes": 4393, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "926", "paidOnly": false, "title": "Flip String to Monotone Increasing", "titleSlug": "flip-string-to-monotone-increasing", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190274, "totalSubmissionRaw": 309775}, "927": {"acRate": 39.7893839947812, "difficulty": "Hard", "likes": 827, "dislikes": 121, "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": 29887, "totalSubmissionRaw": 75113}, "928": {"acRate": 43.7248302562207, "difficulty": "Hard", "likes": 660, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22475, "totalSubmissionRaw": 51401}, "929": {"acRate": 67.1888061258468, "difficulty": "Easy", "likes": 2674, "dislikes": 338, "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": 486274, "totalSubmissionRaw": 723743}, "930": {"acRate": 62.46243601445446, "difficulty": "Medium", "likes": 3774, "dislikes": 130, "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": 234042, "totalSubmissionRaw": 374693}, "931": {"acRate": 63.97154766754639, "difficulty": "Medium", "likes": 6257, "dislikes": 158, "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": 433397, "totalSubmissionRaw": 677484}, "932": {"acRate": 65.76608655657928, "difficulty": "Medium", "likes": 1051, "dislikes": 1509, "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": 44327, "totalSubmissionRaw": 67401}, "933": {"acRate": 75.32653844710582, "difficulty": "Easy", "likes": 511, "dislikes": 793, "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": 260958, "totalSubmissionRaw": 346436}, "934": {"acRate": 57.695168333568105, "difficulty": "Medium", "likes": 5337, "dislikes": 205, "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": 204788, "totalSubmissionRaw": 354947}, "935": {"acRate": 60.173027217105336, "difficulty": "Medium", "likes": 3002, "dislikes": 442, "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": 174370, "totalSubmissionRaw": 289781}, "936": {"acRate": 62.47556585735802, "difficulty": "Hard", "likes": 1540, "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": 58489, "totalSubmissionRaw": 93619}, "937": {"acRate": 56.424679586403315, "difficulty": "Medium", "likes": 2083, "dislikes": 4381, "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": 364526, "totalSubmissionRaw": 646040}, "938": {"acRate": 86.86109539659778, "difficulty": "Easy", "likes": 6913, "dislikes": 375, "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": 1056356, "totalSubmissionRaw": 1216144}, "939": {"acRate": 53.74383523008789, "difficulty": "Medium", "likes": 1952, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 141011, "totalSubmissionRaw": 262377}, "940": {"acRate": 43.10135644722317, "difficulty": "Hard", "likes": 1694, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "940", "paidOnly": false, "title": "Distinct Subsequences II", "titleSlug": "distinct-subsequences-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39433, "totalSubmissionRaw": 91489}, "941": {"acRate": 33.44092851277509, "difficulty": "Easy", "likes": 2916, "dislikes": 181, "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": 424348, "totalSubmissionRaw": 1268948}, "942": {"acRate": 78.68731005911792, "difficulty": "Easy", "likes": 2440, "dislikes": 1003, "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": 156129, "totalSubmissionRaw": 198417}, "943": {"acRate": 43.873943587175866, "difficulty": "Hard", "likes": 1431, "dislikes": 146, "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": 28916, "totalSubmissionRaw": 65907}, "944": {"acRate": 74.61398406280296, "difficulty": "Easy", "likes": 1695, "dislikes": 2873, "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": 189330, "totalSubmissionRaw": 253746}, "945": {"acRate": 52.49558658321297, "difficulty": "Medium", "likes": 1793, "dislikes": 57, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 88317, "totalSubmissionRaw": 168237}, "946": {"acRate": 69.4720334553058, "difficulty": "Medium", "likes": 5880, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "946", "paidOnly": false, "title": "Validate Stack Sequences", "titleSlug": "validate-stack-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 305670, "totalSubmissionRaw": 439990}, "947": {"acRate": 58.88145948000394, "difficulty": "Medium", "likes": 5308, "dislikes": 643, "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": 209144, "totalSubmissionRaw": 355195}, "948": {"acRate": 58.96749015246786, "difficulty": "Medium", "likes": 3224, "dislikes": 529, "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": 226947, "totalSubmissionRaw": 384868}, "949": {"acRate": 35.18699633847671, "difficulty": "Medium", "likes": 708, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87066, "totalSubmissionRaw": 247438}, "950": {"acRate": 82.88607573238254, "difficulty": "Medium", "likes": 3419, "dislikes": 639, "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": 193412, "totalSubmissionRaw": 233347}, "951": {"acRate": 66.95057532451578, "difficulty": "Medium", "likes": 2280, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "951", "paidOnly": false, "title": "Flip Equivalent Binary Trees", "titleSlug": "flip-equivalent-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147150, "totalSubmissionRaw": 219789}, "952": {"acRate": 40.69175143641132, "difficulty": "Hard", "likes": 1606, "dislikes": 92, "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": 53683, "totalSubmissionRaw": 131926}, "953": {"acRate": 55.02097662108609, "difficulty": "Easy", "likes": 4858, "dislikes": 1626, "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": 506623, "totalSubmissionRaw": 920784}, "954": {"acRate": 39.16331004491338, "difficulty": "Medium", "likes": 1516, "dislikes": 153, "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": 87895, "totalSubmissionRaw": 224432}, "955": {"acRate": 35.19515126182141, "difficulty": "Medium", "likes": 654, "dislikes": 86, "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": 20208, "totalSubmissionRaw": 57417}, "956": {"acRate": 52.27586329686373, "difficulty": "Hard", "likes": 2336, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "956", "paidOnly": false, "title": "Tallest Billboard", "titleSlug": "tallest-billboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58722, "totalSubmissionRaw": 112331}, "957": {"acRate": 38.95522569507762, "difficulty": "Medium", "likes": 1481, "dislikes": 1737, "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": 160217, "totalSubmissionRaw": 411285}, "958": {"acRate": 56.91858023387639, "difficulty": "Medium", "likes": 4242, "dislikes": 59, "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": 234463, "totalSubmissionRaw": 411926}, "959": {"acRate": 69.39658669840153, "difficulty": "Medium", "likes": 3061, "dislikes": 580, "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": 51316, "totalSubmissionRaw": 73946}, "960": {"acRate": 57.976404719056184, "difficulty": "Hard", "likes": 595, "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": 14497, "totalSubmissionRaw": 25005}, "961": {"acRate": 76.73147003371592, "difficulty": "Easy", "likes": 1339, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "961", "paidOnly": false, "title": "N-Repeated Element in Size 2N Array", "titleSlug": "n-repeated-element-in-size-2n-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236458, "totalSubmissionRaw": 308163}, "962": {"acRate": 50.041704059547065, "difficulty": "Medium", "likes": 1669, "dislikes": 50, "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": 47397, "totalSubmissionRaw": 94715}, "963": {"acRate": 54.861755244617235, "difficulty": "Medium", "likes": 373, "dislikes": 456, "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": 27799, "totalSubmissionRaw": 50671}, "964": {"acRate": 48.517467462569726, "difficulty": "Hard", "likes": 316, "dislikes": 69, "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": 9916, "totalSubmissionRaw": 20438}, "965": {"acRate": 70.93457913937989, "difficulty": "Easy", "likes": 1880, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "965", "paidOnly": false, "title": "Univalued Binary Tree", "titleSlug": "univalued-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221074, "totalSubmissionRaw": 311659}, "966": {"acRate": 51.371392614344416, "difficulty": "Medium", "likes": 421, "dislikes": 806, "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": 41636, "totalSubmissionRaw": 81049}, "967": {"acRate": 58.05954533316407, "difficulty": "Medium", "likes": 2797, "dislikes": 195, "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": 132626, "totalSubmissionRaw": 228431}, "968": {"acRate": 46.74219734919989, "difficulty": "Hard", "likes": 5299, "dislikes": 75, "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": 140149, "totalSubmissionRaw": 299834}, "969": {"acRate": 70.70929115899406, "difficulty": "Medium", "likes": 1475, "dislikes": 1526, "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": 94247, "totalSubmissionRaw": 133287}, "970": {"acRate": 43.82320898904996, "difficulty": "Medium", "likes": 387, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55109, "totalSubmissionRaw": 125753}, "971": {"acRate": 50.50361261304369, "difficulty": "Medium", "likes": 941, "dislikes": 272, "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": 42219, "totalSubmissionRaw": 83596}, "972": {"acRate": 43.905494898872384, "difficulty": "Hard", "likes": 94, "dislikes": 216, "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": 7359, "totalSubmissionRaw": 16761}, "973": {"acRate": 66.44715588989094, "difficulty": "Medium", "likes": 8331, "dislikes": 305, "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": 1207387, "totalSubmissionRaw": 1817065}, "974": {"acRate": 53.95374523814891, "difficulty": "Medium", "likes": 6571, "dislikes": 279, "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": 239355, "totalSubmissionRaw": 443630}, "975": {"acRate": 39.93557643616722, "difficulty": "Hard", "likes": 1971, "dislikes": 501, "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": 85173, "totalSubmissionRaw": 213276}, "976": {"acRate": 56.03011376779593, "difficulty": "Easy", "likes": 2962, "dislikes": 406, "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": 239796, "totalSubmissionRaw": 427977}, "977": {"acRate": 72.83049867743982, "difficulty": "Easy", "likes": 9256, "dislikes": 238, "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": 1854673, "totalSubmissionRaw": 2546560}, "978": {"acRate": 47.39388514627597, "difficulty": "Medium", "likes": 1954, "dislikes": 232, "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": 100603, "totalSubmissionRaw": 212263}, "979": {"acRate": 77.00376258000946, "difficulty": "Medium", "likes": 5746, "dislikes": 230, "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": 193809, "totalSubmissionRaw": 251685}, "980": {"acRate": 81.75093028823717, "difficulty": "Hard", "likes": 5103, "dislikes": 188, "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": 201458, "totalSubmissionRaw": 246429}, "981": {"acRate": 49.35576859960192, "difficulty": "Medium", "likes": 4741, "dislikes": 557, "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": 443620, "totalSubmissionRaw": 898819}, "982": {"acRate": 58.08972598260414, "difficulty": "Hard", "likes": 431, "dislikes": 217, "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": 17765, "totalSubmissionRaw": 30582}, "983": {"acRate": 65.27276102461795, "difficulty": "Medium", "likes": 7806, "dislikes": 147, "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": 291843, "totalSubmissionRaw": 447113}, "984": {"acRate": 43.89471838459906, "difficulty": "Medium", "likes": 799, "dislikes": 367, "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": 47563, "totalSubmissionRaw": 108357}, "985": {"acRate": 68.11752330161215, "difficulty": "Medium", "likes": 2070, "dislikes": 317, "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": 139222, "totalSubmissionRaw": 204385}, "986": {"acRate": 71.6983058473359, "difficulty": "Medium", "likes": 5521, "dislikes": 111, "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": 414323, "totalSubmissionRaw": 577870}, "987": {"acRate": 47.72733324457462, "difficulty": "Hard", "likes": 7467, "dislikes": 4315, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 430176, "totalSubmissionRaw": 901320}, "988": {"acRate": 60.472341273156026, "difficulty": "Medium", "likes": 2257, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188225, "totalSubmissionRaw": 311258}, "989": {"acRate": 45.30168012704884, "difficulty": "Easy", "likes": 3415, "dislikes": 286, "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": 260438, "totalSubmissionRaw": 574897}, "990": {"acRate": 50.50830912813675, "difficulty": "Medium", "likes": 3709, "dislikes": 59, "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": 127287, "totalSubmissionRaw": 252012}, "991": {"acRate": 54.42984681485, "difficulty": "Medium", "likes": 2678, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100839, "totalSubmissionRaw": 185265}, "992": {"acRate": 63.25899286958527, "difficulty": "Hard", "likes": 5932, "dislikes": 95, "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": 213897, "totalSubmissionRaw": 338129}, "993": {"acRate": 56.17201457654409, "difficulty": "Easy", "likes": 3983, "dislikes": 201, "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": 276993, "totalSubmissionRaw": 493118}, "994": {"acRate": 54.17104799742568, "difficulty": "Medium", "likes": 12650, "dislikes": 399, "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": 855181, "totalSubmissionRaw": 1578668}, "995": {"acRate": 51.62037715928087, "difficulty": "Hard", "likes": 1210, "dislikes": 59, "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": 35202, "totalSubmissionRaw": 68194}, "996": {"acRate": 50.13131055583886, "difficulty": "Hard", "likes": 983, "dislikes": 43, "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": 39323, "totalSubmissionRaw": 78440}, "997": {"acRate": 49.79016104431363, "difficulty": "Easy", "likes": 6576, "dislikes": 586, "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": 588564, "totalSubmissionRaw": 1182091}, "998": {"acRate": 69.13040141223425, "difficulty": "Medium", "likes": 524, "dislikes": 782, "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": 36027, "totalSubmissionRaw": 52115}, "999": {"acRate": 69.02775324445922, "difficulty": "Easy", "likes": 659, "dislikes": 630, "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": 66433, "totalSubmissionRaw": 96241}, "1000": {"acRate": 43.06867444882448, "difficulty": "Hard", "likes": 2447, "dislikes": 108, "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": 39441, "totalSubmissionRaw": 91577}, "1001": {"acRate": 36.759088980053754, "difficulty": "Hard", "likes": 605, "dislikes": 152, "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": 20788, "totalSubmissionRaw": 56552}, "1002": {"acRate": 74.21797371786295, "difficulty": "Easy", "likes": 4163, "dislikes": 394, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338292, "totalSubmissionRaw": 455809}, "1003": {"acRate": 59.60322215564876, "difficulty": "Medium", "likes": 978, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "1003", "paidOnly": false, "title": "Check If Word Is Valid After Substitutions", "titleSlug": "check-if-word-is-valid-after-substitutions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62671, "totalSubmissionRaw": 105147}, "1004": {"acRate": 63.16862068965518, "difficulty": "Medium", "likes": 8421, "dislikes": 125, "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": 549552, "totalSubmissionRaw": 869976}, "1005": {"acRate": 51.1679021832482, "difficulty": "Easy", "likes": 1533, "dislikes": 113, "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": 90558, "totalSubmissionRaw": 176981}, "1006": {"acRate": 57.20470346522848, "difficulty": "Medium", "likes": 367, "dislikes": 353, "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": 31184, "totalSubmissionRaw": 54513}, "1007": {"acRate": 52.22966271115885, "difficulty": "Medium", "likes": 2823, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1007", "paidOnly": false, "title": "Minimum Domino Rotations For Equal Row", "titleSlug": "minimum-domino-rotations-for-equal-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203258, "totalSubmissionRaw": 389162}, "1008": {"acRate": 82.00688055261274, "difficulty": "Medium", "likes": 6063, "dislikes": 81, "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": 363041, "totalSubmissionRaw": 442696}, "1009": {"acRate": 60.78384475170948, "difficulty": "Easy", "likes": 2388, "dislikes": 111, "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": 241430, "totalSubmissionRaw": 397194}, "1010": {"acRate": 52.88432883477372, "difficulty": "Medium", "likes": 4181, "dislikes": 170, "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": 273282, "totalSubmissionRaw": 516756}, "1011": {"acRate": 69.59214935895233, "difficulty": "Medium", "likes": 9357, "dislikes": 219, "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": 384791, "totalSubmissionRaw": 552923}, "1012": {"acRate": 42.12614141010928, "difficulty": "Hard", "likes": 768, "dislikes": 86, "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": 16885, "totalSubmissionRaw": 40082}, "1013": {"acRate": 41.96641389223068, "difficulty": "Easy", "likes": 1695, "dislikes": 154, "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": 93139, "totalSubmissionRaw": 221937}, "1014": {"acRate": 59.13537353042988, "difficulty": "Medium", "likes": 2479, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92250, "totalSubmissionRaw": 155998}, "1015": {"acRate": 46.58847110352251, "difficulty": "Medium", "likes": 1133, "dislikes": 852, "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": 62757, "totalSubmissionRaw": 134705}, "1016": {"acRate": 57.370958937344575, "difficulty": "Medium", "likes": 348, "dislikes": 531, "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": 37835, "totalSubmissionRaw": 65948}, "1017": {"acRate": 60.69584432568942, "difficulty": "Medium", "likes": 511, "dislikes": 289, "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": 26918, "totalSubmissionRaw": 44349}, "1018": {"acRate": 46.71716958689399, "difficulty": "Easy", "likes": 724, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55379, "totalSubmissionRaw": 118541}, "1019": {"acRate": 60.846923711771616, "difficulty": "Medium", "likes": 3268, "dislikes": 119, "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": 157038, "totalSubmissionRaw": 258087}, "1020": {"acRate": 68.8221658774252, "difficulty": "Medium", "likes": 3972, "dislikes": 76, "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": 221489, "totalSubmissionRaw": 321828}, "1021": {"acRate": 82.77825613064843, "difficulty": "Easy", "likes": 2877, "dislikes": 1582, "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": 318217, "totalSubmissionRaw": 384421}, "1022": {"acRate": 73.07588637777317, "difficulty": "Easy", "likes": 3330, "dislikes": 185, "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": 211467, "totalSubmissionRaw": 289380}, "1023": {"acRate": 62.277785621686846, "difficulty": "Medium", "likes": 889, "dislikes": 328, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48520, "totalSubmissionRaw": 77909}, "1024": {"acRate": 51.374255952380956, "difficulty": "Medium", "likes": 1747, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1024", "paidOnly": false, "title": "Video Stitching", "titleSlug": "video-stitching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69047, "totalSubmissionRaw": 134400}, "1025": {"acRate": 68.81693143176166, "difficulty": "Easy", "likes": 2160, "dislikes": 4122, "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": 257621, "totalSubmissionRaw": 374357}, "1026": {"acRate": 78.09974421481152, "difficulty": "Medium", "likes": 4904, "dislikes": 164, "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": 325180, "totalSubmissionRaw": 416365}, "1027": {"acRate": 49.104942001815694, "difficulty": "Medium", "likes": 4633, "dislikes": 208, "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": 174709, "totalSubmissionRaw": 355782}, "1028": {"acRate": 74.65156794425087, "difficulty": "Hard", "likes": 1621, "dislikes": 43, "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": 51420, "totalSubmissionRaw": 68880}, "1029": {"acRate": 66.7300989269452, "difficulty": "Medium", "likes": 4691, "dislikes": 350, "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": 243711, "totalSubmissionRaw": 365219}, "1030": {"acRate": 71.15676684086534, "difficulty": "Easy", "likes": 753, "dislikes": 322, "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": 59502, "totalSubmissionRaw": 83621}, "1031": {"acRate": 59.746059618582905, "difficulty": "Medium", "likes": 2537, "dislikes": 83, "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": 70771, "totalSubmissionRaw": 118453}, "1032": {"acRate": 52.009596683088176, "difficulty": "Hard", "likes": 1800, "dislikes": 183, "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": 89314, "totalSubmissionRaw": 171726}, "1033": {"acRate": 48.000153391877895, "difficulty": "Medium", "likes": 217, "dislikes": 647, "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": 25034, "totalSubmissionRaw": 52154}, "1034": {"acRate": 49.00790069287272, "difficulty": "Medium", "likes": 723, "dislikes": 880, "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": 35295, "totalSubmissionRaw": 72019}, "1035": {"acRate": 63.09845745191538, "difficulty": "Medium", "likes": 3792, "dislikes": 57, "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": 157731, "totalSubmissionRaw": 249976}, "1036": {"acRate": 34.763294630829435, "difficulty": "Hard", "likes": 663, "dislikes": 167, "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": 21677, "totalSubmissionRaw": 62356}, "1037": {"acRate": 37.00095996386018, "difficulty": "Easy", "likes": 412, "dislikes": 524, "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": 52420, "totalSubmissionRaw": 141672}, "1038": {"acRate": 85.8618968545732, "difficulty": "Medium", "likes": 3734, "dislikes": 154, "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": 178907, "totalSubmissionRaw": 208366}, "1039": {"acRate": 58.943127962085306, "difficulty": "Medium", "likes": 1804, "dislikes": 174, "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": 49748, "totalSubmissionRaw": 84400}, "1040": {"acRate": 56.62890301188174, "difficulty": "Medium", "likes": 365, "dislikes": 629, "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": 10247, "totalSubmissionRaw": 18095}, "1041": {"acRate": 55.696895057196315, "difficulty": "Medium", "likes": 3709, "dislikes": 698, "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": 235169, "totalSubmissionRaw": 422230}, "1042": {"acRate": 51.267748478701826, "difficulty": "Medium", "likes": 1422, "dislikes": 714, "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": 78858, "totalSubmissionRaw": 153816}, "1043": {"acRate": 76.49738623142093, "difficulty": "Medium", "likes": 4634, "dislikes": 410, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186724, "totalSubmissionRaw": 244092}, "1044": {"acRate": 30.54916894724389, "difficulty": "Hard", "likes": 2214, "dislikes": 384, "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": 68428, "totalSubmissionRaw": 223993}, "1045": {"acRate": 61.74635024380888, "difficulty": "Medium", "likes": 692, "dislikes": 64, "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": 167394, "totalSubmissionRaw": 271092}, "1046": {"acRate": 65.40687481782197, "difficulty": "Easy", "likes": 5962, "dislikes": 118, "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": 619322, "totalSubmissionRaw": 946876}, "1047": {"acRate": 69.61620598737144, "difficulty": "Easy", "likes": 6543, "dislikes": 253, "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": 572427, "totalSubmissionRaw": 822262}, "1048": {"acRate": 61.08984202444309, "difficulty": "Medium", "likes": 7225, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 406581, "totalSubmissionRaw": 665546}, "1049": {"acRate": 55.447733848855876, "difficulty": "Medium", "likes": 3075, "dislikes": 116, "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": 87766, "totalSubmissionRaw": 158286}, "1050": {"acRate": 69.97065369389243, "difficulty": "Easy", "likes": 643, "dislikes": 49, "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": 177631, "totalSubmissionRaw": 253865}, "1051": {"acRate": 76.59309295657208, "difficulty": "Easy", "likes": 1150, "dislikes": 86, "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": 345382, "totalSubmissionRaw": 450931}, "1052": {"acRate": 57.104722792607795, "difficulty": "Medium", "likes": 1715, "dislikes": 134, "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": 75087, "totalSubmissionRaw": 131490}, "1053": {"acRate": 49.714616797544345, "difficulty": "Medium", "likes": 440, "dislikes": 40, "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": 40328, "totalSubmissionRaw": 81119}, "1054": {"acRate": 46.50195086627109, "difficulty": "Medium", "likes": 1258, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43025, "totalSubmissionRaw": 92523}, "1055": {"acRate": 60.220586755402294, "difficulty": "Medium", "likes": 1265, "dislikes": 65, "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": 89763, "totalSubmissionRaw": 149057}, "1056": {"acRate": 48.71108923393008, "difficulty": "Easy", "likes": 312, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45521, "totalSubmissionRaw": 93451}, "1057": {"acRate": 58.61285471426704, "difficulty": "Medium", "likes": 978, "dislikes": 194, "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": 71714, "totalSubmissionRaw": 122352}, "1058": {"acRate": 45.08457955381221, "difficulty": "Medium", "likes": 148, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1058", "paidOnly": true, "title": "Minimize Rounding Error to Meet Target", "titleSlug": "minimize-rounding-error-to-meet-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9195, "totalSubmissionRaw": 20395}, "1059": {"acRate": 37.65426728477151, "difficulty": "Medium", "likes": 704, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 60594, "totalSubmissionRaw": 160922}, "1060": {"acRate": 56.92524208624782, "difficulty": "Medium", "likes": 1649, "dislikes": 61, "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": 135502, "totalSubmissionRaw": 238035}, "1061": {"acRate": 76.53755473223308, "difficulty": "Medium", "likes": 2332, "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": 79534, "totalSubmissionRaw": 103915}, "1062": {"acRate": 60.75021663459985, "difficulty": "Medium", "likes": 663, "dislikes": 63, "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": 41363, "totalSubmissionRaw": 68087}, "1063": {"acRate": 78.92943757939716, "difficulty": "Hard", "likes": 305, "dislikes": 16, "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": 13669, "totalSubmissionRaw": 17318}, "1064": {"acRate": 64.1287432552322, "difficulty": "Easy", "likes": 436, "dislikes": 66, "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": 44093, "totalSubmissionRaw": 68757}, "1065": {"acRate": 67.384712417825, "difficulty": "Easy", "likes": 375, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27778, "totalSubmissionRaw": 41223}, "1066": {"acRate": 55.1812270163595, "difficulty": "Medium", "likes": 932, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51169, "totalSubmissionRaw": 92729}, "1067": {"acRate": 46.27539503386004, "difficulty": "Hard", "likes": 94, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1067", "paidOnly": true, "title": "Digit Count in Range", "titleSlug": "digit-count-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4100, "totalSubmissionRaw": 8860}, "1068": {"acRate": 82.04589638092857, "difficulty": "Easy", "likes": 812, "dislikes": 213, "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": 446073, "totalSubmissionRaw": 543687}, "1069": {"acRate": 81.74219628582718, "difficulty": "Easy", "likes": 79, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53788, "totalSubmissionRaw": 65802}, "1070": {"acRate": 42.31999416867119, "difficulty": "Medium", "likes": 384, "dislikes": 859, "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": 145147, "totalSubmissionRaw": 342975}, "1071": {"acRate": 51.354261323279715, "difficulty": "Easy", "likes": 5027, "dislikes": 1297, "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": 455498, "totalSubmissionRaw": 886974}, "1072": {"acRate": 63.94593989590912, "difficulty": "Medium", "likes": 733, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22853, "totalSubmissionRaw": 35738}, "1073": {"acRate": 36.8069857484142, "difficulty": "Medium", "likes": 316, "dislikes": 125, "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": 17872, "totalSubmissionRaw": 48556}, "1074": {"acRate": 74.42865606697812, "difficulty": "Hard", "likes": 3682, "dislikes": 102, "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": 153262, "totalSubmissionRaw": 205918}, "1075": {"acRate": 61.26121995425711, "difficulty": "Easy", "likes": 547, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227134, "totalSubmissionRaw": 370762}, "1076": {"acRate": 49.90689661173276, "difficulty": "Easy", "likes": 203, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1076", "paidOnly": true, "title": "Project Employees II", "titleSlug": "project-employees-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57356, "totalSubmissionRaw": 114926}, "1077": {"acRate": 76.5191629690202, "difficulty": "Medium", "likes": 266, "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": 57081, "totalSubmissionRaw": 74597}, "1078": {"acRate": 63.46876958429078, "difficulty": "Easy", "likes": 482, "dislikes": 359, "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": 72918, "totalSubmissionRaw": 114888}, "1079": {"acRate": 76.26932403758715, "difficulty": "Medium", "likes": 2475, "dislikes": 68, "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": 100645, "totalSubmissionRaw": 131960}, "1080": {"acRate": 55.533888790403594, "difficulty": "Medium", "likes": 688, "dislikes": 707, "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": 37592, "totalSubmissionRaw": 67692}, "1081": {"acRate": 60.86952694494815, "difficulty": "Medium", "likes": 2585, "dislikes": 190, "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": 69149, "totalSubmissionRaw": 113602}, "1082": {"acRate": 74.26213296820325, "difficulty": "Easy", "likes": 194, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "1082", "paidOnly": true, "title": "Sales Analysis I", "titleSlug": "sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58575, "totalSubmissionRaw": 78871}, "1083": {"acRate": 49.6565168166302, "difficulty": "Easy", "likes": 270, "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": 58333, "totalSubmissionRaw": 117473}, "1084": {"acRate": 46.55282581589973, "difficulty": "Easy", "likes": 720, "dislikes": 148, "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": 134783, "totalSubmissionRaw": 289527}, "1085": {"acRate": 76.40806975116146, "difficulty": "Easy", "likes": 117, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "1085", "paidOnly": true, "title": "Sum of Digits in the Minimum Number", "titleSlug": "sum-of-digits-in-the-minimum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24009, "totalSubmissionRaw": 31423}, "1086": {"acRate": 74.54461108010351, "difficulty": "Easy", "likes": 793, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102841, "totalSubmissionRaw": 137959}, "1087": {"acRate": 66.38276807473599, "difficulty": "Medium", "likes": 639, "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": 52299, "totalSubmissionRaw": 78784}, "1088": {"acRate": 47.20716833140841, "difficulty": "Hard", "likes": 492, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37195, "totalSubmissionRaw": 78791}, "1089": {"acRate": 51.9383902892651, "difficulty": "Easy", "likes": 2583, "dislikes": 736, "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": 421680, "totalSubmissionRaw": 811885}, "1090": {"acRate": 62.059822150363786, "difficulty": "Medium", "likes": 442, "dislikes": 627, "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": 38384, "totalSubmissionRaw": 61849}, "1091": {"acRate": 47.436509867897264, "difficulty": "Medium", "likes": 6418, "dislikes": 237, "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": 473670, "totalSubmissionRaw": 998534}, "1092": {"acRate": 59.06737882144895, "difficulty": "Hard", "likes": 4792, "dislikes": 66, "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": 114902, "totalSubmissionRaw": 194527}, "1093": {"acRate": 42.021660649819495, "difficulty": "Medium", "likes": 150, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19788, "totalSubmissionRaw": 47090}, "1094": {"acRate": 56.052759223516816, "difficulty": "Medium", "likes": 4424, "dislikes": 96, "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": 221877, "totalSubmissionRaw": 395836}, "1095": {"acRate": 40.36862451242641, "difficulty": "Hard", "likes": 3204, "dislikes": 130, "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": 138992, "totalSubmissionRaw": 344306}, "1096": {"acRate": 63.67254705595358, "difficulty": "Hard", "likes": 481, "dislikes": 287, "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": 24796, "totalSubmissionRaw": 38943}, "1097": {"acRate": 51.15031511001592, "difficulty": "Hard", "likes": 183, "dislikes": 32, "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": 23456, "totalSubmissionRaw": 45857}, "1098": {"acRate": 43.08262894600656, "difficulty": "Medium", "likes": 202, "dislikes": 602, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39960, "totalSubmissionRaw": 92752}, "1099": {"acRate": 61.817763248768365, "difficulty": "Easy", "likes": 1134, "dislikes": 130, "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": 134262, "totalSubmissionRaw": 217190}, "1100": {"acRate": 74.67489491100974, "difficulty": "Medium", "likes": 569, "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": 41747, "totalSubmissionRaw": 55905}, "1101": {"acRate": 64.60028190983178, "difficulty": "Medium", "likes": 985, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90286, "totalSubmissionRaw": 139760}, "1102": {"acRate": 53.68128664997771, "difficulty": "Medium", "likes": 1288, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1102", "paidOnly": true, "title": "Path With Maximum Minimum Value", "titleSlug": "path-with-maximum-minimum-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62616, "totalSubmissionRaw": 116644}, "1103": {"acRate": 65.2241112828439, "difficulty": "Easy", "likes": 974, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87776, "totalSubmissionRaw": 134576}, "1104": {"acRate": 75.36670547147847, "difficulty": "Medium", "likes": 1485, "dislikes": 314, "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": 45318, "totalSubmissionRaw": 60130}, "1105": {"acRate": 59.51956605966679, "difficulty": "Medium", "likes": 1821, "dislikes": 130, "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": 53767, "totalSubmissionRaw": 90335}, "1106": {"acRate": 59.15660535606312, "difficulty": "Hard", "likes": 1153, "dislikes": 61, "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": 30329, "totalSubmissionRaw": 51269}, "1107": {"acRate": 44.612318614934296, "difficulty": "Medium", "likes": 149, "dislikes": 164, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35817, "totalSubmissionRaw": 80285}, "1108": {"acRate": 89.09268913460829, "difficulty": "Easy", "likes": 2083, "dislikes": 1752, "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": 652478, "totalSubmissionRaw": 732359}, "1109": {"acRate": 61.79790495903741, "difficulty": "Medium", "likes": 1614, "dislikes": 159, "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": 63891, "totalSubmissionRaw": 103387}, "1110": {"acRate": 69.1626023542639, "difficulty": "Medium", "likes": 3901, "dislikes": 112, "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": 223915, "totalSubmissionRaw": 323751}, "1111": {"acRate": 71.9658936967089, "difficulty": "Medium", "likes": 433, "dislikes": 1743, "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": 27093, "totalSubmissionRaw": 37647}, "1112": {"acRate": 70.83377080927215, "difficulty": "Medium", "likes": 296, "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": 60718, "totalSubmissionRaw": 85719}, "1113": {"acRate": 64.85907459447428, "difficulty": "Easy", "likes": 108, "dislikes": 399, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46622, "totalSubmissionRaw": 71882}, "1114": {"acRate": 69.41138672253227, "difficulty": "Easy", "likes": 1454, "dislikes": 203, "categoryTitle": "Concurrency", "frontendQuestionId": "1114", "paidOnly": false, "title": "Print in Order", "titleSlug": "print-in-order", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157709, "totalSubmissionRaw": 227210}, "1115": {"acRate": 65.89560392055147, "difficulty": "Medium", "likes": 677, "dislikes": 54, "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": 83836, "totalSubmissionRaw": 127226}, "1116": {"acRate": 60.95143466459868, "difficulty": "Medium", "likes": 484, "dislikes": 331, "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": 50301, "totalSubmissionRaw": 82527}, "1117": {"acRate": 56.18874020389006, "difficulty": "Medium", "likes": 508, "dislikes": 153, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51479, "totalSubmissionRaw": 91618}, "1118": {"acRate": 58.23036792970895, "difficulty": "Easy", "likes": 42, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "1118", "paidOnly": true, "title": "Number of Days in a Month", "titleSlug": "number-of-days-in-a-month", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8483, "totalSubmissionRaw": 14568}, "1119": {"acRate": 91.12199804697198, "difficulty": "Easy", "likes": 359, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110111, "totalSubmissionRaw": 120839}, "1120": {"acRate": 66.59451101662157, "difficulty": "Medium", "likes": 834, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1120", "paidOnly": true, "title": "Maximum Average Subtree", "titleSlug": "maximum-average-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68912, "totalSubmissionRaw": 103480}, "1121": {"acRate": 61.38902996444896, "difficulty": "Hard", "likes": 122, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4835, "totalSubmissionRaw": 7876}, "1122": {"acRate": 69.09572536056149, "difficulty": "Easy", "likes": 2530, "dislikes": 145, "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": 188328, "totalSubmissionRaw": 272561}, "1123": {"acRate": 72.30385827178348, "difficulty": "Medium", "likes": 1954, "dislikes": 842, "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": 111990, "totalSubmissionRaw": 154888}, "1124": {"acRate": 34.9550135501355, "difficulty": "Medium", "likes": 1414, "dislikes": 113, "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": 32247, "totalSubmissionRaw": 92252}, "1125": {"acRate": 55.579235263821545, "difficulty": "Hard", "likes": 2162, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1125", "paidOnly": false, "title": "Smallest Sufficient Team", "titleSlug": "smallest-sufficient-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62590, "totalSubmissionRaw": 112614}, "1126": {"acRate": 65.672753834916, "difficulty": "Medium", "likes": 268, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44953, "totalSubmissionRaw": 68450}, "1127": {"acRate": 47.47911967323051, "difficulty": "Hard", "likes": 180, "dislikes": 132, "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": 15576, "totalSubmissionRaw": 32806}, "1128": {"acRate": 48.179027124468355, "difficulty": "Easy", "likes": 676, "dislikes": 332, "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": 68418, "totalSubmissionRaw": 142008}, "1129": {"acRate": 47.08930216630928, "difficulty": "Medium", "likes": 3469, "dislikes": 183, "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": 115511, "totalSubmissionRaw": 245302}, "1130": {"acRate": 67.76941430632183, "difficulty": "Medium", "likes": 4250, "dislikes": 273, "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": 99127, "totalSubmissionRaw": 146271}, "1131": {"acRate": 48.35468019977445, "difficulty": "Medium", "likes": 642, "dislikes": 404, "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": 24011, "totalSubmissionRaw": 49656}, "1132": {"acRate": 32.28731304618148, "difficulty": "Medium", "likes": 151, "dislikes": 563, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37390, "totalSubmissionRaw": 115803}, "1133": {"acRate": 69.00548437951018, "difficulty": "Easy", "likes": 316, "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": 62156, "totalSubmissionRaw": 90074}, "1134": {"acRate": 77.81364823821761, "difficulty": "Easy", "likes": 206, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36637, "totalSubmissionRaw": 47083}, "1135": {"acRate": 62.01266831662402, "difficulty": "Medium", "likes": 1112, "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": 73916, "totalSubmissionRaw": 119195}, "1136": {"acRate": 61.40175704506109, "difficulty": "Medium", "likes": 1149, "dislikes": 26, "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": 85478, "totalSubmissionRaw": 139211}, "1137": {"acRate": 63.83173550623455, "difficulty": "Easy", "likes": 4412, "dislikes": 190, "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": 770280, "totalSubmissionRaw": 1206736}, "1138": {"acRate": 51.6473578971695, "difficulty": "Medium", "likes": 894, "dislikes": 178, "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": 51401, "totalSubmissionRaw": 99523}, "1139": {"acRate": 50.14709119654186, "difficulty": "Medium", "likes": 703, "dislikes": 110, "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": 25058, "totalSubmissionRaw": 49969}, "1140": {"acRate": 67.48613005262368, "difficulty": "Medium", "likes": 2817, "dislikes": 622, "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": 94515, "totalSubmissionRaw": 140051}, "1141": {"acRate": 48.31088894028072, "difficulty": "Easy", "likes": 623, "dislikes": 776, "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": 217255, "totalSubmissionRaw": 449703}, "1142": {"acRate": 35.73227414856757, "difficulty": "Easy", "likes": 99, "dislikes": 366, "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": 42282, "totalSubmissionRaw": 118330}, "1143": {"acRate": 57.77704816142, "difficulty": "Medium", "likes": 13374, "dislikes": 193, "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": 1085758, "totalSubmissionRaw": 1879220}, "1144": {"acRate": 47.805072616785154, "difficulty": "Medium", "likes": 426, "dislikes": 167, "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": 20375, "totalSubmissionRaw": 42621}, "1145": {"acRate": 51.943619671683564, "difficulty": "Medium", "likes": 1338, "dislikes": 211, "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": 45660, "totalSubmissionRaw": 87903}, "1146": {"acRate": 36.971323205167714, "difficulty": "Medium", "likes": 3681, "dislikes": 495, "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": 217147, "totalSubmissionRaw": 587339}, "1147": {"acRate": 58.72274143302181, "difficulty": "Hard", "likes": 658, "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": 24128, "totalSubmissionRaw": 41088}, "1148": {"acRate": 75.36116923029759, "difficulty": "Easy", "likes": 1357, "dislikes": 76, "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": 589974, "totalSubmissionRaw": 782864}, "1149": {"acRate": 47.003022905784, "difficulty": "Medium", "likes": 128, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37162, "totalSubmissionRaw": 79063}, "1150": {"acRate": 58.85309709155165, "difficulty": "Easy", "likes": 454, "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": 49292, "totalSubmissionRaw": 83754}, "1151": {"acRate": 60.21427644627333, "difficulty": "Medium", "likes": 1186, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1151", "paidOnly": true, "title": "Minimum Swaps to Group All 1's Together", "titleSlug": "minimum-swaps-to-group-all-1s-together", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 64970, "totalSubmissionRaw": 107898}, "1152": {"acRate": 42.69558535600637, "difficulty": "Medium", "likes": 487, "dislikes": 3689, "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": 98348, "totalSubmissionRaw": 230347}, "1153": {"acRate": 34.97618679761129, "difficulty": "Hard", "likes": 876, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "1153", "paidOnly": true, "title": "String Transforms Into Another String", "titleSlug": "string-transforms-into-another-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52068, "totalSubmissionRaw": 148867}, "1154": {"acRate": 48.69337124926456, "difficulty": "Easy", "likes": 448, "dislikes": 475, "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": 59588, "totalSubmissionRaw": 122375}, "1155": {"acRate": 60.865962950548024, "difficulty": "Medium", "likes": 5013, "dislikes": 168, "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": 288711, "totalSubmissionRaw": 474339}, "1156": {"acRate": 44.032603439939216, "difficulty": "Medium", "likes": 1009, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1156", "paidOnly": false, "title": "Swap For Longest Repeated Character Substring", "titleSlug": "swap-for-longest-repeated-character-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31873, "totalSubmissionRaw": 72385}, "1157": {"acRate": 41.53267020666617, "difficulty": "Hard", "likes": 623, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1157", "paidOnly": false, "title": "Online Majority Element In Subarray", "titleSlug": "online-majority-element-in-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16660, "totalSubmissionRaw": 40113}, "1158": {"acRate": 57.04936879573743, "difficulty": "Medium", "likes": 635, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1158", "paidOnly": false, "title": "Market Analysis I", "titleSlug": "market-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103216, "totalSubmissionRaw": 180924}, "1159": {"acRate": 57.06293283333837, "difficulty": "Hard", "likes": 120, "dislikes": 79, "categoryTitle": "Database", "frontendQuestionId": "1159", "paidOnly": true, "title": "Market Analysis II", "titleSlug": "market-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18869, "totalSubmissionRaw": 33067}, "1160": {"acRate": 70.6384101779952, "difficulty": "Easy", "likes": 2096, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259623, "totalSubmissionRaw": 367538}, "1161": {"acRate": 67.10611606572704, "difficulty": "Medium", "likes": 3499, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1161", "paidOnly": false, "title": "Maximum Level Sum of a Binary Tree", "titleSlug": "maximum-level-sum-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278483, "totalSubmissionRaw": 414989}, "1162": {"acRate": 51.57971291352885, "difficulty": "Medium", "likes": 4109, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1162", "paidOnly": false, "title": "As Far from Land as Possible", "titleSlug": "as-far-from-land-as-possible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153902, "totalSubmissionRaw": 298377}, "1163": {"acRate": 34.55386278552982, "difficulty": "Hard", "likes": 590, "dislikes": 448, "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": 34520, "totalSubmissionRaw": 99902}, "1164": {"acRate": 55.47625722071846, "difficulty": "Medium", "likes": 838, "dislikes": 224, "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": 120718, "totalSubmissionRaw": 217603}, "1165": {"acRate": 87.51612176796938, "difficulty": "Easy", "likes": 526, "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": 85498, "totalSubmissionRaw": 97694}, "1166": {"acRate": 62.92722326135011, "difficulty": "Medium", "likes": 570, "dislikes": 67, "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": 59212, "totalSubmissionRaw": 94096}, "1167": {"acRate": 69.98054796552256, "difficulty": "Medium", "likes": 1307, "dislikes": 155, "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": 122678, "totalSubmissionRaw": 175303}, "1168": {"acRate": 64.76040763226366, "difficulty": "Hard", "likes": 1136, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1168", "paidOnly": true, "title": "Optimize Water Distribution in a Village", "titleSlug": "optimize-water-distribution-in-a-village", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47788, "totalSubmissionRaw": 73792}, "1169": {"acRate": 31.178442401606393, "difficulty": "Medium", "likes": 540, "dislikes": 2311, "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": 76549, "totalSubmissionRaw": 245519}, "1170": {"acRate": 62.16406425218286, "difficulty": "Medium", "likes": 696, "dislikes": 976, "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": 80380, "totalSubmissionRaw": 129303}, "1171": {"acRate": 52.781362494056914, "difficulty": "Medium", "likes": 3276, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1171", "paidOnly": false, "title": "Remove Zero Sum Consecutive Nodes from Linked List", "titleSlug": "remove-zero-sum-consecutive-nodes-from-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163191, "totalSubmissionRaw": 309183}, "1172": {"acRate": 32.72528535846757, "difficulty": "Hard", "likes": 478, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18263, "totalSubmissionRaw": 55807}, "1173": {"acRate": 80.87980941813791, "difficulty": "Easy", "likes": 289, "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": 74352, "totalSubmissionRaw": 91929}, "1174": {"acRate": 50.86806541366191, "difficulty": "Medium", "likes": 659, "dislikes": 120, "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": 143331, "totalSubmissionRaw": 281772}, "1175": {"acRate": 57.26254925790889, "difficulty": "Easy", "likes": 399, "dislikes": 519, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31097, "totalSubmissionRaw": 54306}, "1176": {"acRate": 53.43050769205402, "difficulty": "Easy", "likes": 153, "dislikes": 287, "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": 32404, "totalSubmissionRaw": 60647}, "1177": {"acRate": 39.07328805885682, "difficulty": "Medium", "likes": 796, "dislikes": 276, "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": 27617, "totalSubmissionRaw": 70680}, "1178": {"acRate": 46.75330549231859, "difficulty": "Hard", "likes": 1260, "dislikes": 84, "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": 31011, "totalSubmissionRaw": 66329}, "1179": {"acRate": 77.17246143218973, "difficulty": "Easy", "likes": 728, "dislikes": 598, "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": 117306, "totalSubmissionRaw": 152005}, "1180": {"acRate": 79.8436953225242, "difficulty": "Easy", "likes": 353, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27380, "totalSubmissionRaw": 34292}, "1181": {"acRate": 45.79274956050743, "difficulty": "Medium", "likes": 73, "dislikes": 153, "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": 9638, "totalSubmissionRaw": 21047}, "1182": {"acRate": 55.40769004079227, "difficulty": "Medium", "likes": 514, "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": 35723, "totalSubmissionRaw": 64473}, "1183": {"acRate": 67.9159802306425, "difficulty": "Hard", "likes": 162, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1183", "paidOnly": true, "title": "Maximum Number of Ones", "titleSlug": "maximum-number-of-ones", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4947, "totalSubmissionRaw": 7284}, "1184": {"acRate": 54.03309574125148, "difficulty": "Easy", "likes": 753, "dislikes": 86, "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": 60342, "totalSubmissionRaw": 111676}, "1185": {"acRate": 57.517700957934196, "difficulty": "Easy", "likes": 398, "dislikes": 2433, "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": 66288, "totalSubmissionRaw": 115248}, "1186": {"acRate": 43.86406068659277, "difficulty": "Medium", "likes": 1792, "dislikes": 64, "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": 52157, "totalSubmissionRaw": 118905}, "1187": {"acRate": 58.28302134846233, "difficulty": "Hard", "likes": 2216, "dislikes": 49, "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": 57632, "totalSubmissionRaw": 98883}, "1188": {"acRate": 72.43741040529386, "difficulty": "Medium", "likes": 513, "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": 50026, "totalSubmissionRaw": 69061}, "1189": {"acRate": 59.74865055632518, "difficulty": "Easy", "likes": 1688, "dislikes": 102, "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": 204004, "totalSubmissionRaw": 341437}, "1190": {"acRate": 66.41241380556886, "difficulty": "Medium", "likes": 1868, "dislikes": 55, "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": 73486, "totalSubmissionRaw": 110651}, "1191": {"acRate": 23.69333469568475, "difficulty": "Medium", "likes": 1418, "dislikes": 116, "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": 34783, "totalSubmissionRaw": 146805}, "1192": {"acRate": 55.7679914593309, "difficulty": "Hard", "likes": 6128, "dislikes": 181, "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": 229323, "totalSubmissionRaw": 411209}, "1193": {"acRate": 57.783554196398235, "difficulty": "Medium", "likes": 749, "dislikes": 72, "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": 170057, "totalSubmissionRaw": 294300}, "1194": {"acRate": 49.1269803511109, "difficulty": "Hard", "likes": 149, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20652, "totalSubmissionRaw": 42038}, "1195": {"acRate": 72.37294497410105, "difficulty": "Medium", "likes": 595, "dislikes": 400, "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": 48204, "totalSubmissionRaw": 66605}, "1196": {"acRate": 66.98479145863737, "difficulty": "Easy", "likes": 221, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1196", "paidOnly": true, "title": "How Many Apples Can You Put into the Basket", "titleSlug": "how-many-apples-can-you-put-into-the-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 34883, "totalSubmissionRaw": 52076}, "1197": {"acRate": 40.54084234910379, "difficulty": "Medium", "likes": 1501, "dislikes": 405, "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": 156109, "totalSubmissionRaw": 385066}, "1198": {"acRate": 76.50536344631413, "difficulty": "Medium", "likes": 572, "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": 44647, "totalSubmissionRaw": 58358}, "1199": {"acRate": 45.74690240846443, "difficulty": "Hard", "likes": 233, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6572, "totalSubmissionRaw": 14366}, "1200": {"acRate": 69.5367405196273, "difficulty": "Easy", "likes": 2338, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1200", "paidOnly": false, "title": "Minimum Absolute Difference", "titleSlug": "minimum-absolute-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191952, "totalSubmissionRaw": 276044}, "1201": {"acRate": 29.567758092941286, "difficulty": "Medium", "likes": 1206, "dislikes": 496, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31877, "totalSubmissionRaw": 107810}, "1202": {"acRate": 58.28595461777791, "difficulty": "Medium", "likes": 3653, "dislikes": 139, "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": 115025, "totalSubmissionRaw": 197346}, "1203": {"acRate": 66.42463111078348, "difficulty": "Hard", "likes": 1745, "dislikes": 294, "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": 54065, "totalSubmissionRaw": 81393}, "1204": {"acRate": 66.8022426848596, "difficulty": "Medium", "likes": 658, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1204", "paidOnly": false, "title": "Last Person to Fit in the Bus", "titleSlug": "last-person-to-fit-in-the-bus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117595, "totalSubmissionRaw": 176035}, "1205": {"acRate": 41.791180592207034, "difficulty": "Medium", "likes": 152, "dislikes": 544, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22963, "totalSubmissionRaw": 54947}, "1206": {"acRate": 61.37918185931387, "difficulty": "Hard", "likes": 660, "dislikes": 86, "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": 23062, "totalSubmissionRaw": 37573}, "1207": {"acRate": 77.14830835951872, "difficulty": "Easy", "likes": 5001, "dislikes": 131, "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": 621900, "totalSubmissionRaw": 806110}, "1208": {"acRate": 58.20551831900983, "difficulty": "Medium", "likes": 1762, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155705, "totalSubmissionRaw": 267507}, "1209": {"acRate": 57.848679372054804, "difficulty": "Medium", "likes": 5732, "dislikes": 116, "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": 318563, "totalSubmissionRaw": 550684}, "1210": {"acRate": 49.55839567747298, "difficulty": "Hard", "likes": 268, "dislikes": 70, "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": 9539, "totalSubmissionRaw": 19248}, "1211": {"acRate": 47.387117961904494, "difficulty": "Easy", "likes": 562, "dislikes": 395, "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": 169537, "totalSubmissionRaw": 357767}, "1212": {"acRate": 55.78376979906287, "difficulty": "Medium", "likes": 305, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1212", "paidOnly": true, "title": "Team Scores in Football Tournament", "titleSlug": "team-scores-in-football-tournament", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38811, "totalSubmissionRaw": 69574}, "1213": {"acRate": 79.80388910351932, "difficulty": "Easy", "likes": 581, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86758, "totalSubmissionRaw": 108714}, "1214": {"acRate": 67.13805830879609, "difficulty": "Medium", "likes": 543, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1214", "paidOnly": true, "title": "Two Sum BSTs", "titleSlug": "two-sum-bsts", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48567, "totalSubmissionRaw": 72339}, "1215": {"acRate": 47.09087273817855, "difficulty": "Medium", "likes": 182, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9421, "totalSubmissionRaw": 20006}, "1216": {"acRate": 49.49328493647913, "difficulty": "Hard", "likes": 761, "dislikes": 12, "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": 68177, "totalSubmissionRaw": 137750}, "1217": {"acRate": 71.72756296559064, "difficulty": "Easy", "likes": 2290, "dislikes": 310, "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": 129408, "totalSubmissionRaw": 180416}, "1218": {"acRate": 54.80321022344541, "difficulty": "Medium", "likes": 3181, "dislikes": 87, "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": 142376, "totalSubmissionRaw": 259795}, "1219": {"acRate": 68.0051309214599, "difficulty": "Medium", "likes": 3261, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1219", "paidOnly": false, "title": "Path with Maximum Gold", "titleSlug": "path-with-maximum-gold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213121, "totalSubmissionRaw": 313391}, "1220": {"acRate": 61.94943493296663, "difficulty": "Hard", "likes": 3235, "dislikes": 214, "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": 167134, "totalSubmissionRaw": 269791}, "1221": {"acRate": 86.08003710029521, "difficulty": "Easy", "likes": 2719, "dislikes": 936, "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": 304410, "totalSubmissionRaw": 353636}, "1222": {"acRate": 71.88463937161832, "difficulty": "Medium", "likes": 933, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1222", "paidOnly": false, "title": "Queens That Can Attack the King", "titleSlug": "queens-that-can-attack-the-king", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42647, "totalSubmissionRaw": 59327}, "1223": {"acRate": 49.07801890560511, "difficulty": "Hard", "likes": 921, "dislikes": 189, "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": 29490, "totalSubmissionRaw": 60088}, "1224": {"acRate": 37.101099820387276, "difficulty": "Hard", "likes": 536, "dislikes": 64, "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": 15079, "totalSubmissionRaw": 40643}, "1225": {"acRate": 57.7055361646837, "difficulty": "Hard", "likes": 320, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22650, "totalSubmissionRaw": 39251}, "1226": {"acRate": 53.608815426997246, "difficulty": "Medium", "likes": 345, "dislikes": 327, "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": 33082, "totalSubmissionRaw": 61710}, "1227": {"acRate": 66.39076247492378, "difficulty": "Medium", "likes": 607, "dislikes": 967, "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": 42030, "totalSubmissionRaw": 63307}, "1228": {"acRate": 51.90992398407286, "difficulty": "Easy", "likes": 314, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1228", "paidOnly": true, "title": "Missing Number In Arithmetic Progression", "titleSlug": "missing-number-in-arithmetic-progression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 27247, "totalSubmissionRaw": 52489}, "1229": {"acRate": 55.01942069237764, "difficulty": "Medium", "likes": 879, "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": 78050, "totalSubmissionRaw": 141859}, "1230": {"acRate": 56.299695150696124, "difficulty": "Medium", "likes": 382, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17914, "totalSubmissionRaw": 31819}, "1231": {"acRate": 58.62803533196338, "difficulty": "Hard", "likes": 975, "dislikes": 59, "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": 54493, "totalSubmissionRaw": 92947}, "1232": {"acRate": 39.503338416487274, "difficulty": "Easy", "likes": 2588, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "1232", "paidOnly": false, "title": "Check If It Is a Straight Line", "titleSlug": "check-if-it-is-a-straight-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 256716, "totalSubmissionRaw": 649856}, "1233": {"acRate": 65.95473500550654, "difficulty": "Medium", "likes": 806, "dislikes": 112, "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": 53300, "totalSubmissionRaw": 80813}, "1234": {"acRate": 38.38347673338778, "difficulty": "Medium", "likes": 1181, "dislikes": 211, "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": 34306, "totalSubmissionRaw": 89377}, "1235": {"acRate": 54.48366531887977, "difficulty": "Hard", "likes": 6758, "dislikes": 105, "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": 307496, "totalSubmissionRaw": 564382}, "1236": {"acRate": 67.86098172697957, "difficulty": "Medium", "likes": 283, "dislikes": 325, "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": 37880, "totalSubmissionRaw": 55820}, "1237": {"acRate": 69.60117283886888, "difficulty": "Medium", "likes": 511, "dislikes": 1420, "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": 67415, "totalSubmissionRaw": 96859}, "1238": {"acRate": 70.02540551104163, "difficulty": "Medium", "likes": 419, "dislikes": 189, "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": 17916, "totalSubmissionRaw": 25585}, "1239": {"acRate": 54.08630126389787, "difficulty": "Medium", "likes": 4405, "dislikes": 327, "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": 286672, "totalSubmissionRaw": 530027}, "1240": {"acRate": 54.22658554572271, "difficulty": "Hard", "likes": 678, "dislikes": 567, "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": 23530, "totalSubmissionRaw": 43392}, "1241": {"acRate": 65.84570064881797, "difficulty": "Easy", "likes": 176, "dislikes": 534, "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": 35317, "totalSubmissionRaw": 53636}, "1242": {"acRate": 49.09345498893355, "difficulty": "Medium", "likes": 526, "dislikes": 89, "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": 54344, "totalSubmissionRaw": 110695}, "1243": {"acRate": 52.196221721215885, "difficulty": "Easy", "likes": 151, "dislikes": 70, "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": 13428, "totalSubmissionRaw": 25726}, "1244": {"acRate": 67.90609359301693, "difficulty": "Medium", "likes": 768, "dislikes": 94, "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": 73672, "totalSubmissionRaw": 108491}, "1245": {"acRate": 61.15453004176488, "difficulty": "Medium", "likes": 846, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44367, "totalSubmissionRaw": 72549}, "1246": {"acRate": 46.42610497237569, "difficulty": "Hard", "likes": 309, "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": 10756, "totalSubmissionRaw": 23168}, "1247": {"acRate": 64.45853658536585, "difficulty": "Medium", "likes": 1369, "dislikes": 240, "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": 39642, "totalSubmissionRaw": 61500}, "1248": {"acRate": 65.90566046893123, "difficulty": "Medium", "likes": 3840, "dislikes": 79, "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": 135792, "totalSubmissionRaw": 206041}, "1249": {"acRate": 68.93357230872633, "difficulty": "Medium", "likes": 6839, "dislikes": 143, "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": 738439, "totalSubmissionRaw": 1071231}, "1250": {"acRate": 59.39476877791836, "difficulty": "Hard", "likes": 502, "dislikes": 373, "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": 23003, "totalSubmissionRaw": 38729}, "1251": {"acRate": 39.73097914811848, "difficulty": "Easy", "likes": 1085, "dislikes": 146, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 222684, "totalSubmissionRaw": 560481}, "1252": {"acRate": 78.68556487092222, "difficulty": "Easy", "likes": 1204, "dislikes": 1507, "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": 113751, "totalSubmissionRaw": 144564}, "1253": {"acRate": 45.88461202758139, "difficulty": "Medium", "likes": 448, "dislikes": 31, "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": 26285, "totalSubmissionRaw": 57285}, "1254": {"acRate": 66.3508077049457, "difficulty": "Medium", "likes": 4503, "dislikes": 163, "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": 224138, "totalSubmissionRaw": 337808}, "1255": {"acRate": 82.26872246696036, "difficulty": "Hard", "likes": 1713, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1255", "paidOnly": false, "title": "Maximum Score Words Formed by Letters", "titleSlug": "maximum-score-words-formed-by-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112048, "totalSubmissionRaw": 136198}, "1256": {"acRate": 69.81454807346057, "difficulty": "Medium", "likes": 77, "dislikes": 250, "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": 7754, "totalSubmissionRaw": 11107}, "1257": {"acRate": 65.40855590765052, "difficulty": "Medium", "likes": 432, "dislikes": 34, "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": 23118, "totalSubmissionRaw": 35344}, "1258": {"acRate": 56.255472443899635, "difficulty": "Medium", "likes": 350, "dislikes": 158, "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": 22487, "totalSubmissionRaw": 39973}, "1259": {"acRate": 59.65329883570505, "difficulty": "Hard", "likes": 231, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11528, "totalSubmissionRaw": 19325}, "1260": {"acRate": 67.39364396049633, "difficulty": "Easy", "likes": 1721, "dislikes": 340, "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": 106455, "totalSubmissionRaw": 157960}, "1261": {"acRate": 77.30633929212435, "difficulty": "Medium", "likes": 980, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64608, "totalSubmissionRaw": 83574}, "1262": {"acRate": 50.67705245998815, "difficulty": "Medium", "likes": 1779, "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": 54715, "totalSubmissionRaw": 107968}, "1263": {"acRate": 49.00756143667297, "difficulty": "Hard", "likes": 845, "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": 27999, "totalSubmissionRaw": 57132}, "1264": {"acRate": 65.0479083898107, "difficulty": "Medium", "likes": 247, "dislikes": 21, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41751, "totalSubmissionRaw": 64185}, "1265": {"acRate": 94.02050483420933, "difficulty": "Medium", "likes": 577, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57958, "totalSubmissionRaw": 61644}, "1266": {"acRate": 82.46229918765319, "difficulty": "Easy", "likes": 2184, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231141, "totalSubmissionRaw": 280299}, "1267": {"acRate": 60.3765886696995, "difficulty": "Medium", "likes": 1289, "dislikes": 85, "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": 59192, "totalSubmissionRaw": 98038}, "1268": {"acRate": 65.12980981819643, "difficulty": "Medium", "likes": 4666, "dislikes": 239, "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": 307838, "totalSubmissionRaw": 472653}, "1269": {"acRate": 50.41520157455936, "difficulty": "Hard", "likes": 1529, "dislikes": 63, "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": 91189, "totalSubmissionRaw": 180876}, "1270": {"acRate": 84.79055645061347, "difficulty": "Medium", "likes": 417, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1270", "paidOnly": true, "title": "All People Report to the Given Manager", "titleSlug": "all-people-report-to-the-given-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54734, "totalSubmissionRaw": 64552}, "1271": {"acRate": 57.9730724729147, "difficulty": "Easy", "likes": 77, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11023, "totalSubmissionRaw": 19014}, "1272": {"acRate": 66.04710375556971, "difficulty": "Medium", "likes": 460, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36316, "totalSubmissionRaw": 54985}, "1273": {"acRate": 61.28163704900377, "difficulty": "Medium", "likes": 225, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-tree-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10242, "totalSubmissionRaw": 16713}, "1274": {"acRate": 68.65836726048997, "difficulty": "Hard", "likes": 526, "dislikes": 58, "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": 29175, "totalSubmissionRaw": 42493}, "1275": {"acRate": 53.87823043598882, "difficulty": "Easy", "likes": 1475, "dislikes": 341, "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": 126234, "totalSubmissionRaw": 234295}, "1276": {"acRate": 51.1243373209042, "difficulty": "Medium", "likes": 322, "dislikes": 234, "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": 25941, "totalSubmissionRaw": 50741}, "1277": {"acRate": 75.14236690467666, "difficulty": "Medium", "likes": 4821, "dislikes": 80, "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": 222470, "totalSubmissionRaw": 296064}, "1278": {"acRate": 60.989788913677714, "difficulty": "Hard", "likes": 1135, "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": 28431, "totalSubmissionRaw": 46616}, "1279": {"acRate": 73.07872661907987, "difficulty": "Easy", "likes": 73, "dislikes": 349, "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": 14026, "totalSubmissionRaw": 19193}, "1280": {"acRate": 56.973784616573454, "difficulty": "Easy", "likes": 1600, "dislikes": 211, "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": 235924, "totalSubmissionRaw": 414099}, "1281": {"acRate": 86.50081580440428, "difficulty": "Easy", "likes": 2544, "dislikes": 230, "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": 490924, "totalSubmissionRaw": 567536}, "1282": {"acRate": 87.46601814894271, "difficulty": "Medium", "likes": 2968, "dislikes": 699, "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": 207520, "totalSubmissionRaw": 237258}, "1283": {"acRate": 59.85279045933104, "difficulty": "Medium", "likes": 2836, "dislikes": 199, "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": 179872, "totalSubmissionRaw": 300524}, "1284": {"acRate": 72.1199012475148, "difficulty": "Hard", "likes": 958, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33010, "totalSubmissionRaw": 45771}, "1285": {"acRate": 82.28592193578727, "difficulty": "Medium", "likes": 558, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1285", "paidOnly": true, "title": "Find the Start and End Number of Continuous Ranges", "titleSlug": "find-the-start-and-end-number-of-continuous-ranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38495, "totalSubmissionRaw": 46782}, "1286": {"acRate": 73.25722906713604, "difficulty": "Medium", "likes": 1361, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72836, "totalSubmissionRaw": 99425}, "1287": {"acRate": 60.97522182206519, "difficulty": "Easy", "likes": 1690, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214684, "totalSubmissionRaw": 352084}, "1288": {"acRate": 56.37715840840841, "difficulty": "Medium", "likes": 2215, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1288", "paidOnly": false, "title": "Remove Covered Intervals", "titleSlug": "remove-covered-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120151, "totalSubmissionRaw": 213120}, "1289": {"acRate": 64.41515045807553, "difficulty": "Hard", "likes": 2226, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140340, "totalSubmissionRaw": 217868}, "1290": {"acRate": 81.12066330298232, "difficulty": "Easy", "likes": 4127, "dislikes": 158, "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": 472362, "totalSubmissionRaw": 582296}, "1291": {"acRate": 65.3136497731975, "difficulty": "Medium", "likes": 2839, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214974, "totalSubmissionRaw": 329141}, "1292": {"acRate": 53.4380041208133, "difficulty": "Medium", "likes": 1072, "dislikes": 91, "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": 33457, "totalSubmissionRaw": 62609}, "1293": {"acRate": 45.23207423618411, "difficulty": "Hard", "likes": 4478, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1293", "paidOnly": false, "title": "Shortest Path in a Grid with Obstacles Elimination", "titleSlug": "shortest-path-in-a-grid-with-obstacles-elimination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209989, "totalSubmissionRaw": 464246}, "1294": {"acRate": 66.74009551355351, "difficulty": "Easy", "likes": 138, "dislikes": 29, "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": 39689, "totalSubmissionRaw": 59468}, "1295": {"acRate": 77.27069034107798, "difficulty": "Easy", "likes": 2351, "dislikes": 128, "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": 675930, "totalSubmissionRaw": 874756}, "1296": {"acRate": 56.730886394714396, "difficulty": "Medium", "likes": 1728, "dislikes": 109, "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": 83799, "totalSubmissionRaw": 147716}, "1297": {"acRate": 51.938801397264015, "difficulty": "Medium", "likes": 1065, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "1297", "paidOnly": false, "title": "Maximum Number of Occurrences of a Substring", "titleSlug": "maximum-number-of-occurrences-of-a-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53230, "totalSubmissionRaw": 102486}, "1298": {"acRate": 58.14971800889761, "difficulty": "Hard", "likes": 342, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16600, "totalSubmissionRaw": 28547}, "1299": {"acRate": 71.26535719772907, "difficulty": "Easy", "likes": 2558, "dislikes": 239, "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": 384989, "totalSubmissionRaw": 540205}, "1300": {"acRate": 44.41403362897265, "difficulty": "Medium", "likes": 1134, "dislikes": 148, "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": 38459, "totalSubmissionRaw": 86592}, "1301": {"acRate": 39.479252380392616, "difficulty": "Hard", "likes": 509, "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": 13434, "totalSubmissionRaw": 34028}, "1302": {"acRate": 86.31622228216604, "difficulty": "Medium", "likes": 4673, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1302", "paidOnly": false, "title": "Deepest Leaves Sum", "titleSlug": "deepest-leaves-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329589, "totalSubmissionRaw": 381839}, "1303": {"acRate": 89.51503345038833, "difficulty": "Easy", "likes": 330, "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": 69845, "totalSubmissionRaw": 78026}, "1304": {"acRate": 76.19551994630648, "difficulty": "Easy", "likes": 1972, "dislikes": 592, "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": 217971, "totalSubmissionRaw": 286068}, "1305": {"acRate": 79.80296110783736, "difficulty": "Medium", "likes": 3045, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1305", "paidOnly": false, "title": "All Elements in Two Binary Search Trees", "titleSlug": "all-elements-in-two-binary-search-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216681, "totalSubmissionRaw": 271520}, "1306": {"acRate": 64.86266038892732, "difficulty": "Medium", "likes": 4123, "dislikes": 100, "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": 230614, "totalSubmissionRaw": 355542}, "1307": {"acRate": 34.12105074504583, "difficulty": "Hard", "likes": 499, "dislikes": 126, "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": 13327, "totalSubmissionRaw": 39058}, "1308": {"acRate": 86.37511941407494, "difficulty": "Medium", "likes": 214, "dislikes": 60, "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": 40687, "totalSubmissionRaw": 47105}, "1309": {"acRate": 79.65662268825258, "difficulty": "Easy", "likes": 1525, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1309", "paidOnly": false, "title": "Decrypt String from Alphabet to Integer Mapping", "titleSlug": "decrypt-string-from-alphabet-to-integer-mapping", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124434, "totalSubmissionRaw": 156213}, "1310": {"acRate": 72.8319030792529, "difficulty": "Medium", "likes": 1478, "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": 57712, "totalSubmissionRaw": 79240}, "1311": {"acRate": 47.224720673182624, "difficulty": "Medium", "likes": 383, "dislikes": 417, "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": 23627, "totalSubmissionRaw": 50031}, "1312": {"acRate": 70.61356161448991, "difficulty": "Hard", "likes": 4967, "dislikes": 62, "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": 168109, "totalSubmissionRaw": 238069}, "1313": {"acRate": 85.7321365886335, "difficulty": "Easy", "likes": 1259, "dislikes": 1317, "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": 266206, "totalSubmissionRaw": 310509}, "1314": {"acRate": 75.45260095824777, "difficulty": "Medium", "likes": 2373, "dislikes": 371, "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": 88189, "totalSubmissionRaw": 116880}, "1315": {"acRate": 85.5037088873338, "difficulty": "Medium", "likes": 2726, "dislikes": 75, "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": 152731, "totalSubmissionRaw": 178625}, "1316": {"acRate": 50.338105391410295, "difficulty": "Hard", "likes": 311, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1316", "paidOnly": false, "title": "Distinct Echo Substrings", "titleSlug": "distinct-echo-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16526, "totalSubmissionRaw": 32830}, "1317": {"acRate": 54.07197961392119, "difficulty": "Easy", "likes": 408, "dislikes": 311, "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": 46470, "totalSubmissionRaw": 85941}, "1318": {"acRate": 71.02462858279124, "difficulty": "Medium", "likes": 1946, "dislikes": 97, "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": 125014, "totalSubmissionRaw": 176015}, "1319": {"acRate": 62.752215904642895, "difficulty": "Medium", "likes": 4949, "dislikes": 69, "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": 216428, "totalSubmissionRaw": 344893}, "1320": {"acRate": 59.194947209653094, "difficulty": "Hard", "likes": 989, "dislikes": 37, "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": 31397, "totalSubmissionRaw": 53040}, "1321": {"acRate": 50.28631697209054, "difficulty": "Medium", "likes": 722, "dislikes": 276, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87728, "totalSubmissionRaw": 174457}, "1322": {"acRate": 59.586693265151304, "difficulty": "Easy", "likes": 258, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42415, "totalSubmissionRaw": 71182}, "1323": {"acRate": 82.32230536338965, "difficulty": "Easy", "likes": 2770, "dislikes": 217, "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": 262390, "totalSubmissionRaw": 318735}, "1324": {"acRate": 63.89479821617107, "difficulty": "Medium", "likes": 772, "dislikes": 115, "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": 40547, "totalSubmissionRaw": 63459}, "1325": {"acRate": 77.51398462526402, "difficulty": "Medium", "likes": 2716, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1325", "paidOnly": false, "title": "Delete Leaves With a Given Value", "titleSlug": "delete-leaves-with-a-given-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208825, "totalSubmissionRaw": 269403}, "1326": {"acRate": 50.954072599775515, "difficulty": "Hard", "likes": 3369, "dislikes": 193, "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": 132101, "totalSubmissionRaw": 259256}, "1327": {"acRate": 70.43545693898099, "difficulty": "Easy", "likes": 344, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1327", "paidOnly": false, "title": "List the Products Ordered in a Period", "titleSlug": "list-the-products-ordered-in-a-period", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112626, "totalSubmissionRaw": 159900}, "1328": {"acRate": 51.78547220270886, "difficulty": "Medium", "likes": 2316, "dislikes": 743, "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": 168077, "totalSubmissionRaw": 324564}, "1329": {"acRate": 82.91402163424915, "difficulty": "Medium", "likes": 3369, "dislikes": 228, "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": 163266, "totalSubmissionRaw": 196910}, "1330": {"acRate": 41.188796535587066, "difficulty": "Hard", "likes": 477, "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": 5897, "totalSubmissionRaw": 14317}, "1331": {"acRate": 62.235288442469624, "difficulty": "Easy", "likes": 1674, "dislikes": 87, "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": 116112, "totalSubmissionRaw": 186570}, "1332": {"acRate": 76.40663021385016, "difficulty": "Easy", "likes": 1650, "dislikes": 1759, "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": 133448, "totalSubmissionRaw": 174655}, "1333": {"acRate": 61.33126238989598, "difficulty": "Medium", "likes": 303, "dislikes": 223, "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": 30010, "totalSubmissionRaw": 48931}, "1334": {"acRate": 60.57956742605292, "difficulty": "Medium", "likes": 2627, "dislikes": 91, "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": 100888, "totalSubmissionRaw": 166538}, "1335": {"acRate": 59.6043406749915, "difficulty": "Hard", "likes": 3392, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "1335", "paidOnly": false, "title": "Minimum Difficulty of a Job Schedule", "titleSlug": "minimum-difficulty-of-a-job-schedule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194604, "totalSubmissionRaw": 326493}, "1336": {"acRate": 47.77357336696862, "difficulty": "Hard", "likes": 90, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12499, "totalSubmissionRaw": 26163}, "1337": {"acRate": 73.48541556239809, "difficulty": "Easy", "likes": 4150, "dislikes": 231, "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": 363234, "totalSubmissionRaw": 494294}, "1338": {"acRate": 68.94585575543027, "difficulty": "Medium", "likes": 3236, "dislikes": 149, "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": 193590, "totalSubmissionRaw": 280786}, "1339": {"acRate": 47.693254365048844, "difficulty": "Medium", "likes": 2988, "dislikes": 103, "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": 124012, "totalSubmissionRaw": 260020}, "1340": {"acRate": 63.28100409191061, "difficulty": "Hard", "likes": 1103, "dislikes": 41, "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": 32167, "totalSubmissionRaw": 50832}, "1341": {"acRate": 39.72550482358726, "difficulty": "Medium", "likes": 522, "dislikes": 180, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93718, "totalSubmissionRaw": 235919}, "1342": {"acRate": 85.1142964603619, "difficulty": "Easy", "likes": 3922, "dislikes": 169, "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": 672111, "totalSubmissionRaw": 789657}, "1343": {"acRate": 68.4427124807092, "difficulty": "Medium", "likes": 1575, "dislikes": 102, "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": 97125, "totalSubmissionRaw": 141907}, "1344": {"acRate": 63.76240628253625, "difficulty": "Medium", "likes": 1306, "dislikes": 239, "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": 121871, "totalSubmissionRaw": 191133}, "1345": {"acRate": 46.203616090837016, "difficulty": "Hard", "likes": 3715, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1345", "paidOnly": false, "title": "Jump Game IV", "titleSlug": "jump-game-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144536, "totalSubmissionRaw": 312824}, "1346": {"acRate": 37.18114369246371, "difficulty": "Easy", "likes": 1909, "dislikes": 204, "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": 350494, "totalSubmissionRaw": 942666}, "1347": {"acRate": 82.033071742244, "difficulty": "Medium", "likes": 2691, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277216, "totalSubmissionRaw": 337932}, "1348": {"acRate": 44.51207168787703, "difficulty": "Medium", "likes": 192, "dislikes": 296, "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": 32983, "totalSubmissionRaw": 74099}, "1349": {"acRate": 50.425453200147984, "difficulty": "Hard", "likes": 821, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1349", "paidOnly": false, "title": "Maximum Students Taking Exam", "titleSlug": "maximum-students-taking-exam", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16356, "totalSubmissionRaw": 32436}, "1350": {"acRate": 89.64160698802145, "difficulty": "Easy", "likes": 177, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1350", "paidOnly": true, "title": "Students With Invalid Departments", "titleSlug": "students-with-invalid-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55827, "totalSubmissionRaw": 62278}, "1351": {"acRate": 77.33771126138276, "difficulty": "Easy", "likes": 4930, "dislikes": 131, "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": 415725, "totalSubmissionRaw": 537545}, "1352": {"acRate": 51.35167019601135, "difficulty": "Medium", "likes": 1466, "dislikes": 69, "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": 87055, "totalSubmissionRaw": 169529}, "1353": {"acRate": 32.44667585964089, "difficulty": "Medium", "likes": 3010, "dislikes": 413, "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": 88473, "totalSubmissionRaw": 272672}, "1354": {"acRate": 36.17995057741508, "difficulty": "Hard", "likes": 2035, "dislikes": 165, "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": 66324, "totalSubmissionRaw": 183317}, "1355": {"acRate": 72.35099337748345, "difficulty": "Medium", "likes": 143, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29279, "totalSubmissionRaw": 40468}, "1356": {"acRate": 78.21488249104337, "difficulty": "Easy", "likes": 2437, "dislikes": 119, "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": 224210, "totalSubmissionRaw": 286659}, "1357": {"acRate": 71.1133143569898, "difficulty": "Medium", "likes": 189, "dislikes": 226, "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": 22235, "totalSubmissionRaw": 31267}, "1358": {"acRate": 66.79432897100334, "difficulty": "Medium", "likes": 3145, "dislikes": 51, "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": 104118, "totalSubmissionRaw": 155879}, "1359": {"acRate": 65.09785177514007, "difficulty": "Hard", "likes": 3014, "dislikes": 226, "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": 122576, "totalSubmissionRaw": 188295}, "1360": {"acRate": 49.73830124003457, "difficulty": "Easy", "likes": 363, "dislikes": 1269, "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": 51221, "totalSubmissionRaw": 102981}, "1361": {"acRate": 43.871251354467525, "difficulty": "Medium", "likes": 2092, "dislikes": 506, "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": 113770, "totalSubmissionRaw": 259327}, "1362": {"acRate": 60.66934259058364, "difficulty": "Medium", "likes": 320, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22370, "totalSubmissionRaw": 36872}, "1363": {"acRate": 32.64335798674479, "difficulty": "Hard", "likes": 595, "dislikes": 83, "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": 20392, "totalSubmissionRaw": 62467}, "1364": {"acRate": 75.06207207885035, "difficulty": "Medium", "likes": 88, "dislikes": 384, "categoryTitle": "Database", "frontendQuestionId": "1364", "paidOnly": true, "title": "Number of Trusted Contacts of a Customer", "titleSlug": "number-of-trusted-contacts-of-a-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19953, "totalSubmissionRaw": 26582}, "1365": {"acRate": 86.73950636692344, "difficulty": "Easy", "likes": 5419, "dislikes": 131, "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": 562785, "totalSubmissionRaw": 648822}, "1366": {"acRate": 58.373439464433, "difficulty": "Medium", "likes": 1432, "dislikes": 164, "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": 72892, "totalSubmissionRaw": 124870}, "1367": {"acRate": 43.8832707310026, "difficulty": "Medium", "likes": 2222, "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": 75940, "totalSubmissionRaw": 173050}, "1368": {"acRate": 62.03626990702384, "difficulty": "Hard", "likes": 1732, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1368", "paidOnly": false, "title": "Minimum Cost to Make at Least One Valid Path in a Grid", "titleSlug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47173, "totalSubmissionRaw": 76041}, "1369": {"acRate": 67.7012791572611, "difficulty": "Hard", "likes": 161, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1369", "paidOnly": true, "title": "Get the Second Most Recent Activity", "titleSlug": "get-the-second-most-recent-activity", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21594, "totalSubmissionRaw": 31896}, "1370": {"acRate": 76.39974022395843, "difficulty": "Easy", "likes": 772, "dislikes": 858, "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": 77642, "totalSubmissionRaw": 101626}, "1371": {"acRate": 63.90387560372246, "difficulty": "Medium", "likes": 1616, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27124, "totalSubmissionRaw": 42445}, "1372": {"acRate": 65.73920764043865, "difficulty": "Medium", "likes": 3397, "dislikes": 71, "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": 164370, "totalSubmissionRaw": 250035}, "1373": {"acRate": 41.102622881813886, "difficulty": "Hard", "likes": 2620, "dislikes": 180, "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": 72258, "totalSubmissionRaw": 175799}, "1374": {"acRate": 77.82131726230335, "difficulty": "Easy", "likes": 481, "dislikes": 1274, "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": 94135, "totalSubmissionRaw": 120963}, "1375": {"acRate": 65.71895914494057, "difficulty": "Medium", "likes": 934, "dislikes": 135, "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": 52633, "totalSubmissionRaw": 80088}, "1376": {"acRate": 60.004775018877986, "difficulty": "Medium", "likes": 4044, "dislikes": 294, "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": 216142, "totalSubmissionRaw": 360208}, "1377": {"acRate": 35.47678458434317, "difficulty": "Hard", "likes": 779, "dislikes": 142, "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": 29715, "totalSubmissionRaw": 83759}, "1378": {"acRate": 82.78823747560307, "difficulty": "Easy", "likes": 1120, "dislikes": 107, "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": 433078, "totalSubmissionRaw": 523116}, "1379": {"acRate": 85.8243069786295, "difficulty": "Easy", "likes": 1735, "dislikes": 1999, "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": 228670, "totalSubmissionRaw": 266440}, "1380": {"acRate": 71.4476015399166, "difficulty": "Easy", "likes": 1657, "dislikes": 86, "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": 107270, "totalSubmissionRaw": 150138}, "1381": {"acRate": 77.07677936065281, "difficulty": "Medium", "likes": 1802, "dislikes": 96, "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": 112213, "totalSubmissionRaw": 145586}, "1382": {"acRate": 81.52837055153269, "difficulty": "Medium", "likes": 3066, "dislikes": 74, "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": 153008, "totalSubmissionRaw": 187675}, "1383": {"acRate": 47.81178402708785, "difficulty": "Hard", "likes": 3069, "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": 94325, "totalSubmissionRaw": 197284}, "1384": {"acRate": 61.361224799151124, "difficulty": "Hard", "likes": 226, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16192, "totalSubmissionRaw": 26388}, "1385": {"acRate": 68.41600766834411, "difficulty": "Easy", "likes": 894, "dislikes": 3019, "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": 102780, "totalSubmissionRaw": 150228}, "1386": {"acRate": 41.9382564462375, "difficulty": "Medium", "likes": 895, "dislikes": 394, "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": 47818, "totalSubmissionRaw": 114020}, "1387": {"acRate": 70.00569670730317, "difficulty": "Medium", "likes": 1433, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1387", "paidOnly": false, "title": "Sort Integers by The Power Value", "titleSlug": "sort-integers-by-the-power-value", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92166, "totalSubmissionRaw": 131655}, "1388": {"acRate": 51.72472351355367, "difficulty": "Hard", "likes": 1047, "dislikes": 17, "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": 24367, "totalSubmissionRaw": 47109}, "1389": {"acRate": 85.85768474047642, "difficulty": "Easy", "likes": 2015, "dislikes": 1854, "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": 248301, "totalSubmissionRaw": 289201}, "1390": {"acRate": 42.64430868968957, "difficulty": "Medium", "likes": 408, "dislikes": 188, "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": 34205, "totalSubmissionRaw": 80210}, "1391": {"acRate": 47.894999999999996, "difficulty": "Medium", "likes": 816, "dislikes": 313, "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": 28737, "totalSubmissionRaw": 60000}, "1392": {"acRate": 45.90198585907693, "difficulty": "Hard", "likes": 1329, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1392", "paidOnly": false, "title": "Longest Happy Prefix", "titleSlug": "longest-happy-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43432, "totalSubmissionRaw": 94616}, "1393": {"acRate": 85.43874703340369, "difficulty": "Medium", "likes": 804, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1393", "paidOnly": false, "title": "Capital Gain/Loss", "titleSlug": "capital-gainloss", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110521, "totalSubmissionRaw": 129357}, "1394": {"acRate": 67.02625226312612, "difficulty": "Easy", "likes": 1139, "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": 124390, "totalSubmissionRaw": 185584}, "1395": {"acRate": 65.96237217850242, "difficulty": "Medium", "likes": 2675, "dislikes": 190, "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": 111983, "totalSubmissionRaw": 169768}, "1396": {"acRate": 74.69591876952501, "difficulty": "Medium", "likes": 3492, "dislikes": 173, "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": 231213, "totalSubmissionRaw": 309539}, "1397": {"acRate": 42.21186824564809, "difficulty": "Hard", "likes": 484, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6523, "totalSubmissionRaw": 15453}, "1398": {"acRate": 72.82823262089043, "difficulty": "Medium", "likes": 298, "dislikes": 16, "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": 51282, "totalSubmissionRaw": 70415}, "1399": {"acRate": 66.40603586318325, "difficulty": "Easy", "likes": 439, "dislikes": 974, "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": 46032, "totalSubmissionRaw": 69319}, "1400": {"acRate": 62.14800028516433, "difficulty": "Medium", "likes": 1043, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1400", "paidOnly": false, "title": "Construct K Palindrome Strings", "titleSlug": "construct-k-palindrome-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52305, "totalSubmissionRaw": 84162}, "1401": {"acRate": 46.33223684210526, "difficulty": "Medium", "likes": 366, "dislikes": 81, "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": 16902, "totalSubmissionRaw": 36480}, "1402": {"acRate": 76.19230379692856, "difficulty": "Hard", "likes": 3270, "dislikes": 304, "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": 142936, "totalSubmissionRaw": 187599}, "1403": {"acRate": 72.61536318130703, "difficulty": "Easy", "likes": 578, "dislikes": 497, "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": 72969, "totalSubmissionRaw": 100487}, "1404": {"acRate": 61.401611186584404, "difficulty": "Medium", "likes": 1358, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141920, "totalSubmissionRaw": 231134}, "1405": {"acRate": 57.42282682855512, "difficulty": "Medium", "likes": 1994, "dislikes": 249, "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": 82481, "totalSubmissionRaw": 143638}, "1406": {"acRate": 63.899282030538984, "difficulty": "Hard", "likes": 2166, "dislikes": 70, "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": 88466, "totalSubmissionRaw": 138446}, "1407": {"acRate": 57.77404841478167, "difficulty": "Easy", "likes": 624, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120835, "totalSubmissionRaw": 209151}, "1408": {"acRate": 63.88926976062812, "difficulty": "Easy", "likes": 899, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88532, "totalSubmissionRaw": 138571}, "1409": {"acRate": 84.19079953611106, "difficulty": "Medium", "likes": 486, "dislikes": 621, "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": 50091, "totalSubmissionRaw": 59497}, "1410": {"acRate": 50.84538813352373, "difficulty": "Medium", "likes": 187, "dislikes": 321, "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": 24569, "totalSubmissionRaw": 48321}, "1411": {"acRate": 63.549174280687815, "difficulty": "Hard", "likes": 1071, "dislikes": 50, "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": 33594, "totalSubmissionRaw": 52863}, "1412": {"acRate": 59.14257363222227, "difficulty": "Hard", "likes": 212, "dislikes": 23, "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": 26225, "totalSubmissionRaw": 44342}, "1413": {"acRate": 65.6305289908687, "difficulty": "Easy", "likes": 1551, "dislikes": 332, "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": 142811, "totalSubmissionRaw": 217600}, "1414": {"acRate": 65.30174707680143, "difficulty": "Medium", "likes": 1009, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1414", "paidOnly": false, "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "titleSlug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42947, "totalSubmissionRaw": 65767}, "1415": {"acRate": 74.4835734430978, "difficulty": "Medium", "likes": 952, "dislikes": 26, "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": 39086, "totalSubmissionRaw": 52476}, "1416": {"acRate": 47.71222106224716, "difficulty": "Hard", "likes": 1578, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1416", "paidOnly": false, "title": "Restore The Array", "titleSlug": "restore-the-array", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58499, "totalSubmissionRaw": 122608}, "1417": {"acRate": 52.81476887153854, "difficulty": "Easy", "likes": 587, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1417", "paidOnly": false, "title": "Reformat The String", "titleSlug": "reformat-the-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57904, "totalSubmissionRaw": 109636}, "1418": {"acRate": 74.53544390915347, "difficulty": "Medium", "likes": 387, "dislikes": 474, "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": 28158, "totalSubmissionRaw": 37778}, "1419": {"acRate": 50.27462655921154, "difficulty": "Medium", "likes": 1019, "dislikes": 88, "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": 48970, "totalSubmissionRaw": 97405}, "1420": {"acRate": 68.54290138288216, "difficulty": "Hard", "likes": 1343, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1420", "paidOnly": false, "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "titleSlug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64187, "totalSubmissionRaw": 93645}, "1421": {"acRate": 82.72653972585748, "difficulty": "Easy", "likes": 57, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26676, "totalSubmissionRaw": 32246}, "1422": {"acRate": 62.237775788368154, "difficulty": "Easy", "likes": 1528, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160593, "totalSubmissionRaw": 258031}, "1423": {"acRate": 52.83083152861378, "difficulty": "Medium", "likes": 6055, "dislikes": 229, "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": 269805, "totalSubmissionRaw": 510696}, "1424": {"acRate": 56.906067943605876, "difficulty": "Medium", "likes": 2146, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1424", "paidOnly": false, "title": "Diagonal Traverse II", "titleSlug": "diagonal-traverse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133723, "totalSubmissionRaw": 234989}, "1425": {"acRate": 56.677851111684674, "difficulty": "Hard", "likes": 2100, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1425", "paidOnly": false, "title": "Constrained Subsequence Sum", "titleSlug": "constrained-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76858, "totalSubmissionRaw": 135605}, "1426": {"acRate": 60.1763359806165, "difficulty": "Easy", "likes": 154, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125174, "totalSubmissionRaw": 208012}, "1427": {"acRate": 54.71257162713689, "difficulty": "Easy", "likes": 245, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80300, "totalSubmissionRaw": 146767}, "1428": {"acRate": 54.442424986451, "difficulty": "Medium", "likes": 1218, "dislikes": 148, "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": 181823, "totalSubmissionRaw": 333973}, "1429": {"acRate": 53.723581950318625, "difficulty": "Medium", "likes": 552, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85233, "totalSubmissionRaw": 158651}, "1430": {"acRate": 46.88669471636679, "difficulty": "Medium", "likes": 213, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44352, "totalSubmissionRaw": 94594}, "1431": {"acRate": 87.48673684829306, "difficulty": "Easy", "likes": 4374, "dislikes": 553, "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": 892945, "totalSubmissionRaw": 1020662}, "1432": {"acRate": 40.927716025626516, "difficulty": "Medium", "likes": 229, "dislikes": 289, "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": 18079, "totalSubmissionRaw": 44173}, "1433": {"acRate": 69.58219888499934, "difficulty": "Medium", "likes": 754, "dislikes": 147, "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": 42935, "totalSubmissionRaw": 61704}, "1434": {"acRate": 43.691403379867744, "difficulty": "Hard", "likes": 892, "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": 14866, "totalSubmissionRaw": 34025}, "1435": {"acRate": 75.2758948161247, "difficulty": "Easy", "likes": 151, "dislikes": 259, "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": 22987, "totalSubmissionRaw": 30537}, "1436": {"acRate": 79.52903559279248, "difficulty": "Easy", "likes": 2184, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 264645, "totalSubmissionRaw": 332765}, "1437": {"acRate": 57.98746249145845, "difficulty": "Easy", "likes": 624, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78072, "totalSubmissionRaw": 134636}, "1438": {"acRate": 49.48982104900219, "difficulty": "Medium", "likes": 3305, "dislikes": 138, "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": 130615, "totalSubmissionRaw": 263924}, "1439": {"acRate": 61.62365610761944, "difficulty": "Hard", "likes": 1221, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1439", "paidOnly": false, "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "titleSlug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34219, "totalSubmissionRaw": 55529}, "1440": {"acRate": 72.54453508170059, "difficulty": "Medium", "likes": 208, "dislikes": 24, "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": 28547, "totalSubmissionRaw": 39351}, "1441": {"acRate": 79.87163066611454, "difficulty": "Medium", "likes": 960, "dislikes": 478, "categoryTitle": "Algorithms", "frontendQuestionId": "1441", "paidOnly": false, "title": "Build an Array With Stack Operations", "titleSlug": "build-an-array-with-stack-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165879, "totalSubmissionRaw": 207682}, "1442": {"acRate": 84.95075699860098, "difficulty": "Medium", "likes": 1897, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122657, "totalSubmissionRaw": 144386}, "1443": {"acRate": 62.30126521842922, "difficulty": "Medium", "likes": 3607, "dislikes": 317, "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": 117437, "totalSubmissionRaw": 188499}, "1444": {"acRate": 62.15429536856797, "difficulty": "Hard", "likes": 1813, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1444", "paidOnly": false, "title": "Number of Ways of Cutting a Pizza", "titleSlug": "number-of-ways-of-cutting-a-pizza", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67691, "totalSubmissionRaw": 108908}, "1445": {"acRate": 86.73017242809964, "difficulty": "Medium", "likes": 239, "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": 52261, "totalSubmissionRaw": 60257}, "1446": {"acRate": 60.357310390219595, "difficulty": "Easy", "likes": 1722, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165982, "totalSubmissionRaw": 274999}, "1447": {"acRate": 66.66261545940691, "difficulty": "Medium", "likes": 411, "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": 32910, "totalSubmissionRaw": 49368}, "1448": {"acRate": 73.01815721147982, "difficulty": "Medium", "likes": 5761, "dislikes": 168, "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": 502831, "totalSubmissionRaw": 688639}, "1449": {"acRate": 48.0840376981448, "difficulty": "Hard", "likes": 686, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1449", "paidOnly": false, "title": "Form Largest Integer With Digits That Add up to Target", "titleSlug": "form-largest-integer-with-digits-that-add-up-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17806, "totalSubmissionRaw": 37031}, "1450": {"acRate": 75.6094419811234, "difficulty": "Easy", "likes": 873, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1450", "paidOnly": false, "title": "Number of Students Doing Homework at a Given Time", "titleSlug": "number-of-students-doing-homework-at-a-given-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123288, "totalSubmissionRaw": 163059}, "1451": {"acRate": 64.5656937942026, "difficulty": "Medium", "likes": 752, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1451", "paidOnly": false, "title": "Rearrange Words in a Sentence", "titleSlug": "rearrange-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51854, "totalSubmissionRaw": 80312}, "1452": {"acRate": 57.86510208426979, "difficulty": "Medium", "likes": 348, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1452", "paidOnly": false, "title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "titleSlug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24459, "totalSubmissionRaw": 42269}, "1453": {"acRate": 37.86377899464714, "difficulty": "Hard", "likes": 145, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6154, "totalSubmissionRaw": 16253}, "1454": {"acRate": 36.65224492134896, "difficulty": "Medium", "likes": 401, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38376, "totalSubmissionRaw": 104703}, "1455": {"acRate": 64.2853107572615, "difficulty": "Easy", "likes": 820, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79654, "totalSubmissionRaw": 123907}, "1456": {"acRate": 58.567237515032424, "difficulty": "Medium", "likes": 3441, "dislikes": 123, "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": 318016, "totalSubmissionRaw": 542993}, "1457": {"acRate": 68.38283703626702, "difficulty": "Medium", "likes": 3239, "dislikes": 126, "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": 217082, "totalSubmissionRaw": 317451}, "1458": {"acRate": 62.47388887103512, "difficulty": "Hard", "likes": 1647, "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": 77760, "totalSubmissionRaw": 124468}, "1459": {"acRate": 68.43328125625926, "difficulty": "Medium", "likes": 96, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17083, "totalSubmissionRaw": 24963}, "1460": {"acRate": 71.99885091138499, "difficulty": "Easy", "likes": 1033, "dislikes": 143, "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": 127821, "totalSubmissionRaw": 177532}, "1461": {"acRate": 56.52644544809824, "difficulty": "Medium", "likes": 2231, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 121152, "totalSubmissionRaw": 214328}, "1462": {"acRate": 49.8235549906342, "difficulty": "Medium", "likes": 1434, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1462", "paidOnly": false, "title": "Course Schedule IV", "titleSlug": "course-schedule-iv", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59580, "totalSubmissionRaw": 119582}, "1463": {"acRate": 71.89228523717186, "difficulty": "Hard", "likes": 4075, "dislikes": 47, "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": 170916, "totalSubmissionRaw": 237738}, "1464": {"acRate": 82.65204298990896, "difficulty": "Easy", "likes": 2455, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375213, "totalSubmissionRaw": 453967}, "1465": {"acRate": 41.03393481234788, "difficulty": "Medium", "likes": 2612, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167075, "totalSubmissionRaw": 407163}, "1466": {"acRate": 64.4237765662125, "difficulty": "Medium", "likes": 4069, "dislikes": 116, "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": 186818, "totalSubmissionRaw": 289983}, "1467": {"acRate": 60.40173184754063, "difficulty": "Hard", "likes": 282, "dislikes": 171, "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": 8510, "totalSubmissionRaw": 14089}, "1468": {"acRate": 78.61042023321167, "difficulty": "Medium", "likes": 124, "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": 24337, "totalSubmissionRaw": 30959}, "1469": {"acRate": 83.65121788252445, "difficulty": "Easy", "likes": 506, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55084, "totalSubmissionRaw": 65850}, "1470": {"acRate": 88.49886759738278, "difficulty": "Easy", "likes": 5693, "dislikes": 300, "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": 690077, "totalSubmissionRaw": 779758}, "1471": {"acRate": 61.237810882063336, "difficulty": "Medium", "likes": 690, "dislikes": 153, "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": 38559, "totalSubmissionRaw": 62966}, "1472": {"acRate": 77.55050821934998, "difficulty": "Medium", "likes": 3793, "dislikes": 235, "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": 234840, "totalSubmissionRaw": 302822}, "1473": {"acRate": 61.034258840197566, "difficulty": "Hard", "likes": 2053, "dislikes": 150, "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": 62034, "totalSubmissionRaw": 101638}, "1474": {"acRate": 73.16194416680226, "difficulty": "Easy", "likes": 402, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31475, "totalSubmissionRaw": 43021}, "1475": {"acRate": 77.82744747429592, "difficulty": "Easy", "likes": 2086, "dislikes": 117, "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": 149726, "totalSubmissionRaw": 192382}, "1476": {"acRate": 88.16204235757675, "difficulty": "Medium", "likes": 620, "dislikes": 1437, "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": 107399, "totalSubmissionRaw": 121820}, "1477": {"acRate": 36.50398597060873, "difficulty": "Medium", "likes": 1685, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1477", "paidOnly": false, "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "titleSlug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47668, "totalSubmissionRaw": 130583}, "1478": {"acRate": 55.31929286551818, "difficulty": "Hard", "likes": 1099, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1478", "paidOnly": false, "title": "Allocate Mailboxes", "titleSlug": "allocate-mailboxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24529, "totalSubmissionRaw": 44341}, "1479": {"acRate": 77.4849826807559, "difficulty": "Hard", "likes": 150, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17672, "totalSubmissionRaw": 22807}, "1480": {"acRate": 86.74126018061388, "difficulty": "Easy", "likes": 7798, "dislikes": 341, "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": 1820557, "totalSubmissionRaw": 2098835}, "1481": {"acRate": 62.96126970932801, "difficulty": "Medium", "likes": 2223, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242382, "totalSubmissionRaw": 384970}, "1482": {"acRate": 51.152465062111794, "difficulty": "Medium", "likes": 3734, "dislikes": 104, "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": 126498, "totalSubmissionRaw": 247296}, "1483": {"acRate": 34.69915455311401, "difficulty": "Hard", "likes": 1911, "dislikes": 116, "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": 35830, "totalSubmissionRaw": 103259}, "1484": {"acRate": 76.74623962800541, "difficulty": "Easy", "likes": 1383, "dislikes": 102, "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": 205978, "totalSubmissionRaw": 268389}, "1485": {"acRate": 80.51861893910987, "difficulty": "Medium", "likes": 417, "dislikes": 84, "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": 27912, "totalSubmissionRaw": 34666}, "1486": {"acRate": 85.87659036453498, "difficulty": "Easy", "likes": 1375, "dislikes": 331, "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": 194257, "totalSubmissionRaw": 226205}, "1487": {"acRate": 37.027574663025284, "difficulty": "Medium", "likes": 435, "dislikes": 712, "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": 33624, "totalSubmissionRaw": 90806}, "1488": {"acRate": 26.957267506898354, "difficulty": "Medium", "likes": 1512, "dislikes": 288, "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": 36147, "totalSubmissionRaw": 134090}, "1489": {"acRate": 67.76278274092378, "difficulty": "Hard", "likes": 1823, "dislikes": 156, "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": 53475, "totalSubmissionRaw": 78915}, "1490": {"acRate": 83.1395514926439, "difficulty": "Medium", "likes": 408, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29103, "totalSubmissionRaw": 35005}, "1491": {"acRate": 63.440541004787185, "difficulty": "Easy", "likes": 2219, "dislikes": 186, "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": 339785, "totalSubmissionRaw": 535596}, "1492": {"acRate": 67.51500586062633, "difficulty": "Medium", "likes": 1742, "dislikes": 291, "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": 228674, "totalSubmissionRaw": 338701}, "1493": {"acRate": 67.3419744848672, "difficulty": "Medium", "likes": 3881, "dislikes": 77, "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": 270475, "totalSubmissionRaw": 401641}, "1494": {"acRate": 29.586056644880177, "difficulty": "Hard", "likes": 1023, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1494", "paidOnly": false, "title": "Parallel Courses II", "titleSlug": "parallel-courses-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18333, "totalSubmissionRaw": 61965}, "1495": {"acRate": 48.994264224880304, "difficulty": "Easy", "likes": 85, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1495", "paidOnly": true, "title": "Friendly Movies Streamed Last Month", "titleSlug": "friendly-movies-streamed-last-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31006, "totalSubmissionRaw": 63286}, "1496": {"acRate": 62.38885202388852, "difficulty": "Easy", "likes": 1451, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1496", "paidOnly": false, "title": "Path Crossing", "titleSlug": "path-crossing", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159834, "totalSubmissionRaw": 256190}, "1497": {"acRate": 38.52059738928951, "difficulty": "Medium", "likes": 1700, "dislikes": 91, "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": 50373, "totalSubmissionRaw": 130769}, "1498": {"acRate": 43.78367671817745, "difficulty": "Medium", "likes": 3866, "dislikes": 367, "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": 119367, "totalSubmissionRaw": 272629}, "1499": {"acRate": 44.16068185570414, "difficulty": "Hard", "likes": 1307, "dislikes": 59, "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": 42797, "totalSubmissionRaw": 96912}, "1500": {"acRate": 43.58395732895682, "difficulty": "Medium", "likes": 47, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4249, "totalSubmissionRaw": 9749}, "1501": {"acRate": 49.9771859152359, "difficulty": "Medium", "likes": 295, "dislikes": 143, "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": 38336, "totalSubmissionRaw": 76707}, "1502": {"acRate": 69.5836222105732, "difficulty": "Easy", "likes": 2158, "dislikes": 110, "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": 246898, "totalSubmissionRaw": 354821}, "1503": {"acRate": 68.53153830803002, "difficulty": "Medium", "likes": 1489, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89287, "totalSubmissionRaw": 130286}, "1504": {"acRate": 57.20868919832065, "difficulty": "Medium", "likes": 2078, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1504", "paidOnly": false, "title": "Count Submatrices With All Ones", "titleSlug": "count-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51644, "totalSubmissionRaw": 90273}, "1505": {"acRate": 39.37453924649827, "difficulty": "Hard", "likes": 484, "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": 10148, "totalSubmissionRaw": 25773}, "1506": {"acRate": 78.36970039570379, "difficulty": "Medium", "likes": 468, "dislikes": 199, "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": 34659, "totalSubmissionRaw": 44225}, "1507": {"acRate": 65.93163095727381, "difficulty": "Easy", "likes": 462, "dislikes": 434, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73792, "totalSubmissionRaw": 111922}, "1508": {"acRate": 58.37502471069479, "difficulty": "Medium", "likes": 926, "dislikes": 155, "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": 38388, "totalSubmissionRaw": 65761}, "1509": {"acRate": 55.03620761956025, "difficulty": "Medium", "likes": 1666, "dislikes": 184, "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": 87932, "totalSubmissionRaw": 159771}, "1510": {"acRate": 59.79275124374005, "difficulty": "Hard", "likes": 1587, "dislikes": 69, "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": 72473, "totalSubmissionRaw": 121207}, "1511": {"acRate": 68.00569477924641, "difficulty": "Easy", "likes": 315, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42035, "totalSubmissionRaw": 61811}, "1512": {"acRate": 89.04698391343176, "difficulty": "Easy", "likes": 5354, "dislikes": 247, "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": 767766, "totalSubmissionRaw": 862204}, "1513": {"acRate": 46.82919824818716, "difficulty": "Medium", "likes": 863, "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": 45658, "totalSubmissionRaw": 97499}, "1514": {"acRate": 55.19218774364572, "difficulty": "Medium", "likes": 3101, "dislikes": 71, "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": 141578, "totalSubmissionRaw": 256518}, "1515": {"acRate": 35.53296938287755, "difficulty": "Hard", "likes": 228, "dislikes": 263, "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": 14124, "totalSubmissionRaw": 39749}, "1516": {"acRate": 62.26053639846744, "difficulty": "Hard", "likes": 33, "dislikes": 61, "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": 2275, "totalSubmissionRaw": 3654}, "1517": {"acRate": 44.465231394869186, "difficulty": "Easy", "likes": 428, "dislikes": 246, "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": 106716, "totalSubmissionRaw": 240000}, "1518": {"acRate": 61.00890849668153, "difficulty": "Easy", "likes": 1037, "dislikes": 79, "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": 78962, "totalSubmissionRaw": 129427}, "1519": {"acRate": 54.999441696716524, "difficulty": "Medium", "likes": 2222, "dislikes": 802, "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": 83735, "totalSubmissionRaw": 152247}, "1520": {"acRate": 39.23644607370249, "difficulty": "Hard", "likes": 803, "dislikes": 75, "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": 16269, "totalSubmissionRaw": 41464}, "1521": {"acRate": 44.72749068801644, "difficulty": "Hard", "likes": 379, "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": 10447, "totalSubmissionRaw": 23357}, "1522": {"acRate": 74.37710029971845, "difficulty": "Medium", "likes": 602, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49135, "totalSubmissionRaw": 66062}, "1523": {"acRate": 49.89177569236186, "difficulty": "Easy", "likes": 2742, "dislikes": 157, "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": 337224, "totalSubmissionRaw": 675911}, "1524": {"acRate": 43.587244747637286, "difficulty": "Medium", "likes": 1334, "dislikes": 58, "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": 38464, "totalSubmissionRaw": 88246}, "1525": {"acRate": 68.29014500537058, "difficulty": "Medium", "likes": 2032, "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": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101725, "totalSubmissionRaw": 148960}, "1526": {"acRate": 69.69473475922362, "difficulty": "Hard", "likes": 1426, "dislikes": 68, "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": 38744, "totalSubmissionRaw": 55591}, "1527": {"acRate": 40.27307804198374, "difficulty": "Easy", "likes": 626, "dislikes": 558, "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": 210418, "totalSubmissionRaw": 522480}, "1528": {"acRate": 84.67318618109958, "difficulty": "Easy", "likes": 2720, "dislikes": 510, "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": 383915, "totalSubmissionRaw": 453408}, "1529": {"acRate": 73.2799168672063, "difficulty": "Medium", "likes": 1016, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53594, "totalSubmissionRaw": 73136}, "1530": {"acRate": 63.4200823532578, "difficulty": "Medium", "likes": 1748, "dislikes": 56, "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": 47130, "totalSubmissionRaw": 74314}, "1531": {"acRate": 52.571495633711905, "difficulty": "Hard", "likes": 2415, "dislikes": 212, "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": 98550, "totalSubmissionRaw": 187459}, "1532": {"acRate": 68.32708785831922, "difficulty": "Medium", "likes": 152, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1532", "paidOnly": true, "title": "The Most Recent Three Orders", "titleSlug": "the-most-recent-three-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28627, "totalSubmissionRaw": 41897}, "1533": {"acRate": 56.13450973863826, "difficulty": "Medium", "likes": 245, "dislikes": 32, "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": 13488, "totalSubmissionRaw": 24028}, "1534": {"acRate": 81.23694475052221, "difficulty": "Easy", "likes": 752, "dislikes": 1194, "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": 120171, "totalSubmissionRaw": 147927}, "1535": {"acRate": 56.97407873342317, "difficulty": "Medium", "likes": 1562, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114580, "totalSubmissionRaw": 201109}, "1536": {"acRate": 47.43940394228049, "difficulty": "Medium", "likes": 558, "dislikes": 70, "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": 15090, "totalSubmissionRaw": 31809}, "1537": {"acRate": 39.420455743482385, "difficulty": "Hard", "likes": 975, "dislikes": 50, "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": 26174, "totalSubmissionRaw": 66397}, "1538": {"acRate": 69.98635743519782, "difficulty": "Medium", "likes": 134, "dislikes": 115, "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": 4104, "totalSubmissionRaw": 5864}, "1539": {"acRate": 60.03693981323931, "difficulty": "Easy", "likes": 6518, "dislikes": 435, "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": 425167, "totalSubmissionRaw": 708177}, "1540": {"acRate": 34.862569628344446, "difficulty": "Medium", "likes": 382, "dislikes": 312, "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": 19089, "totalSubmissionRaw": 54755}, "1541": {"acRate": 52.41992368423289, "difficulty": "Medium", "likes": 1091, "dislikes": 261, "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": 61682, "totalSubmissionRaw": 117669}, "1542": {"acRate": 43.52107601777351, "difficulty": "Hard", "likes": 805, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1542", "paidOnly": false, "title": "Find Longest Awesome Substring", "titleSlug": "find-longest-awesome-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14496, "totalSubmissionRaw": 33308}, "1543": {"acRate": 59.45226321795359, "difficulty": "Easy", "likes": 88, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "1543", "paidOnly": true, "title": "Fix Product Name Format", "titleSlug": "fix-product-name-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20319, "totalSubmissionRaw": 34177}, "1544": {"acRate": 68.36813782048459, "difficulty": "Easy", "likes": 2991, "dislikes": 165, "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": 310496, "totalSubmissionRaw": 454154}, "1545": {"acRate": 58.71483153872873, "difficulty": "Medium", "likes": 914, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42260, "totalSubmissionRaw": 71975}, "1546": {"acRate": 47.63807404410277, "difficulty": "Medium", "likes": 1049, "dislikes": 27, "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": 28257, "totalSubmissionRaw": 59316}, "1547": {"acRate": 61.74718695422815, "difficulty": "Hard", "likes": 4174, "dislikes": 102, "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": 120560, "totalSubmissionRaw": 195249}, "1548": {"acRate": 59.16190997026353, "difficulty": "Hard", "likes": 376, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17309, "totalSubmissionRaw": 29257}, "1549": {"acRate": 64.74681971213593, "difficulty": "Medium", "likes": 134, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1549", "paidOnly": true, "title": "The Most Recent Orders for Each Product", "titleSlug": "the-most-recent-orders-for-each-product", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28655, "totalSubmissionRaw": 44257}, "1550": {"acRate": 63.153902814343745, "difficulty": "Easy", "likes": 650, "dislikes": 62, "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": 86596, "totalSubmissionRaw": 137119}, "1551": {"acRate": 82.23342963826515, "difficulty": "Medium", "likes": 1431, "dislikes": 179, "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": 97343, "totalSubmissionRaw": 118374}, "1552": {"acRate": 61.59695817490495, "difficulty": "Medium", "likes": 2122, "dislikes": 115, "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": 57833, "totalSubmissionRaw": 93887}, "1553": {"acRate": 35.29691871193032, "difficulty": "Hard", "likes": 980, "dislikes": 57, "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": 35580, "totalSubmissionRaw": 100802}, "1554": {"acRate": 41.70409714275955, "difficulty": "Medium", "likes": 373, "dislikes": 96, "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": 24419, "totalSubmissionRaw": 58553}, "1555": {"acRate": 51.165293234786056, "difficulty": "Medium", "likes": 140, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18068, "totalSubmissionRaw": 35313}, "1556": {"acRate": 53.72829522597594, "difficulty": "Easy", "likes": 487, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52355, "totalSubmissionRaw": 97444}, "1557": {"acRate": 80.99309897183244, "difficulty": "Medium", "likes": 3661, "dislikes": 128, "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": 179684, "totalSubmissionRaw": 221851}, "1558": {"acRate": 63.588530889742835, "difficulty": "Medium", "likes": 622, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21512, "totalSubmissionRaw": 33830}, "1559": {"acRate": 48.599944552259494, "difficulty": "Medium", "likes": 1148, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1559", "paidOnly": false, "title": "Detect Cycles in 2D Grid", "titleSlug": "detect-cycles-in-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42072, "totalSubmissionRaw": 86568}, "1560": {"acRate": 58.79199097783283, "difficulty": "Easy", "likes": 314, "dislikes": 628, "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": 31800, "totalSubmissionRaw": 54089}, "1561": {"acRate": 84.5444030063644, "difficulty": "Medium", "likes": 1870, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162994, "totalSubmissionRaw": 192791}, "1562": {"acRate": 42.906476848262734, "difficulty": "Medium", "likes": 644, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18264, "totalSubmissionRaw": 42566}, "1563": {"acRate": 40.68397198187062, "difficulty": "Hard", "likes": 639, "dislikes": 86, "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": 19748, "totalSubmissionRaw": 48540}, "1564": {"acRate": 67.01076021345465, "difficulty": "Medium", "likes": 325, "dislikes": 29, "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": 15320, "totalSubmissionRaw": 22862}, "1565": {"acRate": 82.14759001931013, "difficulty": "Easy", "likes": 77, "dislikes": 44, "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": 21696, "totalSubmissionRaw": 26411}, "1566": {"acRate": 43.153320300339935, "difficulty": "Easy", "likes": 646, "dislikes": 132, "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": 34656, "totalSubmissionRaw": 80309}, "1567": {"acRate": 44.22143312897051, "difficulty": "Medium", "likes": 2399, "dislikes": 68, "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": 95643, "totalSubmissionRaw": 216282}, "1568": {"acRate": 44.91685623658326, "difficulty": "Hard", "likes": 704, "dislikes": 148, "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": 14019, "totalSubmissionRaw": 31211}, "1569": {"acRate": 53.483632289161285, "difficulty": "Hard", "likes": 1777, "dislikes": 206, "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": 55370, "totalSubmissionRaw": 103527}, "1570": {"acRate": 89.84209652653857, "difficulty": "Medium", "likes": 1203, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259779, "totalSubmissionRaw": 289142}, "1571": {"acRate": 87.75871517093117, "difficulty": "Easy", "likes": 159, "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": 41638, "totalSubmissionRaw": 47446}, "1572": {"acRate": 82.95567923084616, "difficulty": "Easy", "likes": 3445, "dislikes": 54, "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": 356691, "totalSubmissionRaw": 429978}, "1573": {"acRate": 33.332592559669315, "difficulty": "Medium", "likes": 732, "dislikes": 82, "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": 29998, "totalSubmissionRaw": 89996}, "1574": {"acRate": 37.91375233967097, "difficulty": "Medium", "likes": 1593, "dislikes": 59, "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": 30789, "totalSubmissionRaw": 81205}, "1575": {"acRate": 65.37071241600472, "difficulty": "Hard", "likes": 1612, "dislikes": 59, "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": 57689, "totalSubmissionRaw": 88249}, "1576": {"acRate": 46.35848969760199, "difficulty": "Easy", "likes": 554, "dislikes": 175, "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": 60432, "totalSubmissionRaw": 130358}, "1577": {"acRate": 41.15821927223455, "difficulty": "Medium", "likes": 373, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1577", "paidOnly": false, "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "titleSlug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20959, "totalSubmissionRaw": 50923}, "1578": {"acRate": 63.7928461641771, "difficulty": "Medium", "likes": 3795, "dislikes": 134, "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": 256493, "totalSubmissionRaw": 402073}, "1579": {"acRate": 63.9982130404463, "difficulty": "Hard", "likes": 2026, "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": 58735, "totalSubmissionRaw": 91776}, "1580": {"acRate": 63.443560764615604, "difficulty": "Medium", "likes": 169, "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": 4546, "totalSubmissionRaw": 7165}, "1581": {"acRate": 68.15076227168085, "difficulty": "Easy", "likes": 1901, "dislikes": 268, "categoryTitle": "Database", "frontendQuestionId": "1581", "paidOnly": false, "title": "Customer Who Visited but Did Not Make Any Transactions", "titleSlug": "customer-who-visited-but-did-not-make-any-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 404366, "totalSubmissionRaw": 593331}, "1582": {"acRate": 68.60828331106636, "difficulty": "Easy", "likes": 1444, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1582", "paidOnly": false, "title": "Special Positions in a Binary Matrix", "titleSlug": "special-positions-in-a-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145842, "totalSubmissionRaw": 212572}, "1583": {"acRate": 61.534120507032476, "difficulty": "Medium", "likes": 281, "dislikes": 853, "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": 28350, "totalSubmissionRaw": 46072}, "1584": {"acRate": 66.92545509078744, "difficulty": "Medium", "likes": 4976, "dislikes": 123, "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": 290075, "totalSubmissionRaw": 433430}, "1585": {"acRate": 48.491232065588704, "difficulty": "Hard", "likes": 437, "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": 8517, "totalSubmissionRaw": 17564}, "1586": {"acRate": 65.50624003002721, "difficulty": "Medium", "likes": 260, "dislikes": 45, "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": 13962, "totalSubmissionRaw": 21314}, "1587": {"acRate": 83.41167910661292, "difficulty": "Easy", "likes": 471, "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": 102030, "totalSubmissionRaw": 122321}, "1588": {"acRate": 83.07531293172018, "difficulty": "Easy", "likes": 3666, "dislikes": 294, "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": 198442, "totalSubmissionRaw": 238870}, "1589": {"acRate": 37.879456999673586, "difficulty": "Medium", "likes": 757, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19728, "totalSubmissionRaw": 52081}, "1590": {"acRate": 29.078106794166096, "difficulty": "Medium", "likes": 1509, "dislikes": 67, "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": 28949, "totalSubmissionRaw": 99556}, "1591": {"acRate": 59.0664079344545, "difficulty": "Hard", "likes": 624, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1591", "paidOnly": false, "title": "Strange Printer II", "titleSlug": "strange-printer-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10958, "totalSubmissionRaw": 18552}, "1592": {"acRate": 43.30677351767171, "difficulty": "Easy", "likes": 453, "dislikes": 347, "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": 56633, "totalSubmissionRaw": 130773}, "1593": {"acRate": 56.42457091237579, "difficulty": "Medium", "likes": 832, "dislikes": 36, "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": 31231, "totalSubmissionRaw": 55350}, "1594": {"acRate": 33.675859568891, "difficulty": "Medium", "likes": 824, "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": 24153, "totalSubmissionRaw": 71722}, "1595": {"acRate": 47.90169133192389, "difficulty": "Hard", "likes": 468, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9063, "totalSubmissionRaw": 18920}, "1596": {"acRate": 78.39162502974067, "difficulty": "Medium", "likes": 240, "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": 32948, "totalSubmissionRaw": 42030}, "1597": {"acRate": 62.582955359274294, "difficulty": "Hard", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1597", "paidOnly": true, "title": "Build Binary Expression Tree From Infix Expression", "titleSlug": "build-binary-expression-tree-from-infix-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13108, "totalSubmissionRaw": 20945}, "1598": {"acRate": 65.25288923516428, "difficulty": "Easy", "likes": 946, "dislikes": 66, "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": 80402, "totalSubmissionRaw": 123216}, "1599": {"acRate": 43.86131309937823, "difficulty": "Medium", "likes": 108, "dislikes": 245, "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": 12486, "totalSubmissionRaw": 28467}, "1600": {"acRate": 65.00150806816468, "difficulty": "Medium", "likes": 285, "dislikes": 303, "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": 17241, "totalSubmissionRaw": 26524}, "1601": {"acRate": 64.48145660080151, "difficulty": "Hard", "likes": 1405, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1601", "paidOnly": false, "title": "Maximum Number of Achievable Transfer Requests", "titleSlug": "maximum-number-of-achievable-transfer-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55672, "totalSubmissionRaw": 86338}, "1602": {"acRate": 75.45415862001244, "difficulty": "Medium", "likes": 328, "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": 23052, "totalSubmissionRaw": 30551}, "1603": {"acRate": 87.9509992259407, "difficulty": "Easy", "likes": 1930, "dislikes": 442, "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": 280647, "totalSubmissionRaw": 319095}, "1604": {"acRate": 45.85980837115481, "difficulty": "Medium", "likes": 309, "dislikes": 419, "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": 36376, "totalSubmissionRaw": 79320}, "1605": {"acRate": 77.27247196270432, "difficulty": "Medium", "likes": 1402, "dislikes": 39, "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": 41272, "totalSubmissionRaw": 53409}, "1606": {"acRate": 43.602254344309344, "difficulty": "Hard", "likes": 598, "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": 16711, "totalSubmissionRaw": 38326}, "1607": {"acRate": 54.26352779279501, "difficulty": "Easy", "likes": 131, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33123, "totalSubmissionRaw": 61041}, "1608": {"acRate": 66.88407872948443, "difficulty": "Easy", "likes": 2163, "dislikes": 416, "categoryTitle": "Algorithms", "frontendQuestionId": "1608", "paidOnly": false, "title": "Special Array With X Elements Greater Than or Equal X", "titleSlug": "special-array-with-x-elements-greater-than-or-equal-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191445, "totalSubmissionRaw": 286229}, "1609": {"acRate": 65.72249797406808, "difficulty": "Medium", "likes": 1747, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1609", "paidOnly": false, "title": "Even Odd Tree", "titleSlug": "even-odd-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155715, "totalSubmissionRaw": 236928}, "1610": {"acRate": 37.369256327204894, "difficulty": "Hard", "likes": 570, "dislikes": 742, "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": 40265, "totalSubmissionRaw": 107749}, "1611": {"acRate": 74.18808641739551, "difficulty": "Hard", "likes": 907, "dislikes": 1015, "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": 58274, "totalSubmissionRaw": 78549}, "1612": {"acRate": 70.82078678970373, "difficulty": "Medium", "likes": 139, "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": 7291, "totalSubmissionRaw": 10295}, "1613": {"acRate": 73.08216245670027, "difficulty": "Medium", "likes": 226, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1613", "paidOnly": true, "title": "Find the Missing IDs", "titleSlug": "find-the-missing-ids", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18777, "totalSubmissionRaw": 25693}, "1614": {"acRate": 83.72694619224899, "difficulty": "Easy", "likes": 2364, "dislikes": 495, "categoryTitle": "Algorithms", "frontendQuestionId": "1614", "paidOnly": false, "title": "Maximum Nesting Depth of the Parentheses", "titleSlug": "maximum-nesting-depth-of-the-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332401, "totalSubmissionRaw": 397006}, "1615": {"acRate": 65.08859167022503, "difficulty": "Medium", "likes": 2334, "dislikes": 361, "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": 141761, "totalSubmissionRaw": 217797}, "1616": {"acRate": 31.038928526724245, "difficulty": "Medium", "likes": 729, "dislikes": 245, "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": 24797, "totalSubmissionRaw": 79890}, "1617": {"acRate": 65.70561456752657, "difficulty": "Hard", "likes": 535, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1617", "paidOnly": false, "title": "Count Subtrees With Max Distance Between Cities", "titleSlug": "count-subtrees-with-max-distance-between-cities", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10392, "totalSubmissionRaw": 15816}, "1618": {"acRate": 60.82245314859224, "difficulty": "Medium", "likes": 108, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1618", "paidOnly": true, "title": "Maximum Font to Fit a Sentence in a Screen", "titleSlug": "maximum-font-to-fit-a-sentence-in-a-screen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6848, "totalSubmissionRaw": 11259}, "1619": {"acRate": 68.2611787918416, "difficulty": "Easy", "likes": 491, "dislikes": 127, "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": 59506, "totalSubmissionRaw": 87174}, "1620": {"acRate": 37.79343737840993, "difficulty": "Medium", "likes": 78, "dislikes": 263, "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": 8742, "totalSubmissionRaw": 23131}, "1621": {"acRate": 43.47769314472252, "difficulty": "Medium", "likes": 456, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9989, "totalSubmissionRaw": 22975}, "1622": {"acRate": 17.298666897008435, "difficulty": "Hard", "likes": 368, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12016, "totalSubmissionRaw": 69462}, "1623": {"acRate": 81.9592790387183, "difficulty": "Easy", "likes": 73, "dislikes": 137, "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": 19644, "totalSubmissionRaw": 23968}, "1624": {"acRate": 68.59594586714394, "difficulty": "Easy", "likes": 1327, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1624", "paidOnly": false, "title": "Largest Substring Between Two Equal Characters", "titleSlug": "largest-substring-between-two-equal-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152923, "totalSubmissionRaw": 222933}, "1625": {"acRate": 65.37364009274121, "difficulty": "Medium", "likes": 349, "dislikes": 271, "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": 14662, "totalSubmissionRaw": 22428}, "1626": {"acRate": 50.351252290775804, "difficulty": "Medium", "likes": 2926, "dislikes": 94, "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": 82425, "totalSubmissionRaw": 163700}, "1627": {"acRate": 47.008823767505866, "difficulty": "Hard", "likes": 572, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1627", "paidOnly": false, "title": "Graph Connectivity With Threshold", "titleSlug": "graph-connectivity-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17421, "totalSubmissionRaw": 37059}, "1628": {"acRate": 82.567031869401, "difficulty": "Medium", "likes": 535, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "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": 26452, "totalSubmissionRaw": 32037}, "1629": {"acRate": 59.05949323644627, "difficulty": "Easy", "likes": 761, "dislikes": 108, "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": 99807, "totalSubmissionRaw": 168994}, "1630": {"acRate": 83.74332336943205, "difficulty": "Medium", "likes": 1806, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136716, "totalSubmissionRaw": 163256}, "1631": {"acRate": 59.6048739374158, "difficulty": "Medium", "likes": 5776, "dislikes": 199, "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": 255295, "totalSubmissionRaw": 428315}, "1632": {"acRate": 40.89853402946805, "difficulty": "Hard", "likes": 868, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1632", "paidOnly": false, "title": "Rank Transform of a Matrix", "titleSlug": "rank-transform-of-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22012, "totalSubmissionRaw": 53821}, "1633": {"acRate": 55.073049414717644, "difficulty": "Easy", "likes": 618, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167630, "totalSubmissionRaw": 304378}, "1634": {"acRate": 55.44976473844451, "difficulty": "Medium", "likes": 143, "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": 10017, "totalSubmissionRaw": 18065}, "1635": {"acRate": 47.54368050828228, "difficulty": "Hard", "likes": 109, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8381, "totalSubmissionRaw": 17628}, "1636": {"acRate": 71.63995762616359, "difficulty": "Easy", "likes": 2840, "dislikes": 116, "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": 127138, "totalSubmissionRaw": 177468}, "1637": {"acRate": 87.51760664036715, "difficulty": "Easy", "likes": 915, "dislikes": 1699, "categoryTitle": "Algorithms", "frontendQuestionId": "1637", "paidOnly": false, "title": "Widest Vertical Area Between Two Points Containing No Points", "titleSlug": "widest-vertical-area-between-two-points-containing-no-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168382, "totalSubmissionRaw": 192398}, "1638": {"acRate": 71.08195156865084, "difficulty": "Medium", "likes": 1135, "dislikes": 342, "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": 29794, "totalSubmissionRaw": 41915}, "1639": {"acRate": 51.37513252924705, "difficulty": "Hard", "likes": 1551, "dislikes": 86, "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": 56694, "totalSubmissionRaw": 110353}, "1640": {"acRate": 56.53569284072635, "difficulty": "Easy", "likes": 892, "dislikes": 139, "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": 81914, "totalSubmissionRaw": 144889}, "1641": {"acRate": 78.3516427192428, "difficulty": "Medium", "likes": 3830, "dislikes": 89, "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": 183440, "totalSubmissionRaw": 234124}, "1642": {"acRate": 49.73025709105327, "difficulty": "Medium", "likes": 5825, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1642", "paidOnly": false, "title": "Furthest Building You Can Reach", "titleSlug": "furthest-building-you-can-reach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 223262, "totalSubmissionRaw": 448946}, "1643": {"acRate": 48.095310365761115, "difficulty": "Hard", "likes": 543, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12676, "totalSubmissionRaw": 26356}, "1644": {"acRate": 64.32552504038772, "difficulty": "Medium", "likes": 634, "dislikes": 34, "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": 79635, "totalSubmissionRaw": 123800}, "1645": {"acRate": 39.070442992011614, "difficulty": "Hard", "likes": 61, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1645", "paidOnly": true, "title": "Hopper Company Queries II", "titleSlug": "hopper-company-queries-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6456, "totalSubmissionRaw": 16524}, "1646": {"acRate": 50.42616341450953, "difficulty": "Easy", "likes": 757, "dislikes": 938, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 108564, "totalSubmissionRaw": 215293}, "1647": {"acRate": 61.22012401289806, "difficulty": "Medium", "likes": 4902, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1647", "paidOnly": false, "title": "Minimum Deletions to Make Character Frequencies Unique", "titleSlug": "minimum-deletions-to-make-character-frequencies-unique", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273586, "totalSubmissionRaw": 446889}, "1648": {"acRate": 29.990403071017273, "difficulty": "Medium", "likes": 1069, "dislikes": 384, "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": 37500, "totalSubmissionRaw": 125040}, "1649": {"acRate": 38.7292027403448, "difficulty": "Hard", "likes": 648, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25722, "totalSubmissionRaw": 66415}, "1650": {"acRate": 79.7932868733798, "difficulty": "Medium", "likes": 1368, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237008, "totalSubmissionRaw": 297028}, "1651": {"acRate": 65.0813885075505, "difficulty": "Hard", "likes": 34, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1651", "paidOnly": true, "title": "Hopper Company Queries III", "titleSlug": "hopper-company-queries-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6637, "totalSubmissionRaw": 10198}, "1652": {"acRate": 65.49543014652545, "difficulty": "Easy", "likes": 769, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45146, "totalSubmissionRaw": 68930}, "1653": {"acRate": 58.77564627929267, "difficulty": "Medium", "likes": 1307, "dislikes": 37, "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": 42312, "totalSubmissionRaw": 71989}, "1654": {"acRate": 29.345689413086212, "difficulty": "Medium", "likes": 1469, "dislikes": 266, "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": 42845, "totalSubmissionRaw": 146001}, "1655": {"acRate": 39.55174159848626, "difficulty": "Hard", "likes": 419, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1655", "paidOnly": false, "title": "Distribute Repeating Integers", "titleSlug": "distribute-repeating-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14841, "totalSubmissionRaw": 37523}, "1656": {"acRate": 84.33477437217661, "difficulty": "Easy", "likes": 522, "dislikes": 3457, "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": 86810, "totalSubmissionRaw": 102935}, "1657": {"acRate": 54.80665042707273, "difficulty": "Medium", "likes": 3617, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332313, "totalSubmissionRaw": 606336}, "1658": {"acRate": 39.70642552114242, "difficulty": "Medium", "likes": 5423, "dislikes": 119, "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": 191353, "totalSubmissionRaw": 481921}, "1659": {"acRate": 39.575052395750525, "difficulty": "Hard", "likes": 327, "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": 5476, "totalSubmissionRaw": 13837}, "1660": {"acRate": 74.37478457355138, "difficulty": "Medium", "likes": 267, "dislikes": 44, "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": 19420, "totalSubmissionRaw": 26111}, "1661": {"acRate": 67.01364614698645, "difficulty": "Easy", "likes": 1244, "dislikes": 117, "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": 243478, "totalSubmissionRaw": 363326}, "1662": {"acRate": 85.4031207072664, "difficulty": "Easy", "likes": 2956, "dislikes": 199, "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": 484936, "totalSubmissionRaw": 567820}, "1663": {"acRate": 66.79085184896626, "difficulty": "Medium", "likes": 1865, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1663", "paidOnly": false, "title": "Smallest String With A Given Numeric Value", "titleSlug": "smallest-string-with-a-given-numeric-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94300, "totalSubmissionRaw": 141187}, "1664": {"acRate": 63.53374836173001, "difficulty": "Medium", "likes": 1307, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38781, "totalSubmissionRaw": 61040}, "1665": {"acRate": 57.875970542170684, "difficulty": "Hard", "likes": 572, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1665", "paidOnly": false, "title": "Minimum Initial Energy to Finish Tasks", "titleSlug": "minimum-initial-energy-to-finish-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17368, "totalSubmissionRaw": 30009}, "1666": {"acRate": 73.78153894373922, "difficulty": "Medium", "likes": 63, "dislikes": 182, "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": 4708, "totalSubmissionRaw": 6381}, "1667": {"acRate": 61.56777014366022, "difficulty": "Easy", "likes": 853, "dislikes": 103, "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": 216854, "totalSubmissionRaw": 352220}, "1668": {"acRate": 38.62528089028846, "difficulty": "Easy", "likes": 676, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50534, "totalSubmissionRaw": 130833}, "1669": {"acRate": 81.51037248399784, "difficulty": "Medium", "likes": 2058, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "1669", "paidOnly": false, "title": "Merge In Between Linked Lists", "titleSlug": "merge-in-between-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211389, "totalSubmissionRaw": 259340}, "1670": {"acRate": 56.40356203197733, "difficulty": "Medium", "likes": 740, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27869, "totalSubmissionRaw": 49410}, "1671": {"acRate": 41.73572711951753, "difficulty": "Hard", "likes": 1563, "dislikes": 22, "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": 29965, "totalSubmissionRaw": 71797}, "1672": {"acRate": 87.97680910631252, "difficulty": "Easy", "likes": 4299, "dislikes": 361, "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": 869183, "totalSubmissionRaw": 987969}, "1673": {"acRate": 50.37117624472034, "difficulty": "Medium", "likes": 2017, "dislikes": 94, "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": 62968, "totalSubmissionRaw": 125008}, "1674": {"acRate": 39.57051080461836, "difficulty": "Medium", "likes": 654, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8808, "totalSubmissionRaw": 22259}, "1675": {"acRate": 54.061284606356296, "difficulty": "Hard", "likes": 3023, "dislikes": 169, "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": 93965, "totalSubmissionRaw": 173812}, "1676": {"acRate": 78.47796964747765, "difficulty": "Medium", "likes": 467, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42765, "totalSubmissionRaw": 54493}, "1677": {"acRate": 38.11540020719787, "difficulty": "Easy", "likes": 36, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16924, "totalSubmissionRaw": 44402}, "1678": {"acRate": 87.17528132748427, "difficulty": "Easy", "likes": 1555, "dislikes": 86, "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": 251381, "totalSubmissionRaw": 288363}, "1679": {"acRate": 55.0109196334055, "difficulty": "Medium", "likes": 3067, "dislikes": 83, "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": 288411, "totalSubmissionRaw": 524280}, "1680": {"acRate": 57.10493046776233, "difficulty": "Medium", "likes": 1418, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90340, "totalSubmissionRaw": 158200}, "1681": {"acRate": 38.82748006156429, "difficulty": "Hard", "likes": 271, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8325, "totalSubmissionRaw": 21441}, "1682": {"acRate": 49.9172337686224, "difficulty": "Medium", "likes": 147, "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": 5428, "totalSubmissionRaw": 10874}, "1683": {"acRate": 85.18265638117337, "difficulty": "Easy", "likes": 884, "dislikes": 328, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472837, "totalSubmissionRaw": 555086}, "1684": {"acRate": 83.18066917272193, "difficulty": "Easy", "likes": 1708, "dislikes": 70, "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": 178351, "totalSubmissionRaw": 214414}, "1685": {"acRate": 68.50234503739384, "difficulty": "Medium", "likes": 2039, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108082, "totalSubmissionRaw": 157779}, "1686": {"acRate": 56.99106285115426, "difficulty": "Medium", "likes": 822, "dislikes": 69, "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": 19577, "totalSubmissionRaw": 34351}, "1687": {"acRate": 38.916861107699866, "difficulty": "Hard", "likes": 370, "dislikes": 29, "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": 6338, "totalSubmissionRaw": 16286}, "1688": {"acRate": 85.72333072762838, "difficulty": "Easy", "likes": 1747, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "1688", "paidOnly": false, "title": "Count of Matches in Tournament", "titleSlug": "count-of-matches-in-tournament", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242350, "totalSubmissionRaw": 282712}, "1689": {"acRate": 88.69899349066614, "difficulty": "Medium", "likes": 2393, "dislikes": 1483, "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": 216524, "totalSubmissionRaw": 244111}, "1690": {"acRate": 57.917559929838234, "difficulty": "Medium", "likes": 981, "dislikes": 167, "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": 35660, "totalSubmissionRaw": 61570}, "1691": {"acRate": 57.10826918301465, "difficulty": "Hard", "likes": 1125, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1691", "paidOnly": false, "title": "Maximum Height by Stacking Cuboids ", "titleSlug": "maximum-height-by-stacking-cuboids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27597, "totalSubmissionRaw": 48324}, "1692": {"acRate": 63.00420687948528, "difficulty": "Hard", "likes": 72, "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": 2546, "totalSubmissionRaw": 4041}, "1693": {"acRate": 86.54591679074079, "difficulty": "Easy", "likes": 538, "dislikes": 30, "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": 123230, "totalSubmissionRaw": 142387}, "1694": {"acRate": 65.56539450744826, "difficulty": "Easy", "likes": 343, "dislikes": 202, "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": 37984, "totalSubmissionRaw": 57933}, "1695": {"acRate": 58.226510744228854, "difficulty": "Medium", "likes": 2787, "dislikes": 46, "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": 128411, "totalSubmissionRaw": 220537}, "1696": {"acRate": 45.699394052946914, "difficulty": "Medium", "likes": 3393, "dislikes": 112, "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": 107319, "totalSubmissionRaw": 234838}, "1697": {"acRate": 62.420303311668214, "difficulty": "Hard", "likes": 1938, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1697", "paidOnly": false, "title": "Checking Existence of Edge Length Limited Paths", "titleSlug": "checking-existence-of-edge-length-limited-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50420, "totalSubmissionRaw": 80775}, "1698": {"acRate": 63.94727467046669, "difficulty": "Medium", "likes": 192, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10770, "totalSubmissionRaw": 16842}, "1699": {"acRate": 81.1279615317227, "difficulty": "Medium", "likes": 291, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41673, "totalSubmissionRaw": 51367}, "1700": {"acRate": 78.19301807766628, "difficulty": "Easy", "likes": 2354, "dislikes": 223, "categoryTitle": "Algorithms", "frontendQuestionId": "1700", "paidOnly": false, "title": "Number of Students Unable to Eat Lunch", "titleSlug": "number-of-students-unable-to-eat-lunch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239148, "totalSubmissionRaw": 305831}, "1701": {"acRate": 63.564318366300675, "difficulty": "Medium", "likes": 507, "dislikes": 52, "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": 29757, "totalSubmissionRaw": 46814}, "1702": {"acRate": 46.910203347129745, "difficulty": "Medium", "likes": 490, "dislikes": 51, "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": 13034, "totalSubmissionRaw": 27785}, "1703": {"acRate": 42.972060900957466, "difficulty": "Hard", "likes": 710, "dislikes": 25, "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": 10951, "totalSubmissionRaw": 25484}, "1704": {"acRate": 78.66352740107085, "difficulty": "Easy", "likes": 2229, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1704", "paidOnly": false, "title": "Determine if String Halves Are Alike", "titleSlug": "determine-if-string-halves-are-alike", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353483, "totalSubmissionRaw": 449361}, "1705": {"acRate": 39.03544013813619, "difficulty": "Medium", "likes": 824, "dislikes": 183, "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": 22833, "totalSubmissionRaw": 58493}, "1706": {"acRate": 71.79006752363838, "difficulty": "Medium", "likes": 3080, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1706", "paidOnly": false, "title": "Where Will the Ball Fall", "titleSlug": "where-will-the-ball-fall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140234, "totalSubmissionRaw": 195339}, "1707": {"acRate": 49.69669737137722, "difficulty": "Hard", "likes": 1188, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1707", "paidOnly": false, "title": "Maximum XOR With an Element From Array", "titleSlug": "maximum-xor-with-an-element-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22120, "totalSubmissionRaw": 44510}, "1708": {"acRate": 64.78164774026371, "difficulty": "Easy", "likes": 102, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8500, "totalSubmissionRaw": 13121}, "1709": {"acRate": 70.60207398235568, "difficulty": "Medium", "likes": 207, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22808, "totalSubmissionRaw": 32305}, "1710": {"acRate": 73.6358251564571, "difficulty": "Easy", "likes": 3794, "dislikes": 218, "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": 303331, "totalSubmissionRaw": 411934}, "1711": {"acRate": 30.21678518843395, "difficulty": "Medium", "likes": 1029, "dislikes": 235, "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": 38582, "totalSubmissionRaw": 127684}, "1712": {"acRate": 32.93836945972177, "difficulty": "Medium", "likes": 1395, "dislikes": 103, "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": 32580, "totalSubmissionRaw": 98912}, "1713": {"acRate": 47.51441357900254, "difficulty": "Hard", "likes": 709, "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": 11785, "totalSubmissionRaw": 24803}, "1714": {"acRate": 49.65913168281306, "difficulty": "Hard", "likes": 30, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1384, "totalSubmissionRaw": 2787}, "1715": {"acRate": 75.47953332015028, "difficulty": "Medium", "likes": 82, "dislikes": 21, "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": 15268, "totalSubmissionRaw": 20228}, "1716": {"acRate": 78.27564940671485, "difficulty": "Easy", "likes": 1423, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158652, "totalSubmissionRaw": 202684}, "1717": {"acRate": 47.01006138075049, "difficulty": "Medium", "likes": 622, "dislikes": 35, "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": 14858, "totalSubmissionRaw": 31606}, "1718": {"acRate": 53.54456525975292, "difficulty": "Medium", "likes": 559, "dislikes": 52, "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": 13739, "totalSubmissionRaw": 25659}, "1719": {"acRate": 44.248778501628664, "difficulty": "Hard", "likes": 212, "dislikes": 150, "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": 4347, "totalSubmissionRaw": 9824}, "1720": {"acRate": 86.34612785511555, "difficulty": "Easy", "likes": 1586, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153330, "totalSubmissionRaw": 177576}, "1721": {"acRate": 67.96903975825231, "difficulty": "Medium", "likes": 5301, "dislikes": 179, "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": 335360, "totalSubmissionRaw": 493401}, "1722": {"acRate": 48.78274856192579, "difficulty": "Medium", "likes": 831, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1722", "paidOnly": false, "title": "Minimize Hamming Distance After Swap Operations", "titleSlug": "minimize-hamming-distance-after-swap-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17894, "totalSubmissionRaw": 36681}, "1723": {"acRate": 42.36853623460264, "difficulty": "Hard", "likes": 1032, "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": 27104, "totalSubmissionRaw": 63972}, "1724": {"acRate": 51.460556235788005, "difficulty": "Hard", "likes": 103, "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": 2942, "totalSubmissionRaw": 5717}, "1725": {"acRate": 78.68911054765601, "difficulty": "Easy", "likes": 583, "dislikes": 70, "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": 70448, "totalSubmissionRaw": 89527}, "1726": {"acRate": 61.127100955728885, "difficulty": "Medium", "likes": 624, "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"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27822, "totalSubmissionRaw": 45515}, "1727": {"acRate": 75.31141085173368, "difficulty": "Medium", "likes": 1897, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71524, "totalSubmissionRaw": 94971}, "1728": {"acRate": 39.989880249620505, "difficulty": "Hard", "likes": 267, "dislikes": 43, "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": 7113, "totalSubmissionRaw": 17787}, "1729": {"acRate": 69.02038122775632, "difficulty": "Easy", "likes": 541, "dislikes": 30, "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": 180934, "totalSubmissionRaw": 262146}, "1730": {"acRate": 54.84030912323895, "difficulty": "Medium", "likes": 668, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1730", "paidOnly": true, "title": "Shortest Path to Get Food", "titleSlug": "shortest-path-to-get-food", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64150, "totalSubmissionRaw": 116976}, "1731": {"acRate": 47.10073363431152, "difficulty": "Easy", "likes": 482, "dislikes": 68, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120183, "totalSubmissionRaw": 255163}, "1732": {"acRate": 83.1728899783235, "difficulty": "Easy", "likes": 2838, "dislikes": 325, "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": 387149, "totalSubmissionRaw": 465474}, "1733": {"acRate": 42.45083624333762, "difficulty": "Medium", "likes": 210, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9239, "totalSubmissionRaw": 21764}, "1734": {"acRate": 64.66100968543755, "difficulty": "Medium", "likes": 757, "dislikes": 28, "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": 15088, "totalSubmissionRaw": 23334}, "1735": {"acRate": 51.39058947000174, "difficulty": "Hard", "likes": 286, "dislikes": 32, "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": 5876, "totalSubmissionRaw": 11434}, "1736": {"acRate": 42.71818171034057, "difficulty": "Easy", "likes": 363, "dislikes": 182, "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": 36011, "totalSubmissionRaw": 84299}, "1737": {"acRate": 36.54836014768103, "difficulty": "Medium", "likes": 320, "dislikes": 340, "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": 13562, "totalSubmissionRaw": 37107}, "1738": {"acRate": 61.7611580217129, "difficulty": "Medium", "likes": 501, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22016, "totalSubmissionRaw": 35647}, "1739": {"acRate": 52.20390676058384, "difficulty": "Hard", "likes": 304, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7189, "totalSubmissionRaw": 13771}, "1740": {"acRate": 71.3193657984145, "difficulty": "Medium", "likes": 423, "dislikes": 17, "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": 25190, "totalSubmissionRaw": 35320}, "1741": {"acRate": 86.86431606604171, "difficulty": "Easy", "likes": 701, "dislikes": 19, "categoryTitle": "Database", "frontendQuestionId": "1741", "paidOnly": false, "title": "Find Total Time Spent by Each Employee", "titleSlug": "find-total-time-spent-by-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133897, "totalSubmissionRaw": 154145}, "1742": {"acRate": 73.41859502231219, "difficulty": "Easy", "likes": 601, "dislikes": 156, "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": 63836, "totalSubmissionRaw": 86948}, "1743": {"acRate": 74.79435176174908, "difficulty": "Medium", "likes": 1939, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 106837, "totalSubmissionRaw": 142841}, "1744": {"acRate": 33.991750982793064, "difficulty": "Medium", "likes": 128, "dislikes": 326, "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": 10549, "totalSubmissionRaw": 31034}, "1745": {"acRate": 44.263234214719205, "difficulty": "Hard", "likes": 907, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24725, "totalSubmissionRaw": 55859}, "1746": {"acRate": 62.26855026745303, "difficulty": "Medium", "likes": 273, "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": 9080, "totalSubmissionRaw": 14582}, "1747": {"acRate": 63.90212804711454, "difficulty": "Medium", "likes": 184, "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": 21050, "totalSubmissionRaw": 32941}, "1748": {"acRate": 77.71078255921735, "difficulty": "Easy", "likes": 1529, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1748", "paidOnly": false, "title": "Sum of Unique Elements", "titleSlug": "sum-of-unique-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 169352, "totalSubmissionRaw": 217926}, "1749": {"acRate": 59.84113379656555, "difficulty": "Medium", "likes": 1256, "dislikes": 19, "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": 39099, "totalSubmissionRaw": 65338}, "1750": {"acRate": 56.02099741209348, "difficulty": "Medium", "likes": 1190, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159973, "totalSubmissionRaw": 285559}, "1751": {"acRate": 61.79291381623627, "difficulty": "Hard", "likes": 2059, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1751", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended II", "titleSlug": "maximum-number-of-events-that-can-be-attended-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74610, "totalSubmissionRaw": 120742}, "1752": {"acRate": 50.923857131850745, "difficulty": "Easy", "likes": 3017, "dislikes": 155, "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": 224728, "totalSubmissionRaw": 441302}, "1753": {"acRate": 67.45658767456588, "difficulty": "Medium", "likes": 931, "dislikes": 54, "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": 40476, "totalSubmissionRaw": 60004}, "1754": {"acRate": 48.0125901193084, "difficulty": "Medium", "likes": 539, "dislikes": 74, "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": 22576, "totalSubmissionRaw": 47021}, "1755": {"acRate": 39.15689912657827, "difficulty": "Hard", "likes": 882, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1755", "paidOnly": false, "title": "Closest Subsequence Sum", "titleSlug": "closest-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17305, "totalSubmissionRaw": 44194}, "1756": {"acRate": 75.62350288854446, "difficulty": "Medium", "likes": 280, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1756", "paidOnly": true, "title": "Design Most Recently Used Queue", "titleSlug": "design-most-recently-used-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16101, "totalSubmissionRaw": 21291}, "1757": {"acRate": 89.16374971392278, "difficulty": "Easy", "likes": 2213, "dislikes": 104, "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": 1005149, "totalSubmissionRaw": 1127305}, "1758": {"acRate": 63.76610321932121, "difficulty": "Easy", "likes": 1413, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1758", "paidOnly": false, "title": "Minimum Changes To Make Alternating Binary String", "titleSlug": "minimum-changes-to-make-alternating-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144633, "totalSubmissionRaw": 226818}, "1759": {"acRate": 57.71515123221446, "difficulty": "Medium", "likes": 1470, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111265, "totalSubmissionRaw": 192783}, "1760": {"acRate": 60.127455692865894, "difficulty": "Medium", "likes": 1972, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38778, "totalSubmissionRaw": 64493}, "1761": {"acRate": 42.3027504143312, "difficulty": "Hard", "likes": 318, "dislikes": 285, "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": 22717, "totalSubmissionRaw": 53701}, "1762": {"acRate": 79.77149292769128, "difficulty": "Medium", "likes": 1204, "dislikes": 148, "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": 215313, "totalSubmissionRaw": 269915}, "1763": {"acRate": 60.50217661691543, "difficulty": "Easy", "likes": 1313, "dislikes": 871, "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": 54479, "totalSubmissionRaw": 90046}, "1764": {"acRate": 53.45108225108225, "difficulty": "Medium", "likes": 325, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15434, "totalSubmissionRaw": 28875}, "1765": {"acRate": 62.41359644119996, "difficulty": "Medium", "likes": 816, "dislikes": 48, "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": 27359, "totalSubmissionRaw": 43835}, "1766": {"acRate": 40.86517910575361, "difficulty": "Hard", "likes": 395, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9560, "totalSubmissionRaw": 23394}, "1767": {"acRate": 77.3334165210881, "difficulty": "Hard", "likes": 170, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12395, "totalSubmissionRaw": 16028}, "1768": {"acRate": 79.89582994736047, "difficulty": "Easy", "likes": 3764, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1768", "paidOnly": false, "title": "Merge Strings Alternately", "titleSlug": "merge-strings-alternately", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 835679, "totalSubmissionRaw": 1045963}, "1769": {"acRate": 85.818246240435, "difficulty": "Medium", "likes": 2229, "dislikes": 91, "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": 125945, "totalSubmissionRaw": 146758}, "1770": {"acRate": 40.21402962372795, "difficulty": "Hard", "likes": 2502, "dislikes": 508, "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": 111043, "totalSubmissionRaw": 276130}, "1771": {"acRate": 36.267548021859355, "difficulty": "Hard", "likes": 535, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11083, "totalSubmissionRaw": 30559}, "1772": {"acRate": 65.78000654093536, "difficulty": "Medium", "likes": 88, "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": 6034, "totalSubmissionRaw": 9173}, "1773": {"acRate": 84.86607176993249, "difficulty": "Easy", "likes": 1869, "dislikes": 213, "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": 221974, "totalSubmissionRaw": 261558}, "1774": {"acRate": 47.49532092920841, "difficulty": "Medium", "likes": 697, "dislikes": 86, "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": 30198, "totalSubmissionRaw": 63581}, "1775": {"acRate": 53.624673020286465, "difficulty": "Medium", "likes": 906, "dislikes": 44, "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": 29315, "totalSubmissionRaw": 54667}, "1776": {"acRate": 55.01540052124842, "difficulty": "Hard", "likes": 880, "dislikes": 34, "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": 25542, "totalSubmissionRaw": 46427}, "1777": {"acRate": 82.38610642413268, "difficulty": "Easy", "likes": 133, "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": 20019, "totalSubmissionRaw": 24299}, "1778": {"acRate": 39.555503704135795, "difficulty": "Medium", "likes": 162, "dislikes": 65, "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": 6781, "totalSubmissionRaw": 17143}, "1779": {"acRate": 68.47913154717071, "difficulty": "Easy", "likes": 838, "dislikes": 185, "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": 114556, "totalSubmissionRaw": 167286}, "1780": {"acRate": 67.75354135071471, "difficulty": "Medium", "likes": 967, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41995, "totalSubmissionRaw": 61982}, "1781": {"acRate": 65.298923377526, "difficulty": "Medium", "likes": 1052, "dislikes": 172, "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": 49794, "totalSubmissionRaw": 76256}, "1782": {"acRate": 40.078655702538434, "difficulty": "Hard", "likes": 311, "dislikes": 161, "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": 6726, "totalSubmissionRaw": 16782}, "1783": {"acRate": 83.51056624221079, "difficulty": "Medium", "likes": 231, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1783", "paidOnly": true, "title": "Grand Slam Titles", "titleSlug": "grand-slam-titles", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24659, "totalSubmissionRaw": 29528}, "1784": {"acRate": 39.1904357435771, "difficulty": "Easy", "likes": 331, "dislikes": 955, "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": 42910, "totalSubmissionRaw": 109491}, "1785": {"acRate": 43.36487092696056, "difficulty": "Medium", "likes": 262, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21267, "totalSubmissionRaw": 49042}, "1786": {"acRate": 39.14544313414594, "difficulty": "Medium", "likes": 1051, "dislikes": 203, "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": 23701, "totalSubmissionRaw": 60546}, "1787": {"acRate": 39.499198412092525, "difficulty": "Hard", "likes": 396, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5174, "totalSubmissionRaw": 13099}, "1788": {"acRate": 67.23981900452489, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2229, "totalSubmissionRaw": 3315}, "1789": {"acRate": 64.02735128186818, "difficulty": "Easy", "likes": 449, "dislikes": 204, "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": 107582, "totalSubmissionRaw": 168028}, "1790": {"acRate": 45.70593764221038, "difficulty": "Easy", "likes": 1080, "dislikes": 57, "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": 107467, "totalSubmissionRaw": 235125}, "1791": {"acRate": 83.63975603530976, "difficulty": "Easy", "likes": 1394, "dislikes": 153, "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": 190068, "totalSubmissionRaw": 227246}, "1792": {"acRate": 53.691060116832226, "difficulty": "Medium", "likes": 720, "dislikes": 84, "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": 21783, "totalSubmissionRaw": 40571}, "1793": {"acRate": 64.36255136493313, "difficulty": "Hard", "likes": 1825, "dislikes": 47, "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": 73773, "totalSubmissionRaw": 114621}, "1794": {"acRate": 65.27590847913862, "difficulty": "Medium", "likes": 42, "dislikes": 58, "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": 1940, "totalSubmissionRaw": 2972}, "1795": {"acRate": 85.19564609174117, "difficulty": "Easy", "likes": 842, "dislikes": 55, "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": 127894, "totalSubmissionRaw": 150118}, "1796": {"acRate": 50.26859522477647, "difficulty": "Easy", "likes": 520, "dislikes": 128, "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": 56614, "totalSubmissionRaw": 112623}, "1797": {"acRate": 57.293885758655705, "difficulty": "Medium", "likes": 367, "dislikes": 48, "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": 28777, "totalSubmissionRaw": 50227}, "1798": {"acRate": 58.61098720104313, "difficulty": "Medium", "likes": 772, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1798", "paidOnly": false, "title": "Maximum Number of Consecutive Values You Can Make", "titleSlug": "maximum-number-of-consecutive-values-you-can-make", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17081, "totalSubmissionRaw": 29143}, "1799": {"acRate": 57.74606957077678, "difficulty": "Hard", "likes": 1616, "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": 59613, "totalSubmissionRaw": 103233}, "1800": {"acRate": 62.071488757816304, "difficulty": "Easy", "likes": 716, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1800", "paidOnly": false, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55986, "totalSubmissionRaw": 90196}, "1801": {"acRate": 49.70524802300503, "difficulty": "Medium", "likes": 289, "dislikes": 234, "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": 20742, "totalSubmissionRaw": 41730}, "1802": {"acRate": 39.22742673170944, "difficulty": "Medium", "likes": 2528, "dislikes": 437, "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": 72131, "totalSubmissionRaw": 183879}, "1803": {"acRate": 48.13334735513724, "difficulty": "Hard", "likes": 521, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1803", "paidOnly": false, "title": "Count Pairs With XOR in a Range", "titleSlug": "count-pairs-with-xor-in-a-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9154, "totalSubmissionRaw": 19018}, "1804": {"acRate": 61.4884003237119, "difficulty": "Medium", "likes": 314, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1804", "paidOnly": true, "title": "Implement Trie II (Prefix Tree)", "titleSlug": "implement-trie-ii-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18235, "totalSubmissionRaw": 29656}, "1805": {"acRate": 37.85301745397845, "difficulty": "Easy", "likes": 608, "dislikes": 97, "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": 47582, "totalSubmissionRaw": 125702}, "1806": {"acRate": 72.5330856744834, "difficulty": "Medium", "likes": 313, "dislikes": 163, "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": 18744, "totalSubmissionRaw": 25842}, "1807": {"acRate": 66.79221179683714, "difficulty": "Medium", "likes": 479, "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": 30325, "totalSubmissionRaw": 45402}, "1808": {"acRate": 32.80975656052769, "difficulty": "Hard", "likes": 222, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6914, "totalSubmissionRaw": 21073}, "1809": {"acRate": 58.429111601961736, "difficulty": "Easy", "likes": 87, "dislikes": 58, "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": 15607, "totalSubmissionRaw": 26711}, "1810": {"acRate": 56.112737920937036, "difficulty": "Medium", "likes": 82, "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": 3066, "totalSubmissionRaw": 5464}, "1811": {"acRate": 60.84072564532885, "difficulty": "Medium", "likes": 196, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15226, "totalSubmissionRaw": 25026}, "1812": {"acRate": 78.32189403871365, "difficulty": "Easy", "likes": 806, "dislikes": 18, "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": 81248, "totalSubmissionRaw": 103736}, "1813": {"acRate": 33.483411373914436, "difficulty": "Medium", "likes": 396, "dislikes": 66, "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": 16733, "totalSubmissionRaw": 49974}, "1814": {"acRate": 48.95177151972736, "difficulty": "Medium", "likes": 1802, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108016, "totalSubmissionRaw": 220658}, "1815": {"acRate": 39.90223036969142, "difficulty": "Hard", "likes": 340, "dislikes": 26, "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": 6530, "totalSubmissionRaw": 16365}, "1816": {"acRate": 85.03272520475468, "difficulty": "Easy", "likes": 1124, "dislikes": 32, "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": 167466, "totalSubmissionRaw": 196943}, "1817": {"acRate": 80.48037606742511, "difficulty": "Medium", "likes": 818, "dislikes": 303, "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": 57867, "totalSubmissionRaw": 71902}, "1818": {"acRate": 30.581114992865228, "difficulty": "Medium", "likes": 1013, "dislikes": 75, "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": 24860, "totalSubmissionRaw": 81292}, "1819": {"acRate": 40.55050823063776, "difficulty": "Hard", "likes": 410, "dislikes": 43, "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": 9016, "totalSubmissionRaw": 22234}, "1820": {"acRate": 49.5537611559711, "difficulty": "Medium", "likes": 202, "dislikes": 60, "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": 6996, "totalSubmissionRaw": 14118}, "1821": {"acRate": 87.89606159312999, "difficulty": "Easy", "likes": 57, "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": 23746, "totalSubmissionRaw": 27016}, "1822": {"acRate": 65.28417788973937, "difficulty": "Easy", "likes": 2146, "dislikes": 216, "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": 336899, "totalSubmissionRaw": 516050}, "1823": {"acRate": 78.35844125334039, "difficulty": "Medium", "likes": 2967, "dislikes": 68, "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": 133417, "totalSubmissionRaw": 170265}, "1824": {"acRate": 49.9147588894301, "difficulty": "Medium", "likes": 1175, "dislikes": 47, "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": 40990, "totalSubmissionRaw": 82120}, "1825": {"acRate": 37.1380429355966, "difficulty": "Hard", "likes": 433, "dislikes": 126, "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": 17853, "totalSubmissionRaw": 48072}, "1826": {"acRate": 50.056003584229394, "difficulty": "Easy", "likes": 66, "dislikes": 72, "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": 4469, "totalSubmissionRaw": 8928}, "1827": {"acRate": 79.40500106860439, "difficulty": "Easy", "likes": 1201, "dislikes": 62, "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": 92884, "totalSubmissionRaw": 116975}, "1828": {"acRate": 86.25429165160824, "difficulty": "Medium", "likes": 1131, "dislikes": 82, "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": 76373, "totalSubmissionRaw": 88544}, "1829": {"acRate": 77.16697936210132, "difficulty": "Medium", "likes": 764, "dislikes": 60, "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": 28791, "totalSubmissionRaw": 37310}, "1830": {"acRate": 49.37014887390253, "difficulty": "Hard", "likes": 175, "dislikes": 125, "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": 3880, "totalSubmissionRaw": 7859}, "1831": {"acRate": 81.53933665879059, "difficulty": "Medium", "likes": 86, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18635, "totalSubmissionRaw": 22854}, "1832": {"acRate": 83.23711268927234, "difficulty": "Easy", "likes": 2735, "dislikes": 56, "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": 337087, "totalSubmissionRaw": 404972}, "1833": {"acRate": 73.79124699338546, "difficulty": "Medium", "likes": 2158, "dislikes": 670, "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": 157075, "totalSubmissionRaw": 212864}, "1834": {"acRate": 45.545437699047156, "difficulty": "Medium", "likes": 3125, "dislikes": 263, "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": 105685, "totalSubmissionRaw": 232043}, "1835": {"acRate": 61.08498753432007, "difficulty": "Hard", "likes": 593, "dislikes": 48, "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": 19356, "totalSubmissionRaw": 31687}, "1836": {"acRate": 71.88812958744622, "difficulty": "Medium", "likes": 373, "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": 28403, "totalSubmissionRaw": 39510}, "1837": {"acRate": 77.40482251651841, "difficulty": "Easy", "likes": 506, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1837", "paidOnly": false, "title": "Sum of Digits in Base K", "titleSlug": "sum-of-digits-in-base-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54123, "totalSubmissionRaw": 69922}, "1838": {"acRate": 44.746297377012986, "difficulty": "Medium", "likes": 4501, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1838", "paidOnly": false, "title": "Frequency of the Most Frequent Element", "titleSlug": "frequency-of-the-most-frequent-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141847, "totalSubmissionRaw": 317004}, "1839": {"acRate": 49.28710767132413, "difficulty": "Medium", "likes": 744, "dislikes": 23, "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": 31077, "totalSubmissionRaw": 63053}, "1840": {"acRate": 36.047561709813365, "difficulty": "Hard", "likes": 372, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7185, "totalSubmissionRaw": 19932}, "1841": {"acRate": 53.29838357361293, "difficulty": "Medium", "likes": 107, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13420, "totalSubmissionRaw": 25179}, "1842": {"acRate": 53.24174273078008, "difficulty": "Hard", "likes": 121, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1842", "paidOnly": true, "title": "Next Palindrome Using Same Digits", "titleSlug": "next-palindrome-using-same-digits", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5658, "totalSubmissionRaw": 10627}, "1843": {"acRate": 44.64625988242449, "difficulty": "Medium", "likes": 90, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11012, "totalSubmissionRaw": 24665}, "1844": {"acRate": 81.19742561960143, "difficulty": "Easy", "likes": 821, "dislikes": 103, "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": 86295, "totalSubmissionRaw": 106278}, "1845": {"acRate": 69.22879850610312, "difficulty": "Medium", "likes": 1399, "dislikes": 86, "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": 121599, "totalSubmissionRaw": 175648}, "1846": {"acRate": 65.8908966148216, "difficulty": "Medium", "likes": 1069, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103707, "totalSubmissionRaw": 157392}, "1847": {"acRate": 37.73910118972548, "difficulty": "Hard", "likes": 506, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8977, "totalSubmissionRaw": 23787}, "1848": {"acRate": 54.58897668567799, "difficulty": "Easy", "likes": 358, "dislikes": 66, "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": 44698, "totalSubmissionRaw": 81881}, "1849": {"acRate": 35.518533258312864, "difficulty": "Medium", "likes": 516, "dislikes": 116, "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": 25882, "totalSubmissionRaw": 72868}, "1850": {"acRate": 71.21723590150914, "difficulty": "Medium", "likes": 762, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1850", "paidOnly": false, "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "titleSlug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21519, "totalSubmissionRaw": 30216}, "1851": {"acRate": 49.591530259798766, "difficulty": "Hard", "likes": 927, "dislikes": 31, "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": 33023, "totalSubmissionRaw": 66590}, "1852": {"acRate": 71.29331381161542, "difficulty": "Medium", "likes": 132, "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": 7304, "totalSubmissionRaw": 10245}, "1853": {"acRate": 85.76275696893087, "difficulty": "Easy", "likes": 62, "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": 12891, "totalSubmissionRaw": 15031}, "1854": {"acRate": 60.68514050525121, "difficulty": "Easy", "likes": 1279, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "1854", "paidOnly": false, "title": "Maximum Population Year", "titleSlug": "maximum-population-year", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68414, "totalSubmissionRaw": 112736}, "1855": {"acRate": 53.43555900621118, "difficulty": "Medium", "likes": 1186, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1855", "paidOnly": false, "title": "Maximum Distance Between a Pair of Values", "titleSlug": "maximum-distance-between-a-pair-of-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49554, "totalSubmissionRaw": 92734}, "1856": {"acRate": 37.969373061586175, "difficulty": "Medium", "likes": 1410, "dislikes": 112, "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": 27423, "totalSubmissionRaw": 72224}, "1857": {"acRate": 50.1562680865841, "difficulty": "Hard", "likes": 2092, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1857", "paidOnly": false, "title": "Largest Color Value in a Directed Graph", "titleSlug": "largest-color-value-in-a-directed-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64995, "totalSubmissionRaw": 129585}, "1858": {"acRate": 68.38778598771476, "difficulty": "Medium", "likes": 178, "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": 7682, "totalSubmissionRaw": 11233}, "1859": {"acRate": 83.1122726448728, "difficulty": "Easy", "likes": 2149, "dislikes": 76, "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": 165051, "totalSubmissionRaw": 198588}, "1860": {"acRate": 71.98342437370503, "difficulty": "Medium", "likes": 218, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19108, "totalSubmissionRaw": 26545}, "1861": {"acRate": 67.41779719475741, "difficulty": "Medium", "likes": 973, "dislikes": 55, "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": 52776, "totalSubmissionRaw": 78282}, "1862": {"acRate": 28.72330387192149, "difficulty": "Hard", "likes": 434, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1862", "paidOnly": false, "title": "Sum of Floored Pairs", "titleSlug": "sum-of-floored-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9132, "totalSubmissionRaw": 31793}, "1863": {"acRate": 87.83494023153595, "difficulty": "Easy", "likes": 2106, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1863", "paidOnly": false, "title": "Sum of All Subset XOR Totals", "titleSlug": "sum-of-all-subset-xor-totals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172456, "totalSubmissionRaw": 196341}, "1864": {"acRate": 43.33000451001868, "difficulty": "Medium", "likes": 578, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1864", "paidOnly": false, "title": "Minimum Number of Swaps to Make the Binary String Alternating", "titleSlug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26901, "totalSubmissionRaw": 62084}, "1865": {"acRate": 50.93859241447595, "difficulty": "Medium", "likes": 602, "dislikes": 106, "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": 25209, "totalSubmissionRaw": 49489}, "1866": {"acRate": 57.14857028594281, "difficulty": "Hard", "likes": 698, "dislikes": 21, "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": 14290, "totalSubmissionRaw": 25005}, "1867": {"acRate": 70.99202834366696, "difficulty": "Medium", "likes": 72, "dislikes": 266, "categoryTitle": "Database", "frontendQuestionId": "1867", "paidOnly": true, "title": "Orders With Maximum Quantity Above Average", "titleSlug": "orders-with-maximum-quantity-above-average", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16030, "totalSubmissionRaw": 22580}, "1868": {"acRate": 58.49404404474298, "difficulty": "Medium", "likes": 364, "dislikes": 64, "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": 41886, "totalSubmissionRaw": 71606}, "1869": {"acRate": 61.0205518919265, "difficulty": "Easy", "likes": 511, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1869", "paidOnly": false, "title": "Longer Contiguous Segments of Ones than Zeros", "titleSlug": "longer-contiguous-segments-of-ones-than-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47654, "totalSubmissionRaw": 78095}, "1870": {"acRate": 46.737911440907645, "difficulty": "Medium", "likes": 2286, "dislikes": 275, "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": 100021, "totalSubmissionRaw": 214004}, "1871": {"acRate": 24.863408877330244, "difficulty": "Medium", "likes": 1650, "dislikes": 102, "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": 45507, "totalSubmissionRaw": 183027}, "1872": {"acRate": 52.92229729729729, "difficulty": "Hard", "likes": 441, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9399, "totalSubmissionRaw": 17760}, "1873": {"acRate": 57.610239044407905, "difficulty": "Easy", "likes": 1074, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1873", "paidOnly": false, "title": "Calculate Special Bonus", "titleSlug": "calculate-special-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236134, "totalSubmissionRaw": 409882}, "1874": {"acRate": 89.35585771185276, "difficulty": "Medium", "likes": 243, "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": 19518, "totalSubmissionRaw": 21843}, "1875": {"acRate": 67.73131569827885, "difficulty": "Medium", "likes": 71, "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": 11727, "totalSubmissionRaw": 17314}, "1876": {"acRate": 73.44107776741255, "difficulty": "Easy", "likes": 1482, "dislikes": 45, "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": 121238, "totalSubmissionRaw": 165082}, "1877": {"acRate": 81.44412505998164, "difficulty": "Medium", "likes": 1928, "dislikes": 432, "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": 174819, "totalSubmissionRaw": 214649}, "1878": {"acRate": 47.65711396884578, "difficulty": "Medium", "likes": 206, "dislikes": 515, "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": 15083, "totalSubmissionRaw": 31649}, "1879": {"acRate": 47.403232882259644, "difficulty": "Hard", "likes": 669, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14047, "totalSubmissionRaw": 29633}, "1880": {"acRate": 74.11783168183652, "difficulty": "Easy", "likes": 567, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66121, "totalSubmissionRaw": 89210}, "1881": {"acRate": 37.9001889639609, "difficulty": "Medium", "likes": 377, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27879, "totalSubmissionRaw": 73559}, "1882": {"acRate": 40.14189057632399, "difficulty": "Medium", "likes": 909, "dislikes": 267, "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": 32987, "totalSubmissionRaw": 82176}, "1883": {"acRate": 37.78266850068776, "difficulty": "Hard", "likes": 331, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6867, "totalSubmissionRaw": 18175}, "1884": {"acRate": 72.75359210808492, "difficulty": "Medium", "likes": 1428, "dislikes": 138, "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": 47495, "totalSubmissionRaw": 65282}, "1885": {"acRate": 60.848974877274046, "difficulty": "Medium", "likes": 235, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10536, "totalSubmissionRaw": 17315}, "1886": {"acRate": 56.79254210836523, "difficulty": "Easy", "likes": 1417, "dislikes": 117, "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": 68414, "totalSubmissionRaw": 120463}, "1887": {"acRate": 72.94855962283788, "difficulty": "Medium", "likes": 1220, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93922, "totalSubmissionRaw": 128751}, "1888": {"acRate": 39.89398238017022, "difficulty": "Medium", "likes": 1186, "dislikes": 70, "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": 26717, "totalSubmissionRaw": 66970}, "1889": {"acRate": 31.637289658960405, "difficulty": "Hard", "likes": 400, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1889", "paidOnly": false, "title": "Minimum Space Wasted From Packaging", "titleSlug": "minimum-space-wasted-from-packaging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12671, "totalSubmissionRaw": 40052}, "1890": {"acRate": 77.17394233965518, "difficulty": "Easy", "likes": 405, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85900, "totalSubmissionRaw": 111307}, "1891": {"acRate": 49.559679194841955, "difficulty": "Medium", "likes": 567, "dislikes": 40, "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": 63030, "totalSubmissionRaw": 127177}, "1892": {"acRate": 43.24070008155072, "difficulty": "Hard", "likes": 84, "dislikes": 21, "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": 6894, "totalSubmissionRaw": 15942}, "1893": {"acRate": 49.905279255015635, "difficulty": "Easy", "likes": 587, "dislikes": 110, "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": 43729, "totalSubmissionRaw": 87625}, "1894": {"acRate": 45.29476619754848, "difficulty": "Medium", "likes": 564, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34920, "totalSubmissionRaw": 77095}, "1895": {"acRate": 52.4659419945887, "difficulty": "Medium", "likes": 288, "dislikes": 258, "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": 11053, "totalSubmissionRaw": 21067}, "1896": {"acRate": 54.05802914828186, "difficulty": "Hard", "likes": 234, "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": 4043, "totalSubmissionRaw": 7479}, "1897": {"acRate": 67.28859920827156, "difficulty": "Easy", "likes": 1088, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137513, "totalSubmissionRaw": 204363}, "1898": {"acRate": 43.601686821340934, "difficulty": "Medium", "likes": 964, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "1898", "paidOnly": false, "title": "Maximum Number of Removable Characters", "titleSlug": "maximum-number-of-removable-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29674, "totalSubmissionRaw": 68057}, "1899": {"acRate": 65.88793922127255, "difficulty": "Medium", "likes": 781, "dislikes": 59, "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": 58973, "totalSubmissionRaw": 89505}, "1900": {"acRate": 50.956374257985495, "difficulty": "Hard", "likes": 227, "dislikes": 18, "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": 5408, "totalSubmissionRaw": 10613}, "1901": {"acRate": 51.3555301233127, "difficulty": "Medium", "likes": 2001, "dislikes": 127, "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": 67759, "totalSubmissionRaw": 131941}, "1902": {"acRate": 44.482824793705625, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "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": 2318, "totalSubmissionRaw": 5211}, "1903": {"acRate": 63.18598041515039, "difficulty": "Easy", "likes": 2003, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1903", "paidOnly": false, "title": "Largest Odd Number in String", "titleSlug": "largest-odd-number-in-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250552, "totalSubmissionRaw": 396531}, "1904": {"acRate": 43.99814489948179, "difficulty": "Medium", "likes": 211, "dislikes": 259, "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": 21820, "totalSubmissionRaw": 49593}, "1905": {"acRate": 67.33043803051054, "difficulty": "Medium", "likes": 2056, "dislikes": 62, "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": 91935, "totalSubmissionRaw": 136543}, "1906": {"acRate": 44.284736481861735, "difficulty": "Medium", "likes": 529, "dislikes": 41, "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": 10999, "totalSubmissionRaw": 24837}, "1907": {"acRate": 57.942932210266015, "difficulty": "Medium", "likes": 396, "dislikes": 82, "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": 89979, "totalSubmissionRaw": 155289}, "1908": {"acRate": 63.095238095238095, "difficulty": "Medium", "likes": 102, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1908", "paidOnly": true, "title": "Game of Nim", "titleSlug": "game-of-nim", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4452, "totalSubmissionRaw": 7056}, "1909": {"acRate": 27.37689450286035, "difficulty": "Easy", "likes": 1226, "dislikes": 330, "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": 64414, "totalSubmissionRaw": 235286}, "1910": {"acRate": 77.25124800885104, "difficulty": "Medium", "likes": 1756, "dislikes": 59, "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": 115907, "totalSubmissionRaw": 150039}, "1911": {"acRate": 59.171029952193564, "difficulty": "Medium", "likes": 1197, "dislikes": 23, "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": 36389, "totalSubmissionRaw": 61498}, "1912": {"acRate": 36.41605426794799, "difficulty": "Hard", "likes": 238, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6442, "totalSubmissionRaw": 17690}, "1913": {"acRate": 82.81468591121575, "difficulty": "Easy", "likes": 1497, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242703, "totalSubmissionRaw": 293068}, "1914": {"acRate": 49.39072327044025, "difficulty": "Medium", "likes": 238, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12565, "totalSubmissionRaw": 25440}, "1915": {"acRate": 67.16409239171031, "difficulty": "Medium", "likes": 1705, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80924, "totalSubmissionRaw": 120487}, "1916": {"acRate": 48.54428232100441, "difficulty": "Hard", "likes": 477, "dislikes": 52, "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": 7153, "totalSubmissionRaw": 14735}, "1917": {"acRate": 26.64624808575804, "difficulty": "Hard", "likes": 66, "dislikes": 60, "categoryTitle": "Database", "frontendQuestionId": "1917", "paidOnly": true, "title": "Leetcodify Friends Recommendations", "titleSlug": "leetcodify-friends-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6264, "totalSubmissionRaw": 23508}, "1918": {"acRate": 52.76679841897233, "difficulty": "Medium", "likes": 201, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4272, "totalSubmissionRaw": 8096}, "1919": {"acRate": 41.461532525657844, "difficulty": "Hard", "likes": 58, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "1919", "paidOnly": true, "title": "Leetcodify Similar Friends", "titleSlug": "leetcodify-similar-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5373, "totalSubmissionRaw": 12959}, "1920": {"acRate": 89.79136390153647, "difficulty": "Easy", "likes": 3298, "dislikes": 390, "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": 520231, "totalSubmissionRaw": 579378}, "1921": {"acRate": 50.96078014686785, "difficulty": "Medium", "likes": 1491, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107912, "totalSubmissionRaw": 211755}, "1922": {"acRate": 44.797850213308635, "difficulty": "Medium", "likes": 1337, "dislikes": 418, "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": 59014, "totalSubmissionRaw": 131734}, "1923": {"acRate": 28.15363469761759, "difficulty": "Hard", "likes": 469, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7374, "totalSubmissionRaw": 26192}, "1924": {"acRate": 51.45560407569141, "difficulty": "Hard", "likes": 13, "dislikes": 42, "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": 707, "totalSubmissionRaw": 1374}, "1925": {"acRate": 67.80670153595707, "difficulty": "Easy", "likes": 421, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1925", "paidOnly": false, "title": "Count Square Sum Triples", "titleSlug": "count-square-sum-triples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44985, "totalSubmissionRaw": 66343}, "1926": {"acRate": 46.595254838119274, "difficulty": "Medium", "likes": 2266, "dislikes": 103, "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": 145113, "totalSubmissionRaw": 311433}, "1927": {"acRate": 47.763551712670434, "difficulty": "Medium", "likes": 491, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11490, "totalSubmissionRaw": 24056}, "1928": {"acRate": 37.85904469904793, "difficulty": "Hard", "likes": 775, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18769, "totalSubmissionRaw": 49576}, "1929": {"acRate": 89.85486038912379, "difficulty": "Easy", "likes": 3255, "dislikes": 380, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 761421, "totalSubmissionRaw": 847389}, "1930": {"acRate": 66.0376409650369, "difficulty": "Medium", "likes": 1707, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1930", "paidOnly": false, "title": "Unique Length-3 Palindromic Subsequences", "titleSlug": "unique-length-3-palindromic-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105054, "totalSubmissionRaw": 159082}, "1931": {"acRate": 57.59756778556804, "difficulty": "Hard", "likes": 473, "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": 9283, "totalSubmissionRaw": 16117}, "1932": {"acRate": 36.20872816895424, "difficulty": "Hard", "likes": 564, "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": 8521, "totalSubmissionRaw": 23533}, "1933": {"acRate": 50.58131582546848, "difficulty": "Easy", "likes": 57, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1933", "paidOnly": true, "title": "Check if String Is Decomposable Into Value-Equal Substrings", "titleSlug": "check-if-string-is-decomposable-into-value-equal-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3698, "totalSubmissionRaw": 7311}, "1934": {"acRate": 57.75219909056756, "difficulty": "Medium", "likes": 785, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 178314, "totalSubmissionRaw": 308756}, "1935": {"acRate": 73.21909635515973, "difficulty": "Easy", "likes": 588, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1935", "paidOnly": false, "title": "Maximum Number of Words You Can Type", "titleSlug": "maximum-number-of-words-you-can-type", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59522, "totalSubmissionRaw": 81293}, "1936": {"acRate": 42.90875405280222, "difficulty": "Medium", "likes": 365, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1936", "paidOnly": false, "title": "Add Minimum Number of Rungs", "titleSlug": "add-minimum-number-of-rungs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27792, "totalSubmissionRaw": 64770}, "1937": {"acRate": 35.69016678604318, "difficulty": "Medium", "likes": 2309, "dislikes": 139, "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": false, "hasVideoSolution": false, "totalAcceptedRaw": 59296, "totalSubmissionRaw": 166141}, "1938": {"acRate": 42.31071934519125, "difficulty": "Hard", "likes": 377, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5376, "totalSubmissionRaw": 12706}, "1939": {"acRate": 56.35749385749386, "difficulty": "Easy", "likes": 62, "dislikes": 47, "categoryTitle": "Database", "frontendQuestionId": "1939", "paidOnly": true, "title": "Users That Actively Request Confirmation Messages", "titleSlug": "users-that-actively-request-confirmation-messages", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11010, "totalSubmissionRaw": 19536}, "1940": {"acRate": 81.31812966150316, "difficulty": "Medium", "likes": 179, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11336, "totalSubmissionRaw": 13941}, "1941": {"acRate": 77.46755609460278, "difficulty": "Easy", "likes": 870, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1941", "paidOnly": false, "title": "Check if All Characters Have Equal Number of Occurrences", "titleSlug": "check-if-all-characters-have-equal-number-of-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95808, "totalSubmissionRaw": 123675}, "1942": {"acRate": 42.00267817289094, "difficulty": "Medium", "likes": 567, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16938, "totalSubmissionRaw": 40326}, "1943": {"acRate": 49.686674811807826, "difficulty": "Medium", "likes": 471, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12607, "totalSubmissionRaw": 25373}, "1944": {"acRate": 69.67288761279737, "difficulty": "Hard", "likes": 1703, "dislikes": 51, "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": 54355, "totalSubmissionRaw": 78014}, "1945": {"acRate": 62.555687203791464, "difficulty": "Easy", "likes": 599, "dislikes": 63, "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": 52797, "totalSubmissionRaw": 84400}, "1946": {"acRate": 35.73892889368553, "difficulty": "Medium", "likes": 214, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "1946", "paidOnly": false, "title": "Largest Number After Mutating Substring", "titleSlug": "largest-number-after-mutating-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20200, "totalSubmissionRaw": 56521}, "1947": {"acRate": 62.04461155429094, "difficulty": "Medium", "likes": 768, "dislikes": 24, "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": 24422, "totalSubmissionRaw": 39362}, "1948": {"acRate": 56.029279568511626, "difficulty": "Hard", "likes": 316, "dislikes": 71, "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": 8726, "totalSubmissionRaw": 15574}, "1949": {"acRate": 54.45680538387584, "difficulty": "Medium", "likes": 145, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11895, "totalSubmissionRaw": 21843}, "1950": {"acRate": 49.771070035611324, "difficulty": "Medium", "likes": 136, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2935, "totalSubmissionRaw": 5897}, "1951": {"acRate": 68.83140376266282, "difficulty": "Medium", "likes": 94, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "1951", "paidOnly": true, "title": "All the Pairs With the Maximum Number of Common Followers", "titleSlug": "all-the-pairs-with-the-maximum-number-of-common-followers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11415, "totalSubmissionRaw": 16584}, "1952": {"acRate": 60.76469648278678, "difficulty": "Easy", "likes": 521, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68447, "totalSubmissionRaw": 112644}, "1953": {"acRate": 40.539789020003134, "difficulty": "Medium", "likes": 641, "dislikes": 144, "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": 23327, "totalSubmissionRaw": 57541}, "1954": {"acRate": 54.12632399766066, "difficulty": "Medium", "likes": 374, "dislikes": 91, "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": 16659, "totalSubmissionRaw": 30778}, "1955": {"acRate": 51.02286401925391, "difficulty": "Hard", "likes": 513, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1955", "paidOnly": false, "title": "Count Number of Special Subsequences", "titleSlug": "count-number-of-special-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11448, "totalSubmissionRaw": 22437}, "1956": {"acRate": 47.16329551060681, "difficulty": "Hard", "likes": 31, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1956", "paidOnly": true, "title": "Minimum Time For K Virus Variants to Spread", "titleSlug": "minimum-time-for-k-virus-variants-to-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 956, "totalSubmissionRaw": 2027}, "1957": {"acRate": 58.01623140809045, "difficulty": "Easy", "likes": 435, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36744, "totalSubmissionRaw": 63334}, "1958": {"acRate": 47.71962271130017, "difficulty": "Medium", "likes": 149, "dislikes": 268, "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": 12901, "totalSubmissionRaw": 27035}, "1959": {"acRate": 42.80283303822519, "difficulty": "Medium", "likes": 557, "dislikes": 51, "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": 8219, "totalSubmissionRaw": 19202}, "1960": {"acRate": 30.558183538315987, "difficulty": "Hard", "likes": 240, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3553, "totalSubmissionRaw": 11627}, "1961": {"acRate": 52.803580735154355, "difficulty": "Easy", "likes": 483, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51672, "totalSubmissionRaw": 97857}, "1962": {"acRate": 62.11149327174132, "difficulty": "Medium", "likes": 1799, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1962", "paidOnly": false, "title": "Remove Stones to Minimize the Total", "titleSlug": "remove-stones-to-minimize-the-total", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98960, "totalSubmissionRaw": 159327}, "1963": {"acRate": 71.60164768597043, "difficulty": "Medium", "likes": 1768, "dislikes": 74, "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": 73874, "totalSubmissionRaw": 103174}, "1964": {"acRate": 62.99488758177121, "difficulty": "Hard", "likes": 1772, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57297, "totalSubmissionRaw": 90955}, "1965": {"acRate": 72.18309438113573, "difficulty": "Easy", "likes": 690, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120732, "totalSubmissionRaw": 167258}, "1966": {"acRate": 64.89815253434391, "difficulty": "Medium", "likes": 70, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2740, "totalSubmissionRaw": 4222}, "1967": {"acRate": 80.79694539189552, "difficulty": "Easy", "likes": 686, "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": 69407, "totalSubmissionRaw": 85903}, "1968": {"acRate": 50.10953131758501, "difficulty": "Medium", "likes": 603, "dislikes": 48, "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": 35913, "totalSubmissionRaw": 71669}, "1969": {"acRate": 35.40432395545767, "difficulty": "Medium", "likes": 238, "dislikes": 366, "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": 11414, "totalSubmissionRaw": 32239}, "1970": {"acRate": 61.936061155052805, "difficulty": "Hard", "likes": 1877, "dislikes": 34, "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": 56067, "totalSubmissionRaw": 90524}, "1971": {"acRate": 54.21633328004476, "difficulty": "Easy", "likes": 3833, "dislikes": 219, "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": 434093, "totalSubmissionRaw": 800667}, "1972": {"acRate": 50.176150314935406, "difficulty": "Hard", "likes": 133, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1972", "paidOnly": true, "title": "First and Last Call On the Same Day", "titleSlug": "first-and-last-call-on-the-same-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9400, "totalSubmissionRaw": 18734}, "1973": {"acRate": 76.88445179584122, "difficulty": "Medium", "likes": 174, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13015, "totalSubmissionRaw": 16928}, "1974": {"acRate": 75.17873061930815, "difficulty": "Easy", "likes": 682, "dislikes": 28, "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": 43009, "totalSubmissionRaw": 57209}, "1975": {"acRate": 49.49530484669716, "difficulty": "Medium", "likes": 548, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18290, "totalSubmissionRaw": 36953}, "1976": {"acRate": 27.91053416862389, "difficulty": "Medium", "likes": 2682, "dislikes": 119, "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": 59299, "totalSubmissionRaw": 212461}, "1977": {"acRate": 20.80018717828732, "difficulty": "Hard", "likes": 508, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6223, "totalSubmissionRaw": 29918}, "1978": {"acRate": 47.862532974254805, "difficulty": "Easy", "likes": 327, "dislikes": 33, "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": 104144, "totalSubmissionRaw": 217591}, "1979": {"acRate": 77.78744119260807, "difficulty": "Easy", "likes": 1108, "dislikes": 47, "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": 133266, "totalSubmissionRaw": 171321}, "1980": {"acRate": 74.62090379338785, "difficulty": "Medium", "likes": 1965, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138427, "totalSubmissionRaw": 185507}, "1981": {"acRate": 34.37943082843832, "difficulty": "Medium", "likes": 915, "dislikes": 138, "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": 27157, "totalSubmissionRaw": 78992}, "1982": {"acRate": 48.82910260993923, "difficulty": "Hard", "likes": 576, "dislikes": 38, "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": 5463, "totalSubmissionRaw": 11188}, "1983": {"acRate": 53.4804753820034, "difficulty": "Medium", "likes": 92, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2520, "totalSubmissionRaw": 4712}, "1984": {"acRate": 56.75853365475444, "difficulty": "Easy", "likes": 976, "dislikes": 265, "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": 75108, "totalSubmissionRaw": 132329}, "1985": {"acRate": 45.4381400033574, "difficulty": "Medium", "likes": 1226, "dislikes": 144, "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": 64962, "totalSubmissionRaw": 142968}, "1986": {"acRate": 33.182248854062635, "difficulty": "Medium", "likes": 1105, "dislikes": 66, "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": 25916, "totalSubmissionRaw": 78102}, "1987": {"acRate": 52.35966646608785, "difficulty": "Hard", "likes": 689, "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": 12182, "totalSubmissionRaw": 23266}, "1988": {"acRate": 66.89050211736237, "difficulty": "Medium", "likes": 77, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1988", "paidOnly": true, "title": "Find Cutoff Score for Each School", "titleSlug": "find-cutoff-score-for-each-school", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11057, "totalSubmissionRaw": 16530}, "1989": {"acRate": 51.494365507104355, "difficulty": "Medium", "likes": 71, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1989", "paidOnly": true, "title": "Maximum Number of People That Can Be Caught in Tag", "titleSlug": "maximum-number-of-people-that-can-be-caught-in-tag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2102, "totalSubmissionRaw": 4082}, "1990": {"acRate": 48.78048780487805, "difficulty": "Medium", "likes": 24, "dislikes": 189, "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": 6960, "totalSubmissionRaw": 14268}, "1991": {"acRate": 67.4182766656452, "difficulty": "Easy", "likes": 1353, "dislikes": 63, "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": 94602, "totalSubmissionRaw": 140321}, "1992": {"acRate": 75.87069312764154, "difficulty": "Medium", "likes": 1353, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1992", "paidOnly": false, "title": "Find All Groups of Farmland", "titleSlug": "find-all-groups-of-farmland", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126198, "totalSubmissionRaw": 166333}, "1993": {"acRate": 45.67297902667481, "difficulty": "Medium", "likes": 454, "dislikes": 77, "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": 15701, "totalSubmissionRaw": 34377}, "1994": {"acRate": 34.89340515095279, "difficulty": "Hard", "likes": 467, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1994", "paidOnly": false, "title": "The Number of Good Subsets", "titleSlug": "the-number-of-good-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7709, "totalSubmissionRaw": 22093}, "1995": {"acRate": 61.27850590761008, "difficulty": "Easy", "likes": 625, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40817, "totalSubmissionRaw": 66609}, "1996": {"acRate": 43.92041047670187, "difficulty": "Medium", "likes": 2998, "dislikes": 92, "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": 103061, "totalSubmissionRaw": 234654}, "1997": {"acRate": 37.305027751894016, "difficulty": "Medium", "likes": 483, "dislikes": 91, "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": 9208, "totalSubmissionRaw": 24683}, "1998": {"acRate": 45.68150806084803, "difficulty": "Hard", "likes": 487, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9039, "totalSubmissionRaw": 19787}, "1999": {"acRate": 49.352604637157484, "difficulty": "Medium", "likes": 28, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1999", "paidOnly": true, "title": "Smallest Greater Multiple Made of Two Digits", "titleSlug": "smallest-greater-multiple-made-of-two-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1639, "totalSubmissionRaw": 3321}, "2000": {"acRate": 86.17481094253061, "difficulty": "Easy", "likes": 1294, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253204, "totalSubmissionRaw": 293826}, "2001": {"acRate": 49.63177208093369, "difficulty": "Medium", "likes": 519, "dislikes": 47, "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": 38953, "totalSubmissionRaw": 78484}, "2002": {"acRate": 59.567255377919146, "difficulty": "Medium", "likes": 929, "dislikes": 73, "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": 28466, "totalSubmissionRaw": 47788}, "2003": {"acRate": 46.4670388541138, "difficulty": "Hard", "likes": 442, "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": 8240, "totalSubmissionRaw": 17733}, "2004": {"acRate": 42.91197543500512, "difficulty": "Hard", "likes": 117, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2004", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8385, "totalSubmissionRaw": 19540}, "2005": {"acRate": 58.91181988742964, "difficulty": "Hard", "likes": 16, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2005", "paidOnly": true, "title": "Subtree Removal Game with Fibonacci Tree", "titleSlug": "subtree-removal-game-with-fibonacci-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 628, "totalSubmissionRaw": 1066}, "2006": {"acRate": 83.8109569191328, "difficulty": "Easy", "likes": 1615, "dislikes": 41, "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": 150382, "totalSubmissionRaw": 179430}, "2007": {"acRate": 40.4879108151151, "difficulty": "Medium", "likes": 2430, "dislikes": 114, "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": 134232, "totalSubmissionRaw": 331536}, "2008": {"acRate": 44.24380206909452, "difficulty": "Medium", "likes": 1262, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30749, "totalSubmissionRaw": 69499}, "2009": {"acRate": 52.8197273041077, "difficulty": "Hard", "likes": 1848, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73449, "totalSubmissionRaw": 139056}, "2010": {"acRate": 61.98665007353773, "difficulty": "Hard", "likes": 38, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2010", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company II", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5479, "totalSubmissionRaw": 8839}, "2011": {"acRate": 89.07705894298384, "difficulty": "Easy", "likes": 1580, "dislikes": 176, "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": 377234, "totalSubmissionRaw": 423489}, "2012": {"acRate": 48.081512378343604, "difficulty": "Medium", "likes": 602, "dislikes": 62, "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": 23170, "totalSubmissionRaw": 48189}, "2013": {"acRate": 50.90687832328275, "difficulty": "Medium", "likes": 845, "dislikes": 228, "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": 65677, "totalSubmissionRaw": 129014}, "2014": {"acRate": 55.48633725046015, "difficulty": "Hard", "likes": 455, "dislikes": 79, "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": 7838, "totalSubmissionRaw": 14126}, "2015": {"acRate": 59.27042508290624, "difficulty": "Medium", "likes": 51, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1966, "totalSubmissionRaw": 3317}, "2016": {"acRate": 56.295615468409586, "difficulty": "Easy", "likes": 994, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2016", "paidOnly": false, "title": "Maximum Difference Between Increasing Elements", "titleSlug": "maximum-difference-between-increasing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82685, "totalSubmissionRaw": 146878}, "2017": {"acRate": 45.59826704923328, "difficulty": "Medium", "likes": 896, "dislikes": 39, "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": 23997, "totalSubmissionRaw": 52627}, "2018": {"acRate": 49.34354485776805, "difficulty": "Medium", "likes": 282, "dislikes": 292, "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": 19844, "totalSubmissionRaw": 40216}, "2019": {"acRate": 33.60982083609821, "difficulty": "Hard", "likes": 265, "dislikes": 79, "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": 7091, "totalSubmissionRaw": 21098}, "2020": {"acRate": 71.6013986013986, "difficulty": "Medium", "likes": 27, "dislikes": 211, "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": 10239, "totalSubmissionRaw": 14300}, "2021": {"acRate": 62.08310847274689, "difficulty": "Medium", "likes": 150, "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": 5752, "totalSubmissionRaw": 9265}, "2022": {"acRate": 61.42746982234482, "difficulty": "Easy", "likes": 764, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2022", "paidOnly": false, "title": "Convert 1D Array Into 2D Array", "titleSlug": "convert-1d-array-into-2d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82846, "totalSubmissionRaw": 134868}, "2023": {"acRate": 74.75208746520892, "difficulty": "Medium", "likes": 691, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44852, "totalSubmissionRaw": 60001}, "2024": {"acRate": 67.18437871342775, "difficulty": "Medium", "likes": 2827, "dislikes": 41, "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": 104595, "totalSubmissionRaw": 155684}, "2025": {"acRate": 33.922412122621395, "difficulty": "Hard", "likes": 454, "dislikes": 50, "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": 8753, "totalSubmissionRaw": 25803}, "2026": {"acRate": 84.30607758315013, "difficulty": "Easy", "likes": 51, "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": 11888, "totalSubmissionRaw": 14101}, "2027": {"acRate": 54.542314335060446, "difficulty": "Easy", "likes": 468, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2027", "paidOnly": false, "title": "Minimum Moves to Convert String", "titleSlug": "minimum-moves-to-convert-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36317, "totalSubmissionRaw": 66585}, "2028": {"acRate": 46.61282617782289, "difficulty": "Medium", "likes": 477, "dislikes": 42, "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": 31225, "totalSubmissionRaw": 66988}, "2029": {"acRate": 28.179064991123333, "difficulty": "Medium", "likes": 231, "dislikes": 270, "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": 8095, "totalSubmissionRaw": 28727}, "2030": {"acRate": 39.09215955983494, "difficulty": "Hard", "likes": 478, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8526, "totalSubmissionRaw": 21810}, "2031": {"acRate": 52.09290119406902, "difficulty": "Medium", "likes": 166, "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": 3970, "totalSubmissionRaw": 7621}, "2032": {"acRate": 75.09787364704076, "difficulty": "Easy", "likes": 746, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68481, "totalSubmissionRaw": 91189}, "2033": {"acRate": 53.23864959254948, "difficulty": "Medium", "likes": 538, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22866, "totalSubmissionRaw": 42950}, "2034": {"acRate": 48.69373737668341, "difficulty": "Medium", "likes": 1150, "dislikes": 63, "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": 66782, "totalSubmissionRaw": 137147}, "2035": {"acRate": 20.204655219758035, "difficulty": "Hard", "likes": 2941, "dislikes": 181, "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": 25017, "totalSubmissionRaw": 123818}, "2036": {"acRate": 40.057127312295975, "difficulty": "Medium", "likes": 96, "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": 2945, "totalSubmissionRaw": 7352}, "2037": {"acRate": 82.24529481213973, "difficulty": "Easy", "likes": 773, "dislikes": 157, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71054, "totalSubmissionRaw": 86393}, "2038": {"acRate": 62.79380590112278, "difficulty": "Medium", "likes": 1558, "dislikes": 121, "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": 141887, "totalSubmissionRaw": 225957}, "2039": {"acRate": 51.74592738695303, "difficulty": "Medium", "likes": 648, "dislikes": 58, "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": 14167, "totalSubmissionRaw": 27378}, "2040": {"acRate": 29.102606316962586, "difficulty": "Hard", "likes": 678, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2040", "paidOnly": false, "title": "Kth Smallest Product of Two Sorted Arrays", "titleSlug": "kth-smallest-product-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11490, "totalSubmissionRaw": 39481}, "2041": {"acRate": 78.2182103610675, "difficulty": "Medium", "likes": 51, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9965, "totalSubmissionRaw": 12740}, "2042": {"acRate": 69.47859827816175, "difficulty": "Easy", "likes": 604, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57299, "totalSubmissionRaw": 82470}, "2043": {"acRate": 64.06468405070612, "difficulty": "Medium", "likes": 252, "dislikes": 215, "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": 26582, "totalSubmissionRaw": 41493}, "2044": {"acRate": 77.43574253075572, "difficulty": "Medium", "likes": 612, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2044", "paidOnly": false, "title": "Count Number of Maximum Bitwise-OR Subsets", "titleSlug": "count-number-of-maximum-bitwise-or-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28199, "totalSubmissionRaw": 36416}, "2045": {"acRate": 40.66879323321745, "difficulty": "Hard", "likes": 690, "dislikes": 12, "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": 11347, "totalSubmissionRaw": 27901}, "2046": {"acRate": 67.0895340326909, "difficulty": "Medium", "likes": 164, "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": 8250, "totalSubmissionRaw": 12297}, "2047": {"acRate": 29.006486787647244, "difficulty": "Easy", "likes": 291, "dislikes": 796, "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": 29155, "totalSubmissionRaw": 100512}, "2048": {"acRate": 48.40125166348955, "difficulty": "Medium", "likes": 193, "dislikes": 277, "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": 13457, "totalSubmissionRaw": 27803}, "2049": {"acRate": 49.46860646128419, "difficulty": "Medium", "likes": 1014, "dislikes": 78, "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": 25740, "totalSubmissionRaw": 52033}, "2050": {"acRate": 67.34882595431722, "difficulty": "Hard", "likes": 1493, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2050", "paidOnly": false, "title": "Parallel Courses III", "titleSlug": "parallel-courses-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77930, "totalSubmissionRaw": 115711}, "2051": {"acRate": 70.0188560653677, "difficulty": "Medium", "likes": 55, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7798, "totalSubmissionRaw": 11137}, "2052": {"acRate": 49.3646408839779, "difficulty": "Medium", "likes": 43, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2052", "paidOnly": true, "title": "Minimum Cost to Separate Sentence Into Rows", "titleSlug": "minimum-cost-to-separate-sentence-into-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1787, "totalSubmissionRaw": 3620}, "2053": {"acRate": 72.84471878657152, "difficulty": "Easy", "likes": 748, "dislikes": 32, "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": 63490, "totalSubmissionRaw": 87158}, "2054": {"acRate": 46.529321673830346, "difficulty": "Medium", "likes": 825, "dislikes": 24, "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": 18836, "totalSubmissionRaw": 40482}, "2055": {"acRate": 44.62227687983134, "difficulty": "Medium", "likes": 1186, "dislikes": 61, "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": 50798, "totalSubmissionRaw": 113838}, "2056": {"acRate": 52.76426926030202, "difficulty": "Hard", "likes": 58, "dislikes": 286, "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": 4123, "totalSubmissionRaw": 7814}, "2057": {"acRate": 72.784891539496, "difficulty": "Easy", "likes": 410, "dislikes": 136, "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": 62242, "totalSubmissionRaw": 85515}, "2058": {"acRate": 58.408005755772116, "difficulty": "Medium", "likes": 665, "dislikes": 26, "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": 35720, "totalSubmissionRaw": 61156}, "2059": {"acRate": 49.05417924274572, "difficulty": "Medium", "likes": 634, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2059", "paidOnly": false, "title": "Minimum Operations to Convert Number", "titleSlug": "minimum-operations-to-convert-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16415, "totalSubmissionRaw": 33463}, "2060": {"acRate": 43.467018759971396, "difficulty": "Hard", "likes": 303, "dislikes": 149, "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": 15802, "totalSubmissionRaw": 36354}, "2061": {"acRate": 62.517349696836874, "difficulty": "Medium", "likes": 120, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2061", "paidOnly": true, "title": "Number of Spaces Cleaning Robot Cleaned", "titleSlug": "number-of-spaces-cleaning-robot-cleaned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8558, "totalSubmissionRaw": 13689}, "2062": {"acRate": 67.69771054231107, "difficulty": "Easy", "likes": 928, "dislikes": 229, "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": 40096, "totalSubmissionRaw": 59228}, "2063": {"acRate": 53.974330105832024, "difficulty": "Medium", "likes": 821, "dislikes": 26, "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": 28764, "totalSubmissionRaw": 53292}, "2064": {"acRate": 52.42778004981968, "difficulty": "Medium", "likes": 1020, "dislikes": 40, "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": 28203, "totalSubmissionRaw": 53793}, "2065": {"acRate": 58.40204485488126, "difficulty": "Hard", "likes": 625, "dislikes": 46, "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": 21249, "totalSubmissionRaw": 36384}, "2066": {"acRate": 82.05762771787167, "difficulty": "Medium", "likes": 70, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2066", "paidOnly": true, "title": "Account Balance", "titleSlug": "account-balance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9284, "totalSubmissionRaw": 11314}, "2067": {"acRate": 47.08279310983515, "difficulty": "Medium", "likes": 100, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2542, "totalSubmissionRaw": 5399}, "2068": {"acRate": 63.775836352013634, "difficulty": "Easy", "likes": 523, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53874, "totalSubmissionRaw": 84474}, "2069": {"acRate": 24.765667001706365, "difficulty": "Medium", "likes": 164, "dislikes": 306, "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": 10595, "totalSubmissionRaw": 42780}, "2070": {"acRate": 49.47179946284691, "difficulty": "Medium", "likes": 579, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16578, "totalSubmissionRaw": 33510}, "2071": {"acRate": 33.74794289869494, "difficulty": "Hard", "likes": 517, "dislikes": 21, "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": 8818, "totalSubmissionRaw": 26129}, "2072": {"acRate": 73.5947446837329, "difficulty": "Easy", "likes": 64, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10867, "totalSubmissionRaw": 14766}, "2073": {"acRate": 69.8446808296652, "difficulty": "Easy", "likes": 1612, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208336, "totalSubmissionRaw": 298285}, "2074": {"acRate": 57.68295428957442, "difficulty": "Medium", "likes": 686, "dislikes": 335, "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": 25617, "totalSubmissionRaw": 44408}, "2075": {"acRate": 48.93005429575216, "difficulty": "Medium", "likes": 246, "dislikes": 58, "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": 13788, "totalSubmissionRaw": 28179}, "2076": {"acRate": 54.988054497320334, "difficulty": "Hard", "likes": 602, "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": 17032, "totalSubmissionRaw": 30974}, "2077": {"acRate": 54.92514781733552, "difficulty": "Medium", "likes": 124, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4366, "totalSubmissionRaw": 7949}, "2078": {"acRate": 66.1229195540456, "difficulty": "Easy", "likes": 892, "dislikes": 25, "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": 53912, "totalSubmissionRaw": 81533}, "2079": {"acRate": 79.59160722318617, "difficulty": "Medium", "likes": 894, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49541, "totalSubmissionRaw": 62244}, "2080": {"acRate": 39.844723473593405, "difficulty": "Medium", "likes": 641, "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": 20785, "totalSubmissionRaw": 52165}, "2081": {"acRate": 42.18722350026544, "difficulty": "Hard", "likes": 122, "dislikes": 149, "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": 7152, "totalSubmissionRaw": 16953}, "2082": {"acRate": 77.25675303197353, "difficulty": "Easy", "likes": 96, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2082", "paidOnly": true, "title": "The Number of Rich Customers", "titleSlug": "the-number-of-rich-customers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22423, "totalSubmissionRaw": 29024}, "2083": {"acRate": 68.75065561732929, "difficulty": "Medium", "likes": 110, "dislikes": 8, "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": 6554, "totalSubmissionRaw": 9533}, "2084": {"acRate": 86.60484286450283, "difficulty": "Medium", "likes": 79, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10086, "totalSubmissionRaw": 11646}, "2085": {"acRate": 70.28200027657515, "difficulty": "Easy", "likes": 785, "dislikes": 17, "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": 66070, "totalSubmissionRaw": 94007}, "2086": {"acRate": 46.12107882856812, "difficulty": "Medium", "likes": 529, "dislikes": 27, "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": 19922, "totalSubmissionRaw": 43195}, "2087": {"acRate": 50.889310999827316, "difficulty": "Medium", "likes": 662, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17682, "totalSubmissionRaw": 34746}, "2088": {"acRate": 64.53948704067132, "difficulty": "Hard", "likes": 362, "dislikes": 17, "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": 9537, "totalSubmissionRaw": 14777}, "2089": {"acRate": 76.28438165965669, "difficulty": "Easy", "likes": 1764, "dislikes": 90, "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": 176474, "totalSubmissionRaw": 231337}, "2090": {"acRate": 46.259546632469394, "difficulty": "Medium", "likes": 1876, "dislikes": 92, "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": 121564, "totalSubmissionRaw": 262786}, "2091": {"acRate": 54.75822249716465, "difficulty": "Medium", "likes": 943, "dislikes": 51, "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": 42488, "totalSubmissionRaw": 77592}, "2092": {"acRate": 45.79851827760533, "difficulty": "Hard", "likes": 1556, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95755, "totalSubmissionRaw": 209080}, "2093": {"acRate": 56.02073755257753, "difficulty": "Medium", "likes": 195, "dislikes": 12, "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": 5727, "totalSubmissionRaw": 10223}, "2094": {"acRate": 60.19632617358344, "difficulty": "Easy", "likes": 656, "dislikes": 260, "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": 30968, "totalSubmissionRaw": 51445}, "2095": {"acRate": 59.01519072207388, "difficulty": "Medium", "likes": 4080, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2095", "paidOnly": false, "title": "Delete the Middle Node of a Linked List", "titleSlug": "delete-the-middle-node-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 401390, "totalSubmissionRaw": 680145}, "2096": {"acRate": 48.90825588185804, "difficulty": "Medium", "likes": 2339, "dislikes": 115, "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": 98825, "totalSubmissionRaw": 202062}, "2097": {"acRate": 43.23388274567077, "difficulty": "Hard", "likes": 499, "dislikes": 25, "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": 10360, "totalSubmissionRaw": 23964}, "2098": {"acRate": 36.5050867743866, "difficulty": "Medium", "likes": 80, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3050, "totalSubmissionRaw": 8355}, "2099": {"acRate": 43.56445201091678, "difficulty": "Easy", "likes": 1233, "dislikes": 125, "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": 49643, "totalSubmissionRaw": 113953}, "2100": {"acRate": 49.54696466324373, "difficulty": "Medium", "likes": 878, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2100", "paidOnly": false, "title": "Find Good Days to Rob the Bank", "titleSlug": "find-good-days-to-rob-the-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26248, "totalSubmissionRaw": 52975}, "2101": {"acRate": 48.692548795551566, "difficulty": "Medium", "likes": 3014, "dislikes": 150, "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": 121019, "totalSubmissionRaw": 248537}, "2102": {"acRate": 64.65368711233633, "difficulty": "Hard", "likes": 374, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2102", "paidOnly": false, "title": "Sequentially Ordinal Rank Tracker", "titleSlug": "sequentially-ordinal-rank-tracker", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15010, "totalSubmissionRaw": 23216}, "2103": {"acRate": 80.75229297043144, "difficulty": "Easy", "likes": 947, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2103", "paidOnly": false, "title": "Rings and Rods", "titleSlug": "rings-and-rods", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73164, "totalSubmissionRaw": 90603}, "2104": {"acRate": 61.134036571841236, "difficulty": "Medium", "likes": 2310, "dislikes": 112, "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": 94814, "totalSubmissionRaw": 155092}, "2105": {"acRate": 48.41197261425146, "difficulty": "Medium", "likes": 271, "dislikes": 159, "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": 19587, "totalSubmissionRaw": 40459}, "2106": {"acRate": 36.142070632469455, "difficulty": "Hard", "likes": 542, "dislikes": 18, "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": 10766, "totalSubmissionRaw": 29788}, "2107": {"acRate": 55.578335896121644, "difficulty": "Medium", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3253, "totalSubmissionRaw": 5853}, "2108": {"acRate": 83.88540572429591, "difficulty": "Easy", "likes": 1511, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2108", "paidOnly": false, "title": "Find First Palindromic String in the Array", "titleSlug": "find-first-palindromic-string-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278695, "totalSubmissionRaw": 332233}, "2109": {"acRate": 58.743092629015635, "difficulty": "Medium", "likes": 552, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43904, "totalSubmissionRaw": 74739}, "2110": {"acRate": 58.936128969728294, "difficulty": "Medium", "likes": 707, "dislikes": 30, "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": 36485, "totalSubmissionRaw": 61906}, "2111": {"acRate": 38.514664719483996, "difficulty": "Hard", "likes": 692, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12659, "totalSubmissionRaw": 32868}, "2112": {"acRate": 69.7164303586322, "difficulty": "Medium", "likes": 60, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2112", "paidOnly": true, "title": "The Airport With the Most Traffic", "titleSlug": "the-airport-with-the-most-traffic", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8359, "totalSubmissionRaw": 11990}, "2113": {"acRate": 73.59723289777095, "difficulty": "Medium", "likes": 59, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2113", "paidOnly": true, "title": "Elements in Array After Removing and Replacing Elements", "titleSlug": "elements-in-array-after-removing-and-replacing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1915, "totalSubmissionRaw": 2602}, "2114": {"acRate": 86.45310330495126, "difficulty": "Easy", "likes": 1727, "dislikes": 58, "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": 287039, "totalSubmissionRaw": 332017}, "2115": {"acRate": 49.81198971586498, "difficulty": "Medium", "likes": 1839, "dislikes": 89, "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": 90476, "totalSubmissionRaw": 181637}, "2116": {"acRate": 31.8275051278203, "difficulty": "Medium", "likes": 1136, "dislikes": 42, "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": 25448, "totalSubmissionRaw": 79956}, "2117": {"acRate": 26.08326253186066, "difficulty": "Hard", "likes": 87, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3377, "totalSubmissionRaw": 12947}, "2118": {"acRate": 55.34258647279137, "difficulty": "Hard", "likes": 23, "dislikes": 36, "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": 2512, "totalSubmissionRaw": 4539}, "2119": {"acRate": 79.78774191179171, "difficulty": "Easy", "likes": 668, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2119", "paidOnly": false, "title": "A Number After a Double Reversal", "titleSlug": "a-number-after-a-double-reversal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86908, "totalSubmissionRaw": 108924}, "2120": {"acRate": 82.56946854229507, "difficulty": "Medium", "likes": 531, "dislikes": 50, "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": 30933, "totalSubmissionRaw": 37463}, "2121": {"acRate": 44.158926028883315, "difficulty": "Medium", "likes": 885, "dislikes": 37, "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": 19536, "totalSubmissionRaw": 44241}, "2122": {"acRate": 39.08563831751542, "difficulty": "Hard", "likes": 368, "dislikes": 32, "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": 10584, "totalSubmissionRaw": 27079}, "2123": {"acRate": 41.43389199255121, "difficulty": "Hard", "likes": 50, "dislikes": 11, "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": 890, "totalSubmissionRaw": 2148}, "2124": {"acRate": 71.43135544460736, "difficulty": "Easy", "likes": 717, "dislikes": 18, "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": 76973, "totalSubmissionRaw": 107758}, "2125": {"acRate": 85.6720666869811, "difficulty": "Medium", "likes": 1837, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205242, "totalSubmissionRaw": 239567}, "2126": {"acRate": 51.51098575525586, "difficulty": "Medium", "likes": 539, "dislikes": 187, "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": 43466, "totalSubmissionRaw": 84382}, "2127": {"acRate": 37.07512386219611, "difficulty": "Hard", "likes": 1021, "dislikes": 32, "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": 12871, "totalSubmissionRaw": 34716}, "2128": {"acRate": 76.24486800155967, "difficulty": "Medium", "likes": 473, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33242, "totalSubmissionRaw": 43599}, "2129": {"acRate": 64.18598416102952, "difficulty": "Easy", "likes": 722, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62245, "totalSubmissionRaw": 96976}, "2130": {"acRate": 80.90109940818846, "difficulty": "Medium", "likes": 3447, "dislikes": 97, "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": 280505, "totalSubmissionRaw": 346726}, "2131": {"acRate": 48.0581363715056, "difficulty": "Medium", "likes": 2412, "dislikes": 58, "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": 116589, "totalSubmissionRaw": 242600}, "2132": {"acRate": 32.42796843457515, "difficulty": "Hard", "likes": 382, "dislikes": 42, "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": 7068, "totalSubmissionRaw": 21796}, "2133": {"acRate": 51.72301460277892, "difficulty": "Easy", "likes": 954, "dislikes": 51, "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": 73036, "totalSubmissionRaw": 141206}, "2134": {"acRate": 52.42341192371227, "difficulty": "Medium", "likes": 1090, "dislikes": 16, "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": 27924, "totalSubmissionRaw": 53269}, "2135": {"acRate": 42.946076504672185, "difficulty": "Medium", "likes": 676, "dislikes": 156, "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": 33872, "totalSubmissionRaw": 78871}, "2136": {"acRate": 71.77551513848964, "difficulty": "Hard", "likes": 1559, "dislikes": 80, "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": 53434, "totalSubmissionRaw": 74446}, "2137": {"acRate": 67.70862405805191, "difficulty": "Medium", "likes": 98, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2137", "paidOnly": true, "title": "Pour Water Between Buckets to Make Water Levels Equal", "titleSlug": "pour-water-between-buckets-to-make-water-levels-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2426, "totalSubmissionRaw": 3583}, "2138": {"acRate": 66.59803837465329, "difficulty": "Easy", "likes": 458, "dislikes": 21, "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": 46580, "totalSubmissionRaw": 69942}, "2139": {"acRate": 50.65838333588749, "difficulty": "Medium", "likes": 966, "dislikes": 24, "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": 42973, "totalSubmissionRaw": 84829}, "2140": {"acRate": 54.97855835677802, "difficulty": "Medium", "likes": 2309, "dislikes": 58, "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": 100641, "totalSubmissionRaw": 183055}, "2141": {"acRate": 49.99583368052662, "difficulty": "Hard", "likes": 1994, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2141", "paidOnly": false, "title": "Maximum Running Time of N Computers", "titleSlug": "maximum-running-time-of-n-computers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60000, "totalSubmissionRaw": 120010}, "2142": {"acRate": 48.109531910223346, "difficulty": "Medium", "likes": 105, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2142", "paidOnly": true, "title": "The Number of Passengers in Each Bus I", "titleSlug": "the-number-of-passengers-in-each-bus-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8767, "totalSubmissionRaw": 18223}, "2143": {"acRate": 50.721752115480335, "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": 1019, "totalSubmissionRaw": 2009}, "2144": {"acRate": 61.11131931691839, "difficulty": "Easy", "likes": 580, "dislikes": 18, "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": 48919, "totalSubmissionRaw": 80049}, "2145": {"acRate": 38.08044861425645, "difficulty": "Medium", "likes": 513, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2145", "paidOnly": false, "title": "Count the Hidden Sequences", "titleSlug": "count-the-hidden-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17656, "totalSubmissionRaw": 46365}, "2146": {"acRate": 42.857142857142854, "difficulty": "Medium", "likes": 495, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "2146", "paidOnly": false, "title": "K Highest Ranked Items Within a Price Range", "titleSlug": "k-highest-ranked-items-within-a-price-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15405, "totalSubmissionRaw": 35945}, "2147": {"acRate": 49.51404802782342, "difficulty": "Hard", "likes": 1044, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "2147", "paidOnly": false, "title": "Number of Ways to Divide a Long Corridor", "titleSlug": "number-of-ways-to-divide-a-long-corridor", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67197, "totalSubmissionRaw": 135713}, "2148": {"acRate": 59.3917951484717, "difficulty": "Easy", "likes": 643, "dislikes": 39, "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": 57242, "totalSubmissionRaw": 96381}, "2149": {"acRate": 84.00711596339664, "difficulty": "Medium", "likes": 3136, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "2149", "paidOnly": false, "title": "Rearrange Array Elements by Sign", "titleSlug": "rearrange-array-elements-by-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 344719, "totalSubmissionRaw": 410345}, "2150": {"acRate": 60.69449953299129, "difficulty": "Medium", "likes": 634, "dislikes": 60, "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": 47437, "totalSubmissionRaw": 78157}, "2151": {"acRate": 49.93901974235841, "difficulty": "Hard", "likes": 501, "dislikes": 78, "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": 13103, "totalSubmissionRaw": 26238}, "2152": {"acRate": 44.396843291995495, "difficulty": "Medium", "likes": 70, "dislikes": 13, "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": 1969, "totalSubmissionRaw": 4435}, "2153": {"acRate": 40.0, "difficulty": "Hard", "likes": 76, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2922, "totalSubmissionRaw": 7305}, "2154": {"acRate": 71.27780396035014, "difficulty": "Easy", "likes": 702, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92257, "totalSubmissionRaw": 129433}, "2155": {"acRate": 64.14036003130707, "difficulty": "Medium", "likes": 497, "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": 29502, "totalSubmissionRaw": 45996}, "2156": {"acRate": 23.44636801713368, "difficulty": "Hard", "likes": 419, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13137, "totalSubmissionRaw": 56030}, "2157": {"acRate": 26.07480292950187, "difficulty": "Hard", "likes": 463, "dislikes": 55, "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": 9328, "totalSubmissionRaw": 35774}, "2158": {"acRate": 55.21763497104427, "difficulty": "Hard", "likes": 418, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29558, "totalSubmissionRaw": 53530}, "2159": {"acRate": 60.0552268244576, "difficulty": "Medium", "likes": 71, "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": 7612, "totalSubmissionRaw": 12675}, "2160": {"acRate": 86.1136146571786, "difficulty": "Easy", "likes": 1390, "dislikes": 138, "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": 128032, "totalSubmissionRaw": 148678}, "2161": {"acRate": 84.85323949028881, "difficulty": "Medium", "likes": 1080, "dislikes": 84, "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": 75712, "totalSubmissionRaw": 89227}, "2162": {"acRate": 41.05079629436869, "difficulty": "Medium", "likes": 207, "dislikes": 619, "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": 15775, "totalSubmissionRaw": 38428}, "2163": {"acRate": 47.91616361616845, "difficulty": "Hard", "likes": 662, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2163", "paidOnly": false, "title": "Minimum Difference in Sums After Removal of Elements", "titleSlug": "minimum-difference-in-sums-after-removal-of-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9922, "totalSubmissionRaw": 20707}, "2164": {"acRate": 62.63631955263457, "difficulty": "Easy", "likes": 719, "dislikes": 61, "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": 60709, "totalSubmissionRaw": 96923}, "2165": {"acRate": 52.06277229483418, "difficulty": "Medium", "likes": 624, "dislikes": 22, "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": 35133, "totalSubmissionRaw": 67482}, "2166": {"acRate": 32.4286638395745, "difficulty": "Medium", "likes": 585, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2166", "paidOnly": false, "title": "Design Bitset", "titleSlug": "design-bitset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22559, "totalSubmissionRaw": 69565}, "2167": {"acRate": 41.26930371173124, "difficulty": "Hard", "likes": 656, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12186, "totalSubmissionRaw": 29528}, "2168": {"acRate": 59.68634686346863, "difficulty": "Medium", "likes": 72, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2588, "totalSubmissionRaw": 4336}, "2169": {"acRate": 74.40697473085972, "difficulty": "Easy", "likes": 597, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2169", "paidOnly": false, "title": "Count Operations to Obtain Zero", "titleSlug": "count-operations-to-obtain-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73055, "totalSubmissionRaw": 98183}, "2170": {"acRate": 33.30124396444097, "difficulty": "Medium", "likes": 573, "dislikes": 329, "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": 22139, "totalSubmissionRaw": 66481}, "2171": {"acRate": 42.71130607785261, "difficulty": "Medium", "likes": 857, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26191, "totalSubmissionRaw": 61321}, "2172": {"acRate": 48.88784574276016, "difficulty": "Hard", "likes": 506, "dislikes": 28, "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": 13539, "totalSubmissionRaw": 27694}, "2173": {"acRate": 52.3197715917202, "difficulty": "Hard", "likes": 97, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4398, "totalSubmissionRaw": 8406}, "2174": {"acRate": 67.63021543496046, "difficulty": "Medium", "likes": 91, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2174", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips II", "titleSlug": "remove-all-ones-with-row-and-column-flips-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4960, "totalSubmissionRaw": 7334}, "2175": {"acRate": 60.45915853778697, "difficulty": "Medium", "likes": 39, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2175", "paidOnly": true, "title": "The Change in Global Rankings", "titleSlug": "the-change-in-global-rankings", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6136, "totalSubmissionRaw": 10149}, "2176": {"acRate": 79.4712773288229, "difficulty": "Easy", "likes": 634, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2176", "paidOnly": false, "title": "Count Equal and Divisible Pairs in an Array", "titleSlug": "count-equal-and-divisible-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76116, "totalSubmissionRaw": 95778}, "2177": {"acRate": 64.43439040788884, "difficulty": "Medium", "likes": 660, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46001, "totalSubmissionRaw": 71392}, "2178": {"acRate": 59.20562087754517, "difficulty": "Medium", "likes": 777, "dislikes": 72, "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": 45419, "totalSubmissionRaw": 76714}, "2179": {"acRate": 40.93256301446904, "difficulty": "Hard", "likes": 606, "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": 8006, "totalSubmissionRaw": 19559}, "2180": {"acRate": 66.94200116086975, "difficulty": "Easy", "likes": 610, "dislikes": 29, "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": 59972, "totalSubmissionRaw": 89588}, "2181": {"acRate": 85.76862431529626, "difficulty": "Medium", "likes": 1713, "dislikes": 35, "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": 114773, "totalSubmissionRaw": 133817}, "2182": {"acRate": 54.00409140804311, "difficulty": "Medium", "likes": 649, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21647, "totalSubmissionRaw": 40084}, "2183": {"acRate": 29.58304554872951, "difficulty": "Hard", "likes": 831, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2183", "paidOnly": false, "title": "Count Array Pairs Divisible by K", "titleSlug": "count-array-pairs-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16276, "totalSubmissionRaw": 55018}, "2184": {"acRate": 49.274384070199126, "difficulty": "Medium", "likes": 165, "dislikes": 117, "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": 7300, "totalSubmissionRaw": 14815}, "2185": {"acRate": 78.0247507905811, "difficulty": "Easy", "likes": 683, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2185", "paidOnly": false, "title": "Counting Words With a Given Prefix", "titleSlug": "counting-words-with-a-given-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94004, "totalSubmissionRaw": 120480}, "2186": {"acRate": 72.57242535143824, "difficulty": "Medium", "likes": 568, "dislikes": 24, "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": 42436, "totalSubmissionRaw": 58474}, "2187": {"acRate": 38.83338361950738, "difficulty": "Medium", "likes": 2766, "dislikes": 177, "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": 113262, "totalSubmissionRaw": 291662}, "2188": {"acRate": 41.57575757575758, "difficulty": "Hard", "likes": 558, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2188", "paidOnly": false, "title": "Minimum Time to Finish the Race", "titleSlug": "minimum-time-to-finish-the-race", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11662, "totalSubmissionRaw": 28050}, "2189": {"acRate": 63.46037507562009, "difficulty": "Medium", "likes": 66, "dislikes": 16, "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": 2098, "totalSubmissionRaw": 3306}, "2190": {"acRate": 58.959316625673075, "difficulty": "Easy", "likes": 364, "dislikes": 227, "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": 35477, "totalSubmissionRaw": 60172}, "2191": {"acRate": 46.690560965832724, "difficulty": "Medium", "likes": 369, "dislikes": 48, "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": 19801, "totalSubmissionRaw": 42409}, "2192": {"acRate": 52.17213058747967, "difficulty": "Medium", "likes": 1070, "dislikes": 20, "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": 38178, "totalSubmissionRaw": 73177}, "2193": {"acRate": 50.924216473519145, "difficulty": "Hard", "likes": 949, "dislikes": 71, "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": 22894, "totalSubmissionRaw": 44957}, "2194": {"acRate": 83.94650450035736, "difficulty": "Easy", "likes": 603, "dislikes": 94, "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": 69297, "totalSubmissionRaw": 82549}, "2195": {"acRate": 25.350033906418286, "difficulty": "Medium", "likes": 740, "dislikes": 302, "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": 31775, "totalSubmissionRaw": 125345}, "2196": {"acRate": 72.5766858069887, "difficulty": "Medium", "likes": 929, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34000, "totalSubmissionRaw": 46847}, "2197": {"acRate": 38.828213564851936, "difficulty": "Hard", "likes": 422, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2197", "paidOnly": false, "title": "Replace Non-Coprime Numbers in Array", "titleSlug": "replace-non-coprime-numbers-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14043, "totalSubmissionRaw": 36167}, "2198": {"acRate": 55.07319535588087, "difficulty": "Medium", "likes": 27, "dislikes": 11, "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": 1091, "totalSubmissionRaw": 1981}, "2199": {"acRate": 48.51821862348178, "difficulty": "Hard", "likes": 44, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2199", "paidOnly": true, "title": "Finding the Topic of Each Post", "titleSlug": "finding-the-topic-of-each-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2995, "totalSubmissionRaw": 6172}, "2200": {"acRate": 65.69150721718697, "difficulty": "Easy", "likes": 407, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39139, "totalSubmissionRaw": 59580}, "2201": {"acRate": 56.24583466141231, "difficulty": "Medium", "likes": 211, "dislikes": 197, "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": 19411, "totalSubmissionRaw": 34511}, "2202": {"acRate": 22.952380952380953, "difficulty": "Medium", "likes": 605, "dislikes": 317, "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": 28197, "totalSubmissionRaw": 122849}, "2203": {"acRate": 36.9140625, "difficulty": "Hard", "likes": 665, "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": 11718, "totalSubmissionRaw": 31744}, "2204": {"acRate": 69.35448336638026, "difficulty": "Hard", "likes": 109, "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": 3148, "totalSubmissionRaw": 4539}, "2205": {"acRate": 49.793149098130066, "difficulty": "Easy", "likes": 27, "dislikes": 75, "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": 6018, "totalSubmissionRaw": 12086}, "2206": {"acRate": 73.42685296222959, "difficulty": "Easy", "likes": 707, "dislikes": 33, "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": 78985, "totalSubmissionRaw": 107570}, "2207": {"acRate": 34.58540555203906, "difficulty": "Medium", "likes": 492, "dislikes": 32, "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": 19122, "totalSubmissionRaw": 55293}, "2208": {"acRate": 46.52817879606074, "difficulty": "Medium", "likes": 586, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29812, "totalSubmissionRaw": 64073}, "2209": {"acRate": 36.33204280096333, "difficulty": "Hard", "likes": 498, "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": 11918, "totalSubmissionRaw": 32803}, "2210": {"acRate": 60.511792542596524, "difficulty": "Easy", "likes": 672, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2210", "paidOnly": false, "title": "Count Hills and Valleys in an Array", "titleSlug": "count-hills-and-valleys-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47696, "totalSubmissionRaw": 78821}, "2211": {"acRate": 43.75178361924089, "difficulty": "Medium", "likes": 658, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27596, "totalSubmissionRaw": 63074}, "2212": {"acRate": 49.92135273299253, "difficulty": "Medium", "likes": 489, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15234, "totalSubmissionRaw": 30516}, "2213": {"acRate": 32.105844963382616, "difficulty": "Hard", "likes": 289, "dislikes": 83, "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": 4647, "totalSubmissionRaw": 14474}, "2214": {"acRate": 57.647146810261006, "difficulty": "Medium", "likes": 312, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30832, "totalSubmissionRaw": 53484}, "2215": {"acRate": 78.79547887367595, "difficulty": "Easy", "likes": 2285, "dislikes": 95, "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": 330510, "totalSubmissionRaw": 419453}, "2216": {"acRate": 48.18960628040954, "difficulty": "Medium", "likes": 782, "dislikes": 93, "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": 32288, "totalSubmissionRaw": 67002}, "2217": {"acRate": 36.85291839277895, "difficulty": "Medium", "likes": 609, "dislikes": 285, "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": 21883, "totalSubmissionRaw": 59381}, "2218": {"acRate": 60.56854400412682, "difficulty": "Hard", "likes": 2279, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2218", "paidOnly": false, "title": "Maximum Value of K Coins From Piles", "titleSlug": "maximum-value-of-k-coins-from-piles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65752, "totalSubmissionRaw": 108558}, "2219": {"acRate": 62.1207477781183, "difficulty": "Medium", "likes": 64, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4054, "totalSubmissionRaw": 6526}, "2220": {"acRate": 84.36026596816441, "difficulty": "Easy", "likes": 889, "dislikes": 19, "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": 83736, "totalSubmissionRaw": 99260}, "2221": {"acRate": 78.7212978957683, "difficulty": "Medium", "likes": 1081, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2221", "paidOnly": false, "title": "Find Triangular Sum of an Array", "titleSlug": "find-triangular-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77927, "totalSubmissionRaw": 98991}, "2222": {"acRate": 50.59175796106034, "difficulty": "Medium", "likes": 964, "dislikes": 49, "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": 35651, "totalSubmissionRaw": 70468}, "2223": {"acRate": 39.919634884413135, "difficulty": "Hard", "likes": 259, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8047, "totalSubmissionRaw": 20158}, "2224": {"acRate": 65.11470133476381, "difficulty": "Easy", "likes": 443, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41271, "totalSubmissionRaw": 63382}, "2225": {"acRate": 73.45361135930067, "difficulty": "Medium", "likes": 2129, "dislikes": 153, "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": 243343, "totalSubmissionRaw": 331288}, "2226": {"acRate": 37.9475095928175, "difficulty": "Medium", "likes": 1098, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2226", "paidOnly": false, "title": "Maximum Candies Allocated to K Children", "titleSlug": "maximum-candies-allocated-to-k-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40745, "totalSubmissionRaw": 107369}, "2227": {"acRate": 40.29240886164847, "difficulty": "Hard", "likes": 325, "dislikes": 76, "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": 12622, "totalSubmissionRaw": 31326}, "2228": {"acRate": 44.66605881012081, "difficulty": "Medium", "likes": 62, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2228", "paidOnly": true, "title": "Users With Two Purchases Within Seven Days", "titleSlug": "users-with-two-purchases-within-seven-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7838, "totalSubmissionRaw": 17548}, "2229": {"acRate": 61.39186295503212, "difficulty": "Easy", "likes": 80, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5734, "totalSubmissionRaw": 9340}, "2230": {"acRate": 49.72280634677882, "difficulty": "Easy", "likes": 20, "dislikes": 42, "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": 5202, "totalSubmissionRaw": 10462}, "2231": {"acRate": 61.54894227321621, "difficulty": "Easy", "likes": 609, "dislikes": 296, "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": 42915, "totalSubmissionRaw": 69725}, "2232": {"acRate": 67.28212947923228, "difficulty": "Medium", "likes": 202, "dislikes": 332, "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": 20297, "totalSubmissionRaw": 30167}, "2233": {"acRate": 41.3622779345841, "difficulty": "Medium", "likes": 695, "dislikes": 44, "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": 29895, "totalSubmissionRaw": 72276}, "2234": {"acRate": 29.315439546909627, "difficulty": "Hard", "likes": 431, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7143, "totalSubmissionRaw": 24366}, "2235": {"acRate": 87.74681304540154, "difficulty": "Easy", "likes": 1584, "dislikes": 3101, "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": 501859, "totalSubmissionRaw": 571940}, "2236": {"acRate": 84.31673728813558, "difficulty": "Easy", "likes": 1232, "dislikes": 1506, "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": 222866, "totalSubmissionRaw": 264320}, "2237": {"acRate": 63.76291921535541, "difficulty": "Medium", "likes": 76, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3023, "totalSubmissionRaw": 4741}, "2238": {"acRate": 71.00215214746889, "difficulty": "Medium", "likes": 66, "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": 7588, "totalSubmissionRaw": 10687}, "2239": {"acRate": 44.87408119591849, "difficulty": "Easy", "likes": 552, "dislikes": 35, "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": 57875, "totalSubmissionRaw": 128972}, "2240": {"acRate": 56.98653911276668, "difficulty": "Medium", "likes": 439, "dislikes": 33, "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": 26925, "totalSubmissionRaw": 47248}, "2241": {"acRate": 41.42640064728751, "difficulty": "Medium", "likes": 256, "dislikes": 338, "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": 20992, "totalSubmissionRaw": 50673}, "2242": {"acRate": 38.31305758313058, "difficulty": "Hard", "likes": 516, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11810, "totalSubmissionRaw": 30825}, "2243": {"acRate": 65.94527616525784, "difficulty": "Easy", "likes": 541, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38851, "totalSubmissionRaw": 58914}, "2244": {"acRate": 62.9108099168017, "difficulty": "Medium", "likes": 2764, "dislikes": 80, "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": 150248, "totalSubmissionRaw": 238827}, "2245": {"acRate": 35.97044022305844, "difficulty": "Medium", "likes": 184, "dislikes": 397, "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": 7934, "totalSubmissionRaw": 22057}, "2246": {"acRate": 54.58823706581731, "difficulty": "Hard", "likes": 2341, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2246", "paidOnly": false, "title": "Longest Path With Different Adjacent Characters", "titleSlug": "longest-path-with-different-adjacent-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72497, "totalSubmissionRaw": 132807}, "2247": {"acRate": 49.51627088830255, "difficulty": "Hard", "likes": 57, "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": 1689, "totalSubmissionRaw": 3411}, "2248": {"acRate": 68.0050318830521, "difficulty": "Easy", "likes": 704, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78375, "totalSubmissionRaw": 115251}, "2249": {"acRate": 52.625214370520204, "difficulty": "Medium", "likes": 229, "dislikes": 219, "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": 23935, "totalSubmissionRaw": 45482}, "2250": {"acRate": 34.71904481774408, "difficulty": "Medium", "likes": 495, "dislikes": 134, "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": 15934, "totalSubmissionRaw": 45896}, "2251": {"acRate": 56.68566355461366, "difficulty": "Hard", "likes": 1626, "dislikes": 41, "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": 79174, "totalSubmissionRaw": 139672}, "2252": {"acRate": 55.61674008810573, "difficulty": "Hard", "likes": 29, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1515, "totalSubmissionRaw": 2724}, "2253": {"acRate": 67.87603930461074, "difficulty": "Hard", "likes": 16, "dislikes": 12, "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": 898, "totalSubmissionRaw": 1323}, "2254": {"acRate": 64.36781609195403, "difficulty": "Hard", "likes": 80, "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": 3248, "totalSubmissionRaw": 5046}, "2255": {"acRate": 72.57002139791759, "difficulty": "Easy", "likes": 531, "dislikes": 20, "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": 60707, "totalSubmissionRaw": 83653}, "2256": {"acRate": 43.11287482481224, "difficulty": "Medium", "likes": 1495, "dislikes": 175, "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": 83980, "totalSubmissionRaw": 194791}, "2257": {"acRate": 52.448040615579885, "difficulty": "Medium", "likes": 413, "dislikes": 36, "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": 16529, "totalSubmissionRaw": 31515}, "2258": {"acRate": 35.19532915668974, "difficulty": "Hard", "likes": 710, "dislikes": 31, "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": 10730, "totalSubmissionRaw": 30487}, "2259": {"acRate": 45.28667697746354, "difficulty": "Easy", "likes": 810, "dislikes": 47, "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": 81987, "totalSubmissionRaw": 181040}, "2260": {"acRate": 51.27488597697821, "difficulty": "Medium", "likes": 936, "dislikes": 33, "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": 70826, "totalSubmissionRaw": 138130}, "2261": {"acRate": 51.196514604633414, "difficulty": "Medium", "likes": 647, "dislikes": 151, "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": 32198, "totalSubmissionRaw": 62891}, "2262": {"acRate": 55.53462888451332, "difficulty": "Hard", "likes": 1096, "dislikes": 30, "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": 32435, "totalSubmissionRaw": 58405}, "2263": {"acRate": 65.35198349002522, "difficulty": "Hard", "likes": 78, "dislikes": 8, "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": 2849, "totalSubmissionRaw": 4360}, "2264": {"acRate": 68.97232351521467, "difficulty": "Easy", "likes": 983, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2264", "paidOnly": false, "title": "Largest 3-Same-Digit Number in String", "titleSlug": "largest-3-same-digit-number-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144317, "totalSubmissionRaw": 209239}, "2265": {"acRate": 86.28480594402473, "difficulty": "Medium", "likes": 2158, "dislikes": 51, "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": 144930, "totalSubmissionRaw": 167967}, "2266": {"acRate": 47.71369403251529, "difficulty": "Medium", "likes": 859, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20045, "totalSubmissionRaw": 42011}, "2267": {"acRate": 38.61106202509277, "difficulty": "Hard", "likes": 505, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15295, "totalSubmissionRaw": 39613}, "2268": {"acRate": 70.95166499610201, "difficulty": "Medium", "likes": 228, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25483, "totalSubmissionRaw": 35916}, "2269": {"acRate": 59.81564911190513, "difficulty": "Easy", "likes": 639, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2269", "paidOnly": false, "title": "Find the K-Beauty of a Number", "titleSlug": "find-the-k-beauty-of-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57755, "totalSubmissionRaw": 96555}, "2270": {"acRate": 47.61485360628422, "difficulty": "Medium", "likes": 553, "dislikes": 51, "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": 40006, "totalSubmissionRaw": 84020}, "2271": {"acRate": 33.67960182565416, "difficulty": "Medium", "likes": 770, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16308, "totalSubmissionRaw": 48421}, "2272": {"acRate": 46.25606412149336, "difficulty": "Hard", "likes": 1841, "dislikes": 204, "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": 67983, "totalSubmissionRaw": 146971}, "2273": {"acRate": 58.11823723277044, "difficulty": "Easy", "likes": 660, "dislikes": 181, "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": 59781, "totalSubmissionRaw": 102861}, "2274": {"acRate": 51.76756553940521, "difficulty": "Medium", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31733, "totalSubmissionRaw": 61299}, "2275": {"acRate": 72.69015081395982, "difficulty": "Medium", "likes": 555, "dislikes": 16, "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": 26702, "totalSubmissionRaw": 36734}, "2276": {"acRate": 35.2024118848801, "difficulty": "Hard", "likes": 565, "dislikes": 57, "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": 17748, "totalSubmissionRaw": 50417}, "2277": {"acRate": 62.411160831797844, "difficulty": "Hard", "likes": 133, "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": 4742, "totalSubmissionRaw": 7598}, "2278": {"acRate": 74.00183710961421, "difficulty": "Easy", "likes": 509, "dislikes": 58, "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": 72507, "totalSubmissionRaw": 97980}, "2279": {"acRate": 67.45919040651806, "difficulty": "Medium", "likes": 1657, "dislikes": 69, "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": 94057, "totalSubmissionRaw": 139428}, "2280": {"acRate": 25.183707848851284, "difficulty": "Medium", "likes": 336, "dislikes": 519, "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": 26012, "totalSubmissionRaw": 103289}, "2281": {"acRate": 27.842926147936915, "difficulty": "Hard", "likes": 1169, "dislikes": 99, "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": 19136, "totalSubmissionRaw": 68731}, "2282": {"acRate": 48.27491029533535, "difficulty": "Medium", "likes": 60, "dislikes": 26, "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": 1749, "totalSubmissionRaw": 3623}, "2283": {"acRate": 72.13628628820737, "difficulty": "Easy", "likes": 590, "dislikes": 75, "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": 56381, "totalSubmissionRaw": 78159}, "2284": {"acRate": 56.73725062980868, "difficulty": "Medium", "likes": 423, "dislikes": 37, "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": 33332, "totalSubmissionRaw": 58748}, "2285": {"acRate": 61.010167749513634, "difficulty": "Medium", "likes": 723, "dislikes": 30, "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": 33242, "totalSubmissionRaw": 54486}, "2286": {"acRate": 17.27322676015803, "difficulty": "Hard", "likes": 325, "dislikes": 55, "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": 6602, "totalSubmissionRaw": 38221}, "2287": {"acRate": 59.024768708279666, "difficulty": "Easy", "likes": 464, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40321, "totalSubmissionRaw": 68312}, "2288": {"acRate": 30.192036973093572, "difficulty": "Medium", "likes": 192, "dislikes": 1093, "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": 22733, "totalSubmissionRaw": 75295}, "2289": {"acRate": 21.785290505235547, "difficulty": "Medium", "likes": 1312, "dislikes": 132, "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": 20930, "totalSubmissionRaw": 96074}, "2290": {"acRate": 53.61762460464609, "difficulty": "Hard", "likes": 930, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2290", "paidOnly": false, "title": "Minimum Obstacle Removal to Reach Corner", "titleSlug": "minimum-obstacle-removal-to-reach-corner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24581, "totalSubmissionRaw": 45845}, "2291": {"acRate": 45.30199593517119, "difficulty": "Medium", "likes": 154, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8693, "totalSubmissionRaw": 19189}, "2292": {"acRate": 39.122582148683286, "difficulty": "Medium", "likes": 60, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "2292", "paidOnly": true, "title": "Products With Three or More Orders in Two Consecutive Years", "titleSlug": "products-with-three-or-more-orders-in-two-consecutive-years", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6715, "totalSubmissionRaw": 17164}, "2293": {"acRate": 63.057856716813575, "difficulty": "Easy", "likes": 527, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47574, "totalSubmissionRaw": 75445}, "2294": {"acRate": 73.5348461745448, "difficulty": "Medium", "likes": 745, "dislikes": 26, "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": 40992, "totalSubmissionRaw": 55745}, "2295": {"acRate": 57.91042331941374, "difficulty": "Medium", "likes": 623, "dislikes": 34, "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": 35363, "totalSubmissionRaw": 61065}, "2296": {"acRate": 44.57497236430405, "difficulty": "Hard", "likes": 556, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23791, "totalSubmissionRaw": 53373}, "2297": {"acRate": 45.62695450418642, "difficulty": "Medium", "likes": 140, "dislikes": 37, "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": 4523, "totalSubmissionRaw": 9913}, "2298": {"acRate": 81.12927191679049, "difficulty": "Medium", "likes": 47, "dislikes": 9, "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": 6006, "totalSubmissionRaw": 7403}, "2299": {"acRate": 54.77083998722453, "difficulty": "Easy", "likes": 342, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41157, "totalSubmissionRaw": 75144}, "2300": {"acRate": 42.94477647072332, "difficulty": "Medium", "likes": 2523, "dislikes": 76, "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": 149597, "totalSubmissionRaw": 348356}, "2301": {"acRate": 40.80341334571735, "difficulty": "Hard", "likes": 374, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14058, "totalSubmissionRaw": 34453}, "2302": {"acRate": 54.47905769305281, "difficulty": "Hard", "likes": 1016, "dislikes": 25, "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": 28121, "totalSubmissionRaw": 51618}, "2303": {"acRate": 65.4621192397813, "difficulty": "Easy", "likes": 258, "dislikes": 276, "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": 37716, "totalSubmissionRaw": 57615}, "2304": {"acRate": 66.58524670249145, "difficulty": "Medium", "likes": 870, "dislikes": 151, "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": 29986, "totalSubmissionRaw": 45034}, "2305": {"acRate": 69.23866728271472, "difficulty": "Medium", "likes": 2538, "dislikes": 114, "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": 94409, "totalSubmissionRaw": 136353}, "2306": {"acRate": 46.45606133057736, "difficulty": "Hard", "likes": 1941, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60234, "totalSubmissionRaw": 129658}, "2307": {"acRate": 42.94973354457727, "difficulty": "Hard", "likes": 55, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2982, "totalSubmissionRaw": 6943}, "2308": {"acRate": 68.63173216885006, "difficulty": "Medium", "likes": 74, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5658, "totalSubmissionRaw": 8244}, "2309": {"acRate": 69.75596886954227, "difficulty": "Easy", "likes": 476, "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": 52882, "totalSubmissionRaw": 75810}, "2310": {"acRate": 26.666530093825543, "difficulty": "Medium", "likes": 400, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26034, "totalSubmissionRaw": 97628}, "2311": {"acRate": 37.822319838126695, "difficulty": "Medium", "likes": 680, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2311", "paidOnly": false, "title": "Longest Binary Subsequence Less Than or Equal to K", "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21870, "totalSubmissionRaw": 57823}, "2312": {"acRate": 49.68812973802898, "difficulty": "Hard", "likes": 539, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10356, "totalSubmissionRaw": 20842}, "2313": {"acRate": 59.28795425198303, "difficulty": "Hard", "likes": 95, "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": 3214, "totalSubmissionRaw": 5421}, "2314": {"acRate": 71.33858267716535, "difficulty": "Medium", "likes": 51, "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": 5436, "totalSubmissionRaw": 7620}, "2315": {"acRate": 82.21354564805776, "difficulty": "Easy", "likes": 618, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69907, "totalSubmissionRaw": 85031}, "2316": {"acRate": 49.33759707629054, "difficulty": "Medium", "likes": 2007, "dislikes": 48, "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": 87480, "totalSubmissionRaw": 177309}, "2317": {"acRate": 79.40882248539805, "difficulty": "Medium", "likes": 603, "dislikes": 163, "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": 24608, "totalSubmissionRaw": 30989}, "2318": {"acRate": 56.958845537145905, "difficulty": "Hard", "likes": 434, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2318", "paidOnly": false, "title": "Number of Distinct Roll Sequences", "titleSlug": "number-of-distinct-roll-sequences", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10657, "totalSubmissionRaw": 18710}, "2319": {"acRate": 65.20290237798821, "difficulty": "Easy", "likes": 485, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2319", "paidOnly": false, "title": "Check if Matrix Is X-Matrix", "titleSlug": "check-if-matrix-is-x-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51850, "totalSubmissionRaw": 79521}, "2320": {"acRate": 41.773978341142524, "difficulty": "Medium", "likes": 566, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2320", "paidOnly": false, "title": "Count Number of Ways to Place Houses", "titleSlug": "count-number-of-ways-to-place-houses", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26925, "totalSubmissionRaw": 64454}, "2321": {"acRate": 56.62949945461156, "difficulty": "Hard", "likes": 774, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2321", "paidOnly": false, "title": "Maximum Score Of Spliced Array", "titleSlug": "maximum-score-of-spliced-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18690, "totalSubmissionRaw": 33004}, "2322": {"acRate": 52.201029806367394, "difficulty": "Hard", "likes": 447, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7198, "totalSubmissionRaw": 13789}, "2323": {"acRate": 66.19794483504597, "difficulty": "Medium", "likes": 59, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7344, "totalSubmissionRaw": 11094}, "2324": {"acRate": 73.76501305483029, "difficulty": "Medium", "likes": 47, "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": 7063, "totalSubmissionRaw": 9575}, "2325": {"acRate": 84.13104727872457, "difficulty": "Easy", "likes": 969, "dislikes": 93, "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": 97942, "totalSubmissionRaw": 116416}, "2326": {"acRate": 75.12143767430692, "difficulty": "Medium", "likes": 735, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2326", "paidOnly": false, "title": "Spiral Matrix IV", "titleSlug": "spiral-matrix-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40673, "totalSubmissionRaw": 54142}, "2327": {"acRate": 45.59972024711505, "difficulty": "Medium", "likes": 836, "dislikes": 115, "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": 23472, "totalSubmissionRaw": 51474}, "2328": {"acRate": 58.446081248149895, "difficulty": "Hard", "likes": 1945, "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": 67130, "totalSubmissionRaw": 114858}, "2329": {"acRate": 69.45744151319064, "difficulty": "Easy", "likes": 32, "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": 6977, "totalSubmissionRaw": 10045}, "2330": {"acRate": 75.86113554848751, "difficulty": "Medium", "likes": 96, "dislikes": 30, "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": 11210, "totalSubmissionRaw": 14777}, "2331": {"acRate": 82.97988681205516, "difficulty": "Easy", "likes": 1399, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2331", "paidOnly": false, "title": "Evaluate Boolean Binary Tree", "titleSlug": "evaluate-boolean-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 182105, "totalSubmissionRaw": 219457}, "2332": {"acRate": 26.91213890136207, "difficulty": "Medium", "likes": 445, "dislikes": 732, "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": 23374, "totalSubmissionRaw": 86853}, "2333": {"acRate": 25.391860930283304, "difficulty": "Medium", "likes": 620, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13964, "totalSubmissionRaw": 54994}, "2334": {"acRate": 42.82692985548115, "difficulty": "Hard", "likes": 538, "dislikes": 7, "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": 8505, "totalSubmissionRaw": 19859}, "2335": {"acRate": 57.62355802896841, "difficulty": "Easy", "likes": 682, "dislikes": 77, "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": 46905, "totalSubmissionRaw": 81399}, "2336": {"acRate": 71.707191789797, "difficulty": "Medium", "likes": 1630, "dislikes": 189, "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": 136805, "totalSubmissionRaw": 190784}, "2337": {"acRate": 47.55955073119252, "difficulty": "Medium", "likes": 650, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25237, "totalSubmissionRaw": 53064}, "2338": {"acRate": 26.806925268463733, "difficulty": "Hard", "likes": 478, "dislikes": 27, "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": 6116, "totalSubmissionRaw": 22815}, "2339": {"acRate": 87.56874427131073, "difficulty": "Easy", "likes": 42, "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": 7643, "totalSubmissionRaw": 8728}, "2340": {"acRate": 72.40818979525511, "difficulty": "Medium", "likes": 165, "dislikes": 24, "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": 24507, "totalSubmissionRaw": 33846}, "2341": {"acRate": 75.24117902326668, "difficulty": "Easy", "likes": 668, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2341", "paidOnly": false, "title": "Maximum Number of Pairs in Array", "titleSlug": "maximum-number-of-pairs-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67618, "totalSubmissionRaw": 89869}, "2342": {"acRate": 54.86417568086816, "difficulty": "Medium", "likes": 690, "dislikes": 19, "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": 47117, "totalSubmissionRaw": 85880}, "2343": {"acRate": 43.835204641445344, "difficulty": "Medium", "likes": 308, "dislikes": 426, "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": 29164, "totalSubmissionRaw": 66531}, "2344": {"acRate": 55.97806141173592, "difficulty": "Hard", "likes": 540, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27455, "totalSubmissionRaw": 49046}, "2345": {"acRate": 37.815875998121186, "difficulty": "Medium", "likes": 153, "dislikes": 69, "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": 8051, "totalSubmissionRaw": 21290}, "2346": {"acRate": 33.52639296187683, "difficulty": "Medium", "likes": 25, "dislikes": 71, "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": 4573, "totalSubmissionRaw": 13640}, "2347": {"acRate": 60.482046090633, "difficulty": "Easy", "likes": 366, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40627, "totalSubmissionRaw": 67172}, "2348": {"acRate": 66.70699133376513, "difficulty": "Medium", "likes": 2250, "dislikes": 80, "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": 124620, "totalSubmissionRaw": 186817}, "2349": {"acRate": 44.74261107848894, "difficulty": "Medium", "likes": 393, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22859, "totalSubmissionRaw": 51090}, "2350": {"acRate": 68.37463250734986, "difficulty": "Hard", "likes": 633, "dislikes": 49, "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": 14652, "totalSubmissionRaw": 21429}, "2351": {"acRate": 73.53521846359571, "difficulty": "Easy", "likes": 1017, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116578, "totalSubmissionRaw": 158534}, "2352": {"acRate": 70.44732118684007, "difficulty": "Medium", "likes": 2156, "dislikes": 146, "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": 210765, "totalSubmissionRaw": 299181}, "2353": {"acRate": 45.244428039473256, "difficulty": "Medium", "likes": 1477, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2353", "paidOnly": false, "title": "Design a Food Rating System", "titleSlug": "design-a-food-rating-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83352, "totalSubmissionRaw": 184226}, "2354": {"acRate": 47.115663349115856, "difficulty": "Hard", "likes": 584, "dislikes": 21, "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": 14628, "totalSubmissionRaw": 31047}, "2355": {"acRate": 40.593277690051885, "difficulty": "Hard", "likes": 274, "dislikes": 32, "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": 10795, "totalSubmissionRaw": 26596}, "2356": {"acRate": 87.90874186683558, "difficulty": "Easy", "likes": 403, "dislikes": 32, "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": 158211, "totalSubmissionRaw": 179972}, "2357": {"acRate": 72.38612288135593, "difficulty": "Easy", "likes": 1154, "dislikes": 53, "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": 109332, "totalSubmissionRaw": 151039}, "2358": {"acRate": 67.88670864002643, "difficulty": "Medium", "likes": 662, "dislikes": 112, "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": 36984, "totalSubmissionRaw": 54479}, "2359": {"acRate": 45.495881031346954, "difficulty": "Medium", "likes": 1663, "dislikes": 398, "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": 76545, "totalSubmissionRaw": 168246}, "2360": {"acRate": 49.84909896284944, "difficulty": "Hard", "likes": 2310, "dislikes": 45, "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": 74162, "totalSubmissionRaw": 148773}, "2361": {"acRate": 78.81552497293954, "difficulty": "Hard", "likes": 181, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10194, "totalSubmissionRaw": 12934}, "2362": {"acRate": 73.54211663066955, "difficulty": "Hard", "likes": 31, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3405, "totalSubmissionRaw": 4630}, "2363": {"acRate": 75.5866589654385, "difficulty": "Easy", "likes": 551, "dislikes": 24, "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": 56272, "totalSubmissionRaw": 74446}, "2364": {"acRate": 41.50963511820678, "difficulty": "Medium", "likes": 968, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2364", "paidOnly": false, "title": "Count Number of Bad Pairs", "titleSlug": "count-number-of-bad-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31148, "totalSubmissionRaw": 75038}, "2365": {"acRate": 52.16412611605457, "difficulty": "Medium", "likes": 534, "dislikes": 54, "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": 34528, "totalSubmissionRaw": 66192}, "2366": {"acRate": 53.65925731358965, "difficulty": "Hard", "likes": 1976, "dislikes": 64, "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": 65372, "totalSubmissionRaw": 121828}, "2367": {"acRate": 84.01744221753638, "difficulty": "Easy", "likes": 1236, "dislikes": 76, "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": 123120, "totalSubmissionRaw": 146541}, "2368": {"acRate": 58.69493392070485, "difficulty": "Medium", "likes": 686, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53294, "totalSubmissionRaw": 90799}, "2369": {"acRate": 51.81058993937877, "difficulty": "Medium", "likes": 1979, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86919, "totalSubmissionRaw": 167763}, "2370": {"acRate": 47.55087588362261, "difficulty": "Medium", "likes": 1435, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112134, "totalSubmissionRaw": 235819}, "2371": {"acRate": 65.70450097847358, "difficulty": "Hard", "likes": 93, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2686, "totalSubmissionRaw": 4088}, "2372": {"acRate": 82.7498001598721, "difficulty": "Medium", "likes": 36, "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": 5176, "totalSubmissionRaw": 6255}, "2373": {"acRate": 88.17842585682301, "difficulty": "Easy", "likes": 1162, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2373", "paidOnly": false, "title": "Largest Local Values in a Matrix", "titleSlug": "largest-local-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153597, "totalSubmissionRaw": 174187}, "2374": {"acRate": 47.43475767135073, "difficulty": "Medium", "likes": 433, "dislikes": 39, "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": 33081, "totalSubmissionRaw": 69740}, "2375": {"acRate": 75.85611242092486, "difficulty": "Medium", "likes": 928, "dislikes": 43, "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": 32496, "totalSubmissionRaw": 42839}, "2376": {"acRate": 38.413813478646226, "difficulty": "Hard", "likes": 565, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2376", "paidOnly": false, "title": "Count Special Integers", "titleSlug": "count-special-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11702, "totalSubmissionRaw": 30463}, "2377": {"acRate": 78.61939296266452, "difficulty": "Easy", "likes": 37, "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": 5854, "totalSubmissionRaw": 7446}, "2378": {"acRate": 58.175704077343426, "difficulty": "Medium", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1384, "totalSubmissionRaw": 2379}, "2379": {"acRate": 58.755370102410524, "difficulty": "Easy", "likes": 723, "dislikes": 19, "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": 52381, "totalSubmissionRaw": 89151}, "2380": {"acRate": 49.85059930053309, "difficulty": "Medium", "likes": 455, "dislikes": 108, "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": 29363, "totalSubmissionRaw": 58902}, "2381": {"acRate": 37.1907675488865, "difficulty": "Medium", "likes": 749, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21092, "totalSubmissionRaw": 56713}, "2382": {"acRate": 48.82784087730096, "difficulty": "Hard", "likes": 446, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2382", "paidOnly": false, "title": "Maximum Segment Sum After Removals", "titleSlug": "maximum-segment-sum-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8727, "totalSubmissionRaw": 17873}, "2383": {"acRate": 41.07142857142857, "difficulty": "Easy", "likes": 336, "dislikes": 274, "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": 31671, "totalSubmissionRaw": 77112}, "2384": {"acRate": 34.88604822416495, "difficulty": "Medium", "likes": 592, "dislikes": 226, "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": 36951, "totalSubmissionRaw": 105921}, "2385": {"acRate": 62.77123010589945, "difficulty": "Medium", "likes": 2641, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134374, "totalSubmissionRaw": 214069}, "2386": {"acRate": 38.7409200968523, "difficulty": "Hard", "likes": 562, "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": 8800, "totalSubmissionRaw": 22715}, "2387": {"acRate": 70.98835882218671, "difficulty": "Medium", "likes": 73, "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": 3110, "totalSubmissionRaw": 4381}, "2388": {"acRate": 50.27791203479942, "difficulty": "Medium", "likes": 79, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4161, "totalSubmissionRaw": 8276}, "2389": {"acRate": 71.6883048689237, "difficulty": "Easy", "likes": 1868, "dislikes": 167, "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": 109220, "totalSubmissionRaw": 152354}, "2390": {"acRate": 75.22489271460208, "difficulty": "Medium", "likes": 2837, "dislikes": 201, "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": 300625, "totalSubmissionRaw": 399635}, "2391": {"acRate": 85.3168480052753, "difficulty": "Medium", "likes": 1497, "dislikes": 233, "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": 129383, "totalSubmissionRaw": 151650}, "2392": {"acRate": 61.31467815552617, "difficulty": "Hard", "likes": 756, "dislikes": 10, "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": 14374, "totalSubmissionRaw": 23443}, "2393": {"acRate": 75.02327746741155, "difficulty": "Medium", "likes": 130, "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": 6446, "totalSubmissionRaw": 8592}, "2394": {"acRate": 40.34096444227959, "difficulty": "Medium", "likes": 27, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2394", "paidOnly": true, "title": "Employees With Deductions", "titleSlug": "employees-with-deductions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4141, "totalSubmissionRaw": 10265}, "2395": {"acRate": 65.0659616725197, "difficulty": "Easy", "likes": 533, "dislikes": 30, "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": 49469, "totalSubmissionRaw": 76029}, "2396": {"acRate": 87.50572688121684, "difficulty": "Medium", "likes": 590, "dislikes": 1530, "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": 85949, "totalSubmissionRaw": 98221}, "2397": {"acRate": 54.81600119189511, "difficulty": "Medium", "likes": 259, "dislikes": 402, "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": 14717, "totalSubmissionRaw": 26848}, "2398": {"acRate": 34.32944727284788, "difficulty": "Hard", "likes": 790, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2398", "paidOnly": false, "title": "Maximum Number of Robots Within Budget", "titleSlug": "maximum-number-of-robots-within-budget", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20701, "totalSubmissionRaw": 60301}, "2399": {"acRate": 70.48026740163021, "difficulty": "Easy", "likes": 477, "dislikes": 56, "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": 48075, "totalSubmissionRaw": 68211}, "2400": {"acRate": 35.118519968225826, "difficulty": "Medium", "likes": 785, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30505, "totalSubmissionRaw": 86863}, "2401": {"acRate": 51.24981869167916, "difficulty": "Medium", "likes": 1266, "dislikes": 29, "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": 31800, "totalSubmissionRaw": 62048}, "2402": {"acRate": 44.5348503718604, "difficulty": "Hard", "likes": 1678, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113355, "totalSubmissionRaw": 254531}, "2403": {"acRate": 56.010340370529946, "difficulty": "Hard", "likes": 46, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1300, "totalSubmissionRaw": 2321}, "2404": {"acRate": 50.42968355070266, "difficulty": "Easy", "likes": 942, "dislikes": 32, "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": 79808, "totalSubmissionRaw": 158254}, "2405": {"acRate": 78.03570477824785, "difficulty": "Medium", "likes": 2589, "dislikes": 100, "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": 190539, "totalSubmissionRaw": 244169}, "2406": {"acRate": 47.00155415423641, "difficulty": "Medium", "likes": 771, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26311, "totalSubmissionRaw": 55979}, "2407": {"acRate": 23.699583669305074, "difficulty": "Hard", "likes": 859, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2407", "paidOnly": false, "title": "Longest Increasing Subsequence II", "titleSlug": "longest-increasing-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14402, "totalSubmissionRaw": 60769}, "2408": {"acRate": 78.15384615384615, "difficulty": "Medium", "likes": 50, "dislikes": 75, "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": 6096, "totalSubmissionRaw": 7800}, "2409": {"acRate": 44.91093133543219, "difficulty": "Easy", "likes": 249, "dislikes": 581, "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": 22539, "totalSubmissionRaw": 50186}, "2410": {"acRate": 62.74909545062171, "difficulty": "Medium", "likes": 483, "dislikes": 15, "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": 34165, "totalSubmissionRaw": 54447}, "2411": {"acRate": 43.99805041080629, "difficulty": "Medium", "likes": 553, "dislikes": 27, "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": 12638, "totalSubmissionRaw": 28724}, "2412": {"acRate": 40.21409661205541, "difficulty": "Hard", "likes": 396, "dislikes": 34, "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": 10481, "totalSubmissionRaw": 26063}, "2413": {"acRate": 87.68805826721209, "difficulty": "Easy", "likes": 880, "dislikes": 101, "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": 166985, "totalSubmissionRaw": 190431}, "2414": {"acRate": 58.103289550458356, "difficulty": "Medium", "likes": 493, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2414", "paidOnly": false, "title": "Length of the Longest Alphabetical Continuous Substring", "titleSlug": "length-of-the-longest-alphabetical-continuous-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44811, "totalSubmissionRaw": 77123}, "2415": {"acRate": 77.62220697018226, "difficulty": "Medium", "likes": 1104, "dislikes": 40, "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": 50893, "totalSubmissionRaw": 65565}, "2416": {"acRate": 45.91897393403347, "difficulty": "Hard", "likes": 657, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2416", "paidOnly": false, "title": "Sum of Prefix Scores of Strings", "titleSlug": "sum-of-prefix-scores-of-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25491, "totalSubmissionRaw": 55513}, "2417": {"acRate": 44.80712166172107, "difficulty": "Medium", "likes": 27, "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": 1057, "totalSubmissionRaw": 2359}, "2418": {"acRate": 80.08560969393666, "difficulty": "Easy", "likes": 1285, "dislikes": 21, "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": 138260, "totalSubmissionRaw": 172641}, "2419": {"acRate": 49.344235896151304, "difficulty": "Medium", "likes": 456, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27578, "totalSubmissionRaw": 55889}, "2420": {"acRate": 38.64220670437393, "difficulty": "Medium", "likes": 619, "dislikes": 36, "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": 23297, "totalSubmissionRaw": 60289}, "2421": {"acRate": 56.370269690249664, "difficulty": "Hard", "likes": 2197, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55160, "totalSubmissionRaw": 97852}, "2422": {"acRate": 69.38537900606654, "difficulty": "Medium", "likes": 130, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11323, "totalSubmissionRaw": 16319}, "2423": {"acRate": 17.324000850751176, "difficulty": "Easy", "likes": 648, "dislikes": 1183, "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": 44799, "totalSubmissionRaw": 258595}, "2424": {"acRate": 55.296638542922196, "difficulty": "Medium", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20645, "totalSubmissionRaw": 37335}, "2425": {"acRate": 58.01086924241974, "difficulty": "Medium", "likes": 395, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19534, "totalSubmissionRaw": 33673}, "2426": {"acRate": 44.01170107826797, "difficulty": "Hard", "likes": 527, "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": 12939, "totalSubmissionRaw": 29399}, "2427": {"acRate": 78.97938366227763, "difficulty": "Easy", "likes": 566, "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": 84395, "totalSubmissionRaw": 106857}, "2428": {"acRate": 74.79580160202029, "difficulty": "Medium", "likes": 447, "dislikes": 60, "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": 37911, "totalSubmissionRaw": 50686}, "2429": {"acRate": 44.04206081766879, "difficulty": "Medium", "likes": 473, "dislikes": 21, "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": 21696, "totalSubmissionRaw": 49262}, "2430": {"acRate": 33.144799249245445, "difficulty": "Hard", "likes": 475, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13068, "totalSubmissionRaw": 39427}, "2431": {"acRate": 64.54073848031736, "difficulty": "Medium", "likes": 45, "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": 2115, "totalSubmissionRaw": 3277}, "2432": {"acRate": 50.034140601165134, "difficulty": "Easy", "likes": 270, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2432", "paidOnly": false, "title": "The Employee That Worked on the Longest Task", "titleSlug": "the-employee-that-worked-on-the-longest-task", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34440, "totalSubmissionRaw": 68833}, "2433": {"acRate": 88.07974778124031, "difficulty": "Medium", "likes": 1369, "dislikes": 80, "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": 144996, "totalSubmissionRaw": 164619}, "2434": {"acRate": 39.753483619921305, "difficulty": "Medium", "likes": 638, "dislikes": 192, "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": 18287, "totalSubmissionRaw": 46001}, "2435": {"acRate": 42.73617257696802, "difficulty": "Hard", "likes": 886, "dislikes": 30, "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": 22307, "totalSubmissionRaw": 52197}, "2436": {"acRate": 71.39208173690932, "difficulty": "Medium", "likes": 39, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2236, "totalSubmissionRaw": 3132}, "2437": {"acRate": 46.57768496239464, "difficulty": "Easy", "likes": 282, "dislikes": 233, "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": 30779, "totalSubmissionRaw": 66081}, "2438": {"acRate": 40.130124598070736, "difficulty": "Medium", "likes": 293, "dislikes": 50, "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": 15975, "totalSubmissionRaw": 39808}, "2439": {"acRate": 46.54244661972638, "difficulty": "Medium", "likes": 2392, "dislikes": 615, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81304, "totalSubmissionRaw": 174688}, "2440": {"acRate": 52.84766041137425, "difficulty": "Hard", "likes": 381, "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": 6449, "totalSubmissionRaw": 12203}, "2441": {"acRate": 75.18911370385642, "difficulty": "Easy", "likes": 982, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216983, "totalSubmissionRaw": 288583}, "2442": {"acRate": 79.27838550505182, "difficulty": "Medium", "likes": 613, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60732, "totalSubmissionRaw": 76606}, "2443": {"acRate": 47.22014726283214, "difficulty": "Medium", "likes": 250, "dislikes": 299, "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": 35400, "totalSubmissionRaw": 74968}, "2444": {"acRate": 68.04133125075094, "difficulty": "Hard", "likes": 3098, "dislikes": 80, "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": 141577, "totalSubmissionRaw": 208075}, "2445": {"acRate": 68.86858749121573, "difficulty": "Medium", "likes": 76, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2445", "paidOnly": true, "title": "Number of Nodes With Value One", "titleSlug": "number-of-nodes-with-value-one", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1960, "totalSubmissionRaw": 2846}, "2446": {"acRate": 50.88845245610344, "difficulty": "Easy", "likes": 441, "dislikes": 65, "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": 43530, "totalSubmissionRaw": 85541}, "2447": {"acRate": 49.953779281317, "difficulty": "Medium", "likes": 439, "dislikes": 65, "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": 25398, "totalSubmissionRaw": 50843}, "2448": {"acRate": 45.92439910564561, "difficulty": "Hard", "likes": 2370, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2448", "paidOnly": false, "title": "Minimum Cost to Make Array Equal", "titleSlug": "minimum-cost-to-make-array-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65727, "totalSubmissionRaw": 143120}, "2449": {"acRate": 61.78347148957548, "difficulty": "Hard", "likes": 416, "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": 12298, "totalSubmissionRaw": 19905}, "2450": {"acRate": 64.20373027259684, "difficulty": "Medium", "likes": 34, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 895, "totalSubmissionRaw": 1394}, "2451": {"acRate": 59.13127097143792, "difficulty": "Easy", "likes": 387, "dislikes": 109, "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": 28901, "totalSubmissionRaw": 48876}, "2452": {"acRate": 60.61205759192336, "difficulty": "Medium", "likes": 288, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21133, "totalSubmissionRaw": 34866}, "2453": {"acRate": 39.1183252288656, "difficulty": "Medium", "likes": 561, "dislikes": 21, "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": 17135, "totalSubmissionRaw": 43803}, "2454": {"acRate": 38.74325366229761, "difficulty": "Hard", "likes": 651, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2454", "paidOnly": false, "title": "Next Greater Element IV", "titleSlug": "next-greater-element-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10050, "totalSubmissionRaw": 25940}, "2455": {"acRate": 60.203937733904645, "difficulty": "Easy", "likes": 327, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2455", "paidOnly": false, "title": "Average Value of Even Numbers That Are Divisible by Three", "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55499, "totalSubmissionRaw": 92185}, "2456": {"acRate": 43.689748471790764, "difficulty": "Medium", "likes": 264, "dislikes": 364, "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": 21799, "totalSubmissionRaw": 49895}, "2457": {"acRate": 37.567214625902594, "difficulty": "Medium", "likes": 522, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19562, "totalSubmissionRaw": 52072}, "2458": {"acRate": 40.34982297723065, "difficulty": "Hard", "likes": 824, "dislikes": 18, "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": 24845, "totalSubmissionRaw": 61574}, "2459": {"acRate": 46.43550624133149, "difficulty": "Hard", "likes": 51, "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": 1674, "totalSubmissionRaw": 3605}, "2460": {"acRate": 67.45386472894836, "difficulty": "Easy", "likes": 533, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60896, "totalSubmissionRaw": 90278}, "2461": {"acRate": 33.991349393954636, "difficulty": "Medium", "likes": 1256, "dislikes": 23, "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": 54067, "totalSubmissionRaw": 159052}, "2462": {"acRate": 43.002382340842, "difficulty": "Medium", "likes": 1840, "dislikes": 564, "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": 95125, "totalSubmissionRaw": 221207}, "2463": {"acRate": 40.62360137251977, "difficulty": "Hard", "likes": 459, "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": 8169, "totalSubmissionRaw": 20109}, "2464": {"acRate": 54.32879377431906, "difficulty": "Medium", "likes": 28, "dislikes": 6, "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": 1117, "totalSubmissionRaw": 2056}, "2465": {"acRate": 57.81619954848301, "difficulty": "Easy", "likes": 362, "dislikes": 26, "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": 42000, "totalSubmissionRaw": 72644}, "2466": {"acRate": 54.58814765041849, "difficulty": "Medium", "likes": 1686, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2466", "paidOnly": false, "title": "Count Ways To Build Good Strings", "titleSlug": "count-ways-to-build-good-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74741, "totalSubmissionRaw": 136918}, "2467": {"acRate": 49.05145790719127, "difficulty": "Medium", "likes": 679, "dislikes": 67, "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": 12230, "totalSubmissionRaw": 24933}, "2468": {"acRate": 44.407850214301824, "difficulty": "Hard", "likes": 151, "dislikes": 162, "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": 9842, "totalSubmissionRaw": 22164}, "2469": {"acRate": 89.38251435864709, "difficulty": "Easy", "likes": 596, "dislikes": 329, "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": 175077, "totalSubmissionRaw": 195874}, "2470": {"acRate": 38.771004538206796, "difficulty": "Medium", "likes": 353, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2470", "paidOnly": false, "title": "Number of Subarrays With LCM Equal to K", "titleSlug": "number-of-subarrays-with-lcm-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22127, "totalSubmissionRaw": 57071}, "2471": {"acRate": 61.8428342323954, "difficulty": "Medium", "likes": 622, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2471", "paidOnly": false, "title": "Minimum Number of Operations to Sort a Binary Tree by Level", "titleSlug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21209, "totalSubmissionRaw": 34295}, "2472": {"acRate": 40.20929126367528, "difficulty": "Hard", "likes": 449, "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": 15216, "totalSubmissionRaw": 37842}, "2473": {"acRate": 67.76285317276518, "difficulty": "Medium", "likes": 108, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5852, "totalSubmissionRaw": 8636}, "2474": {"acRate": 44.469424460431654, "difficulty": "Hard", "likes": 38, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2474", "paidOnly": true, "title": "Customers With Strictly Increasing Purchases", "titleSlug": "customers-with-strictly-increasing-purchases", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2967, "totalSubmissionRaw": 6672}, "2475": {"acRate": 71.25348382294389, "difficulty": "Easy", "likes": 396, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41161, "totalSubmissionRaw": 57767}, "2476": {"acRate": 41.497139826495435, "difficulty": "Medium", "likes": 426, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "2476", "paidOnly": false, "title": "Closest Nodes Queries in a Binary Search Tree", "titleSlug": "closest-nodes-queries-in-a-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21908, "totalSubmissionRaw": 52794}, "2477": {"acRate": 64.66917300353224, "difficulty": "Medium", "likes": 2160, "dislikes": 86, "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": 68290, "totalSubmissionRaw": 105599}, "2478": {"acRate": 30.89908599141951, "difficulty": "Hard", "likes": 342, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9939, "totalSubmissionRaw": 32166}, "2479": {"acRate": 49.079754601226995, "difficulty": "Hard", "likes": 31, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2479", "paidOnly": true, "title": "Maximum XOR of Two Non-Overlapping Subtrees", "titleSlug": "maximum-xor-of-two-non-overlapping-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 640, "totalSubmissionRaw": 1304}, "2480": {"acRate": 75.03573981415298, "difficulty": "Easy", "likes": 26, "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": 4199, "totalSubmissionRaw": 5596}, "2481": {"acRate": 53.16075237541206, "difficulty": "Easy", "likes": 218, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2481", "paidOnly": false, "title": "Minimum Cuts to Divide a Circle", "titleSlug": "minimum-cuts-to-divide-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32898, "totalSubmissionRaw": 61884}, "2482": {"acRate": 84.49032083389739, "difficulty": "Medium", "likes": 1155, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124826, "totalSubmissionRaw": 147740}, "2483": {"acRate": 67.32776820127442, "difficulty": "Medium", "likes": 1896, "dislikes": 100, "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": 104285, "totalSubmissionRaw": 154892}, "2484": {"acRate": 37.717799795011956, "difficulty": "Hard", "likes": 487, "dislikes": 26, "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": 9936, "totalSubmissionRaw": 26343}, "2485": {"acRate": 83.93716823910722, "difficulty": "Easy", "likes": 1255, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220905, "totalSubmissionRaw": 263179}, "2486": {"acRate": 73.35944624057034, "difficulty": "Medium", "likes": 1052, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176971, "totalSubmissionRaw": 241241}, "2487": {"acRate": 74.41490311997532, "difficulty": "Medium", "likes": 2005, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183272, "totalSubmissionRaw": 246284}, "2488": {"acRate": 44.350746268656714, "difficulty": "Hard", "likes": 559, "dislikes": 12, "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": 11886, "totalSubmissionRaw": 26800}, "2489": {"acRate": 58.01767676767676, "difficulty": "Medium", "likes": 46, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 919, "totalSubmissionRaw": 1584}, "2490": {"acRate": 62.69801701539105, "difficulty": "Easy", "likes": 359, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38985, "totalSubmissionRaw": 62179}, "2491": {"acRate": 59.683083799633685, "difficulty": "Medium", "likes": 477, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35518, "totalSubmissionRaw": 59511}, "2492": {"acRate": 57.45133757701046, "difficulty": "Medium", "likes": 1760, "dislikes": 299, "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": 84207, "totalSubmissionRaw": 146571}, "2493": {"acRate": 38.463821158316435, "difficulty": "Hard", "likes": 400, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2493", "paidOnly": false, "title": "Divide Nodes Into the Maximum Number of Groups", "titleSlug": "divide-nodes-into-the-maximum-number-of-groups", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7777, "totalSubmissionRaw": 20219}, "2494": {"acRate": 31.097008159564822, "difficulty": "Hard", "likes": 43, "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": 1715, "totalSubmissionRaw": 5515}, "2495": {"acRate": 64.15797317436662, "difficulty": "Medium", "likes": 44, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1722, "totalSubmissionRaw": 2684}, "2496": {"acRate": 72.11398321411221, "difficulty": "Easy", "likes": 389, "dislikes": 20, "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": 43047, "totalSubmissionRaw": 59693}, "2497": {"acRate": 39.0280582649422, "difficulty": "Medium", "likes": 365, "dislikes": 46, "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": 18166, "totalSubmissionRaw": 46546}, "2498": {"acRate": 61.843637032044604, "difficulty": "Medium", "likes": 681, "dislikes": 98, "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": 20187, "totalSubmissionRaw": 32642}, "2499": {"acRate": 43.69924812030075, "difficulty": "Hard", "likes": 226, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2499", "paidOnly": false, "title": "Minimum Total Cost to Make Arrays Unequal", "titleSlug": "minimum-total-cost-to-make-arrays-unequal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4359, "totalSubmissionRaw": 9975}, "2500": {"acRate": 77.9492982030766, "difficulty": "Easy", "likes": 622, "dislikes": 45, "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": 57868, "totalSubmissionRaw": 74238}, "2501": {"acRate": 39.59100331033629, "difficulty": "Medium", "likes": 452, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2501", "paidOnly": false, "title": "Longest Square Streak in an Array", "titleSlug": "longest-square-streak-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25594, "totalSubmissionRaw": 64646}, "2502": {"acRate": 52.87002205214684, "difficulty": "Medium", "likes": 277, "dislikes": 83, "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": 16303, "totalSubmissionRaw": 30836}, "2503": {"acRate": 37.38433066008637, "difficulty": "Hard", "likes": 465, "dislikes": 17, "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": 9090, "totalSubmissionRaw": 24315}, "2504": {"acRate": 74.54171343060231, "difficulty": "Easy", "likes": 29, "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": 3984, "totalSubmissionRaw": 5344}, "2505": {"acRate": 68.54748603351956, "difficulty": "Medium", "likes": 51, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3681, "totalSubmissionRaw": 5370}, "2506": {"acRate": 69.71466575826885, "difficulty": "Easy", "likes": 494, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42977, "totalSubmissionRaw": 61647}, "2507": {"acRate": 48.42530163236338, "difficulty": "Medium", "likes": 377, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2507", "paidOnly": false, "title": "Smallest Value After Replacing With Sum of Prime Factors", "titleSlug": "smallest-value-after-replacing-with-sum-of-prime-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21834, "totalSubmissionRaw": 45088}, "2508": {"acRate": 31.46798189750955, "difficulty": "Hard", "likes": 322, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2508", "paidOnly": false, "title": "Add Edges to Make Degrees of All Nodes Even", "titleSlug": "add-edges-to-make-degrees-of-all-nodes-even", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11612, "totalSubmissionRaw": 36901}, "2509": {"acRate": 55.94361925152772, "difficulty": "Hard", "likes": 342, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12542, "totalSubmissionRaw": 22419}, "2510": {"acRate": 50.128346167950134, "difficulty": "Medium", "likes": 91, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4101, "totalSubmissionRaw": 8181}, "2511": {"acRate": 38.22886965801277, "difficulty": "Easy", "likes": 267, "dislikes": 269, "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": 22927, "totalSubmissionRaw": 59973}, "2512": {"acRate": 45.09338398227287, "difficulty": "Medium", "likes": 323, "dislikes": 79, "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": 19943, "totalSubmissionRaw": 44226}, "2513": {"acRate": 30.240132218549487, "difficulty": "Medium", "likes": 473, "dislikes": 92, "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": 12442, "totalSubmissionRaw": 41144}, "2514": {"acRate": 32.640627356356504, "difficulty": "Hard", "likes": 401, "dislikes": 35, "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": 10822, "totalSubmissionRaw": 33155}, "2515": {"acRate": 48.89978881395191, "difficulty": "Easy", "likes": 340, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28712, "totalSubmissionRaw": 58716}, "2516": {"acRate": 34.4134970119307, "difficulty": "Medium", "likes": 695, "dislikes": 63, "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": 15951, "totalSubmissionRaw": 46351}, "2517": {"acRate": 63.26882664742966, "difficulty": "Medium", "likes": 874, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20172, "totalSubmissionRaw": 31883}, "2518": {"acRate": 31.22788326167193, "difficulty": "Hard", "likes": 424, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8207, "totalSubmissionRaw": 26281}, "2519": {"acRate": 53.38375175424919, "difficulty": "Hard", "likes": 98, "dislikes": 18, "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": 6847, "totalSubmissionRaw": 12826}, "2520": {"acRate": 84.42376071951475, "difficulty": "Easy", "likes": 491, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2520", "paidOnly": false, "title": "Count the Digits That Divide a Number", "titleSlug": "count-the-digits-that-divide-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80726, "totalSubmissionRaw": 95620}, "2521": {"acRate": 50.98177199546875, "difficulty": "Medium", "likes": 452, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2521", "paidOnly": false, "title": "Distinct Prime Factors of Product of Array", "titleSlug": "distinct-prime-factors-of-product-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29703, "totalSubmissionRaw": 58262}, "2522": {"acRate": 46.133569609037544, "difficulty": "Medium", "likes": 368, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20827, "totalSubmissionRaw": 45145}, "2523": {"acRate": 37.151409329009724, "difficulty": "Medium", "likes": 361, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2523", "paidOnly": false, "title": "Closest Prime Numbers in Range", "titleSlug": "closest-prime-numbers-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22341, "totalSubmissionRaw": 60135}, "2524": {"acRate": 40.19963702359347, "difficulty": "Hard", "likes": 22, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 886, "totalSubmissionRaw": 2204}, "2525": {"acRate": 35.49399022586184, "difficulty": "Easy", "likes": 191, "dislikes": 54, "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": 32247, "totalSubmissionRaw": 90852}, "2526": {"acRate": 49.16637586755069, "difficulty": "Medium", "likes": 305, "dislikes": 33, "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": 25361, "totalSubmissionRaw": 51582}, "2527": {"acRate": 68.12178356785547, "difficulty": "Medium", "likes": 350, "dislikes": 51, "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": 18929, "totalSubmissionRaw": 27787}, "2528": {"acRate": 32.37596657221075, "difficulty": "Hard", "likes": 447, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2528", "paidOnly": false, "title": "Maximize the Minimum Powered City", "titleSlug": "maximize-the-minimum-powered-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6741, "totalSubmissionRaw": 20821}, "2529": {"acRate": 71.00465180865098, "difficulty": "Easy", "likes": 877, "dislikes": 51, "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": 102268, "totalSubmissionRaw": 144030}, "2530": {"acRate": 45.63839470417874, "difficulty": "Medium", "likes": 384, "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": 27577, "totalSubmissionRaw": 60425}, "2531": {"acRate": 26.2365652706902, "difficulty": "Medium", "likes": 553, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18406, "totalSubmissionRaw": 70154}, "2532": {"acRate": 44.187604690117254, "difficulty": "Hard", "likes": 111, "dislikes": 215, "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": 3957, "totalSubmissionRaw": 8955}, "2533": {"acRate": 51.76340185409109, "difficulty": "Medium", "likes": 53, "dislikes": 21, "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": 5137, "totalSubmissionRaw": 9924}, "2534": {"acRate": 49.58873774122113, "difficulty": "Hard", "likes": 74, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2534", "paidOnly": true, "title": "Time Taken to Cross the Door", "titleSlug": "time-taken-to-cross-the-door", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6270, "totalSubmissionRaw": 12644}, "2535": {"acRate": 84.27957633197079, "difficulty": "Easy", "likes": 676, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2535", "paidOnly": false, "title": "Difference Between Element Sum and Digit Sum of an Array", "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 121027, "totalSubmissionRaw": 143602}, "2536": {"acRate": 49.239310692912255, "difficulty": "Medium", "likes": 453, "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": 20487, "totalSubmissionRaw": 41607}, "2537": {"acRate": 50.36557342803426, "difficulty": "Medium", "likes": 827, "dislikes": 22, "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": 19288, "totalSubmissionRaw": 38296}, "2538": {"acRate": 32.28116131848942, "difficulty": "Hard", "likes": 417, "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": 7394, "totalSubmissionRaw": 22905}, "2539": {"acRate": 52.770448548812666, "difficulty": "Medium", "likes": 26, "dislikes": 65, "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": 2200, "totalSubmissionRaw": 4169}, "2540": {"acRate": 59.186422976501305, "difficulty": "Easy", "likes": 1086, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226684, "totalSubmissionRaw": 383000}, "2541": {"acRate": 31.40694774691179, "difficulty": "Medium", "likes": 405, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21662, "totalSubmissionRaw": 68972}, "2542": {"acRate": 53.620402489574595, "difficulty": "Medium", "likes": 2635, "dislikes": 156, "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": 85633, "totalSubmissionRaw": 159703}, "2543": {"acRate": 41.962991862668595, "difficulty": "Hard", "likes": 239, "dislikes": 49, "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": 7529, "totalSubmissionRaw": 17942}, "2544": {"acRate": 68.20721472620207, "difficulty": "Easy", "likes": 384, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58841, "totalSubmissionRaw": 86268}, "2545": {"acRate": 85.26665905327471, "difficulty": "Medium", "likes": 645, "dislikes": 45, "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": 59731, "totalSubmissionRaw": 70052}, "2546": {"acRate": 41.006480624256056, "difficulty": "Medium", "likes": 248, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18603, "totalSubmissionRaw": 45366}, "2547": {"acRate": 40.0686224052153, "difficulty": "Hard", "likes": 427, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11677, "totalSubmissionRaw": 29144}, "2548": {"acRate": 65.5064935064935, "difficulty": "Medium", "likes": 39, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2548", "paidOnly": true, "title": "Maximum Price to Fill a Bag", "titleSlug": "maximum-price-to-fill-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1261, "totalSubmissionRaw": 1925}, "2549": {"acRate": 60.146979905789756, "difficulty": "Easy", "likes": 258, "dislikes": 262, "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": 40349, "totalSubmissionRaw": 67084}, "2550": {"acRate": 27.452887366625788, "difficulty": "Medium", "likes": 183, "dislikes": 494, "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": 19477, "totalSubmissionRaw": 70947}, "2551": {"acRate": 66.63959343744924, "difficulty": "Hard", "likes": 2019, "dislikes": 85, "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": 57434, "totalSubmissionRaw": 86186}, "2552": {"acRate": 33.48047034385549, "difficulty": "Hard", "likes": 367, "dislikes": 66, "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": 9026, "totalSubmissionRaw": 26959}, "2553": {"acRate": 79.18047119455181, "difficulty": "Easy", "likes": 473, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2553", "paidOnly": false, "title": "Separate the Digits in an Array", "titleSlug": "separate-the-digits-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68830, "totalSubmissionRaw": 86928}, "2554": {"acRate": 53.61350510884052, "difficulty": "Medium", "likes": 323, "dislikes": 21, "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": 30171, "totalSubmissionRaw": 56275}, "2555": {"acRate": 32.93547429852616, "difficulty": "Medium", "likes": 538, "dislikes": 45, "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": 9989, "totalSubmissionRaw": 30329}, "2556": {"acRate": 27.31318956870612, "difficulty": "Medium", "likes": 563, "dislikes": 26, "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": 13071, "totalSubmissionRaw": 47856}, "2557": {"acRate": 41.085922194234534, "difficulty": "Medium", "likes": 32, "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": 1468, "totalSubmissionRaw": 3573}, "2558": {"acRate": 66.63938977701143, "difficulty": "Easy", "likes": 372, "dislikes": 37, "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": 45602, "totalSubmissionRaw": 68431}, "2559": {"acRate": 51.849870050450996, "difficulty": "Medium", "likes": 433, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27132, "totalSubmissionRaw": 52328}, "2560": {"acRate": 43.02823337020826, "difficulty": "Medium", "likes": 890, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2560", "paidOnly": false, "title": "House Robber IV", "titleSlug": "house-robber-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17892, "totalSubmissionRaw": 41582}, "2561": {"acRate": 33.97590361445783, "difficulty": "Hard", "likes": 374, "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": 9447, "totalSubmissionRaw": 27805}, "2562": {"acRate": 69.72454102439526, "difficulty": "Easy", "likes": 348, "dislikes": 14, "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": 47359, "totalSubmissionRaw": 67923}, "2563": {"acRate": 32.71770271170631, "difficulty": "Medium", "likes": 787, "dislikes": 39, "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": 24553, "totalSubmissionRaw": 75045}, "2564": {"acRate": 33.442212423104145, "difficulty": "Medium", "likes": 364, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12286, "totalSubmissionRaw": 36738}, "2565": {"acRate": 31.519596607838647, "difficulty": "Hard", "likes": 369, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6876, "totalSubmissionRaw": 21815}, "2566": {"acRate": 59.69727252784751, "difficulty": "Easy", "likes": 226, "dislikes": 36, "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": 24492, "totalSubmissionRaw": 41027}, "2567": {"acRate": 47.77405180388529, "difficulty": "Medium", "likes": 234, "dislikes": 210, "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": 16526, "totalSubmissionRaw": 34592}, "2568": {"acRate": 57.45871070857752, "difficulty": "Medium", "likes": 348, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15099, "totalSubmissionRaw": 26278}, "2569": {"acRate": 27.4930639166623, "difficulty": "Hard", "likes": 172, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5252, "totalSubmissionRaw": 19103}, "2570": {"acRate": 73.4910818320337, "difficulty": "Easy", "likes": 326, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40997, "totalSubmissionRaw": 55785}, "2571": {"acRate": 54.81390706224181, "difficulty": "Medium", "likes": 524, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27732, "totalSubmissionRaw": 50593}, "2572": {"acRate": 22.991577991830148, "difficulty": "Medium", "likes": 450, "dislikes": 112, "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": 9118, "totalSubmissionRaw": 39658}, "2573": {"acRate": 31.75971445888612, "difficulty": "Hard", "likes": 185, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4716, "totalSubmissionRaw": 14849}, "2574": {"acRate": 86.35496437815193, "difficulty": "Easy", "likes": 1004, "dislikes": 92, "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": 129453, "totalSubmissionRaw": 149908}, "2575": {"acRate": 32.44630571343105, "difficulty": "Medium", "likes": 521, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27117, "totalSubmissionRaw": 83575}, "2576": {"acRate": 38.28907741668799, "difficulty": "Medium", "likes": 550, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19452, "totalSubmissionRaw": 50803}, "2577": {"acRate": 35.51693404634581, "difficulty": "Hard", "likes": 531, "dislikes": 10, "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": 11157, "totalSubmissionRaw": 31414}, "2578": {"acRate": 70.31887282165368, "difficulty": "Easy", "likes": 358, "dislikes": 28, "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": 34137, "totalSubmissionRaw": 48546}, "2579": {"acRate": 57.510603070921505, "difficulty": "Medium", "likes": 288, "dislikes": 22, "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": 25357, "totalSubmissionRaw": 44091}, "2580": {"acRate": 35.88227172312224, "difficulty": "Medium", "likes": 310, "dislikes": 18, "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": 15593, "totalSubmissionRaw": 43456}, "2581": {"acRate": 45.97069597069597, "difficulty": "Hard", "likes": 292, "dislikes": 9, "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": 5773, "totalSubmissionRaw": 12558}, "2582": {"acRate": 45.82802630552884, "difficulty": "Easy", "likes": 377, "dislikes": 15, "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": 35261, "totalSubmissionRaw": 76942}, "2583": {"acRate": 47.34218842329728, "difficulty": "Medium", "likes": 530, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36854, "totalSubmissionRaw": 77846}, "2584": {"acRate": 22.769026227790985, "difficulty": "Hard", "likes": 301, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11303, "totalSubmissionRaw": 49642}, "2585": {"acRate": 57.24739555171047, "difficulty": "Hard", "likes": 460, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15881, "totalSubmissionRaw": 27741}, "2586": {"acRate": 73.96391568417292, "difficulty": "Easy", "likes": 333, "dislikes": 23, "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": 57967, "totalSubmissionRaw": 78372}, "2587": {"acRate": 40.890600344543046, "difficulty": "Medium", "likes": 280, "dislikes": 43, "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": 28246, "totalSubmissionRaw": 69077}, "2588": {"acRate": 50.212628677009704, "difficulty": "Medium", "likes": 486, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17121, "totalSubmissionRaw": 34096}, "2589": {"acRate": 38.85757871096233, "difficulty": "Hard", "likes": 419, "dislikes": 16, "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": 9170, "totalSubmissionRaw": 23599}, "2590": {"acRate": 58.34382871536524, "difficulty": "Medium", "likes": 36, "dislikes": 13, "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": 1853, "totalSubmissionRaw": 3176}, "2591": {"acRate": 19.127658730683304, "difficulty": "Easy", "likes": 282, "dislikes": 813, "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": 28939, "totalSubmissionRaw": 151294}, "2592": {"acRate": 57.413578205682605, "difficulty": "Medium", "likes": 427, "dislikes": 14, "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": 22571, "totalSubmissionRaw": 39313}, "2593": {"acRate": 52.2869480920067, "difficulty": "Medium", "likes": 355, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17799, "totalSubmissionRaw": 34041}, "2594": {"acRate": 43.847179031541536, "difficulty": "Medium", "likes": 552, "dislikes": 27, "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": 15792, "totalSubmissionRaw": 36016}, "2595": {"acRate": 73.062706161216, "difficulty": "Easy", "likes": 268, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "2595", "paidOnly": false, "title": "Number of Even and Odd Bits", "titleSlug": "number-of-even-and-odd-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44078, "totalSubmissionRaw": 60329}, "2596": {"acRate": 56.794104099493325, "difficulty": "Medium", "likes": 378, "dislikes": 53, "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": 27126, "totalSubmissionRaw": 47762}, "2597": {"acRate": 51.251441330966195, "difficulty": "Medium", "likes": 1163, "dislikes": 168, "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"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112007, "totalSubmissionRaw": 218542}, "2598": {"acRate": 39.34877996575342, "difficulty": "Medium", "likes": 341, "dislikes": 38, "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": 14707, "totalSubmissionRaw": 37376}, "2599": {"acRate": 51.11308993766697, "difficulty": "Medium", "likes": 44, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1722, "totalSubmissionRaw": 3369}, "2600": {"acRate": 61.521492398932175, "difficulty": "Easy", "likes": 276, "dislikes": 25, "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": 38486, "totalSubmissionRaw": 62557}, "2601": {"acRate": 37.66953949952633, "difficulty": "Medium", "likes": 373, "dislikes": 36, "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": 16303, "totalSubmissionRaw": 43279}, "2602": {"acRate": 35.18617458490876, "difficulty": "Medium", "likes": 681, "dislikes": 20, "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": 17123, "totalSubmissionRaw": 48664}, "2603": {"acRate": 37.1672391584371, "difficulty": "Hard", "likes": 414, "dislikes": 10, "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": 6925, "totalSubmissionRaw": 18632}, "2604": {"acRate": 41.286307053941904, "difficulty": "Hard", "likes": 39, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 995, "totalSubmissionRaw": 2410}, "2605": {"acRate": 53.65287225435258, "difficulty": "Easy", "likes": 293, "dislikes": 21, "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": 35808, "totalSubmissionRaw": 66741}, "2606": {"acRate": 56.433553162214736, "difficulty": "Medium", "likes": 349, "dislikes": 10, "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": 23789, "totalSubmissionRaw": 42154}, "2607": {"acRate": 36.489523671427534, "difficulty": "Medium", "likes": 449, "dislikes": 81, "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": 10066, "totalSubmissionRaw": 27586}, "2608": {"acRate": 36.418333038400284, "difficulty": "Hard", "likes": 486, "dislikes": 16, "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": 16464, "totalSubmissionRaw": 45208}, "2609": {"acRate": 46.15384615384615, "difficulty": "Easy", "likes": 359, "dislikes": 25, "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": 30192, "totalSubmissionRaw": 65416}, "2610": {"acRate": 87.1790599868517, "difficulty": "Medium", "likes": 1578, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193609, "totalSubmissionRaw": 222082}, "2611": {"acRate": 45.43567321294068, "difficulty": "Medium", "likes": 602, "dislikes": 51, "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": 24732, "totalSubmissionRaw": 54433}, "2612": {"acRate": 16.35593514564455, "difficulty": "Hard", "likes": 235, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4711, "totalSubmissionRaw": 28803}, "2613": {"acRate": 45.04424778761062, "difficulty": "Hard", "likes": 17, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2613", "paidOnly": true, "title": "Beautiful Pairs", "titleSlug": "beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 509, "totalSubmissionRaw": 1130}, "2614": {"acRate": 33.789422610383305, "difficulty": "Easy", "likes": 337, "dislikes": 36, "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": 41784, "totalSubmissionRaw": 123660}, "2615": {"acRate": 30.745436186751718, "difficulty": "Medium", "likes": 720, "dislikes": 86, "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": 19183, "totalSubmissionRaw": 62393}, "2616": {"acRate": 43.978568313500716, "difficulty": "Medium", "likes": 2267, "dislikes": 244, "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": 70590, "totalSubmissionRaw": 160510}, "2617": {"acRate": 24.733423954085485, "difficulty": "Hard", "likes": 364, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8188, "totalSubmissionRaw": 33105}, "2618": {"acRate": 27.650796061457463, "difficulty": "Medium", "likes": 263, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21848, "totalSubmissionRaw": 79014}, "2619": {"acRate": 73.04968278237641, "difficulty": "Easy", "likes": 484, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124698, "totalSubmissionRaw": 170703}, "2620": {"acRate": 80.67009216828602, "difficulty": "Easy", "likes": 1195, "dislikes": 96, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342566, "totalSubmissionRaw": 424651}, "2621": {"acRate": 86.52691878382836, "difficulty": "Easy", "likes": 562, "dislikes": 42, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123252, "totalSubmissionRaw": 142443}, "2622": {"acRate": 73.8933158338802, "difficulty": "Medium", "likes": 403, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39411, "totalSubmissionRaw": 53335}, "2623": {"acRate": 62.29951216088162, "difficulty": "Medium", "likes": 553, "dislikes": 75, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88755, "totalSubmissionRaw": 142465}, "2624": {"acRate": 65.19788388133664, "difficulty": "Medium", "likes": 96, "dislikes": 42, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9736, "totalSubmissionRaw": 14933}, "2625": {"acRate": 63.56126036937152, "difficulty": "Medium", "likes": 314, "dislikes": 23, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37238, "totalSubmissionRaw": 58585}, "2626": {"acRate": 84.23867018316436, "difficulty": "Easy", "likes": 566, "dislikes": 32, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139258, "totalSubmissionRaw": 165314}, "2627": {"acRate": 90.51110539404854, "difficulty": "Medium", "likes": 368, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42218, "totalSubmissionRaw": 46644}, "2628": {"acRate": 38.590033975084935, "difficulty": "Medium", "likes": 212, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12267, "totalSubmissionRaw": 31788}, "2629": {"acRate": 85.81100799626452, "difficulty": "Easy", "likes": 633, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117616, "totalSubmissionRaw": 137064}, "2630": {"acRate": 30.938212205621678, "difficulty": "Hard", "likes": 115, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4887, "totalSubmissionRaw": 15796}, "2631": {"acRate": 80.64391583192125, "difficulty": "Medium", "likes": 288, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37593, "totalSubmissionRaw": 46617}, "2632": {"acRate": 89.3917571460226, "difficulty": "Medium", "likes": 340, "dislikes": 34, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16137, "totalSubmissionRaw": 18052}, "2633": {"acRate": 77.47820798702615, "difficulty": "Medium", "likes": 202, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11466, "totalSubmissionRaw": 14799}, "2634": {"acRate": 84.37537263007275, "difficulty": "Easy", "likes": 604, "dislikes": 65, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148596, "totalSubmissionRaw": 176113}, "2635": {"acRate": 85.58852025452356, "difficulty": "Easy", "likes": 693, "dislikes": 61, "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": 163425, "totalSubmissionRaw": 190943}, "2636": {"acRate": 80.01730679624576, "difficulty": "Medium", "likes": 282, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12021, "totalSubmissionRaw": 15023}, "2637": {"acRate": 81.37141299161611, "difficulty": "Medium", "likes": 459, "dislikes": 64, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47752, "totalSubmissionRaw": 58684}, "2638": {"acRate": 46.76817899316346, "difficulty": "Medium", "likes": 74, "dislikes": 12, "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": 3010, "totalSubmissionRaw": 6436}, "2639": {"acRate": 67.28658305786168, "difficulty": "Easy", "likes": 163, "dislikes": 41, "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": 26665, "totalSubmissionRaw": 39629}, "2640": {"acRate": 70.15741961154907, "difficulty": "Medium", "likes": 275, "dislikes": 32, "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": 28211, "totalSubmissionRaw": 40211}, "2641": {"acRate": 67.79985635623653, "difficulty": "Medium", "likes": 557, "dislikes": 12, "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": 19824, "totalSubmissionRaw": 29239}, "2642": {"acRate": 70.71791851812196, "difficulty": "Hard", "likes": 788, "dislikes": 56, "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": 66047, "totalSubmissionRaw": 93395}, "2643": {"acRate": 75.46762402768023, "difficulty": "Easy", "likes": 426, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2643", "paidOnly": false, "title": "Row With Maximum Ones", "titleSlug": "row-with-maximum-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58018, "totalSubmissionRaw": 76878}, "2644": {"acRate": 49.06156217049234, "difficulty": "Easy", "likes": 167, "dislikes": 47, "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": 30243, "totalSubmissionRaw": 61644}, "2645": {"acRate": 50.36534540927706, "difficulty": "Medium", "likes": 527, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2645", "paidOnly": false, "title": "Minimum Additions to Make Valid String", "titleSlug": "minimum-additions-to-make-valid-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27916, "totalSubmissionRaw": 55427}, "2646": {"acRate": 45.04743833017078, "difficulty": "Hard", "likes": 463, "dislikes": 18, "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": 9496, "totalSubmissionRaw": 21080}, "2647": {"acRate": 66.66666666666666, "difficulty": "Hard", "likes": 10, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2647", "paidOnly": true, "title": "Color the Triangle Red", "titleSlug": "color-the-triangle-red", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 300, "totalSubmissionRaw": 450}, "2648": {"acRate": 82.72741654801456, "difficulty": "Easy", "likes": 238, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26146, "totalSubmissionRaw": 31605}, "2649": {"acRate": 78.97102226992219, "difficulty": "Medium", "likes": 160, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11773, "totalSubmissionRaw": 14908}, "2650": {"acRate": 51.02639296187683, "difficulty": "Hard", "likes": 62, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1914, "totalSubmissionRaw": 3751}, "2651": {"acRate": 78.5466058017965, "difficulty": "Easy", "likes": 225, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2651", "paidOnly": false, "title": "Calculate Delayed Arrival Time", "titleSlug": "calculate-delayed-arrival-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53341, "totalSubmissionRaw": 67910}, "2652": {"acRate": 85.3438104084553, "difficulty": "Easy", "likes": 479, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101981, "totalSubmissionRaw": 119494}, "2653": {"acRate": 32.89299646725936, "difficulty": "Medium", "likes": 605, "dislikes": 121, "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": 19646, "totalSubmissionRaw": 59727}, "2654": {"acRate": 35.06198112134653, "difficulty": "Medium", "likes": 377, "dislikes": 20, "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": 12332, "totalSubmissionRaw": 35172}, "2655": {"acRate": 53.163444639718804, "difficulty": "Medium", "likes": 25, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1210, "totalSubmissionRaw": 2276}, "2656": {"acRate": 82.02221445024662, "difficulty": "Easy", "likes": 359, "dislikes": 46, "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": 68012, "totalSubmissionRaw": 82919}, "2657": {"acRate": 80.98359990257367, "difficulty": "Medium", "likes": 458, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39899, "totalSubmissionRaw": 49268}, "2658": {"acRate": 59.63775654970207, "difficulty": "Medium", "likes": 424, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2658", "paidOnly": false, "title": "Maximum Number of Fish in a Grid", "titleSlug": "maximum-number-of-fish-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25222, "totalSubmissionRaw": 42292}, "2659": {"acRate": 25.22619192781368, "difficulty": "Hard", "likes": 528, "dislikes": 31, "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": 10344, "totalSubmissionRaw": 41005}, "2660": {"acRate": 33.81788958627916, "difficulty": "Easy", "likes": 231, "dislikes": 136, "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": 33244, "totalSubmissionRaw": 98303}, "2661": {"acRate": 50.28873597805163, "difficulty": "Medium", "likes": 422, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2661", "paidOnly": false, "title": "First Completely Painted Row or Column", "titleSlug": "first-completely-painted-row-or-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22729, "totalSubmissionRaw": 45197}, "2662": {"acRate": 38.35199950361431, "difficulty": "Medium", "likes": 537, "dislikes": 78, "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": 12362, "totalSubmissionRaw": 32233}, "2663": {"acRate": 36.57484486151052, "difficulty": "Hard", "likes": 185, "dislikes": 17, "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": 4833, "totalSubmissionRaw": 13214}, "2664": {"acRate": 66.31631631631632, "difficulty": "Medium", "likes": 34, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2664", "paidOnly": true, "title": "The Knight\u2019s Tour", "titleSlug": "the-knights-tour", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1325, "totalSubmissionRaw": 1998}, "2665": {"acRate": 79.62209289281563, "difficulty": "Easy", "likes": 696, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177445, "totalSubmissionRaw": 222859}, "2666": {"acRate": 85.9313893972188, "difficulty": "Easy", "likes": 449, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92506, "totalSubmissionRaw": 107651}, "2667": {"acRate": 81.21569995490475, "difficulty": "Easy", "likes": 1201, "dislikes": 159, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 381808, "totalSubmissionRaw": 470115}, "2668": {"acRate": 70.81413210445469, "difficulty": "Easy", "likes": 18, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3227, "totalSubmissionRaw": 4557}, "2669": {"acRate": 71.56363636363636, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2669", "paidOnly": true, "title": "Count Artist Occurrences On Spotify Ranking List", "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2952, "totalSubmissionRaw": 4125}, "2670": {"acRate": 77.31934927907857, "difficulty": "Easy", "likes": 322, "dislikes": 30, "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": 36787, "totalSubmissionRaw": 47578}, "2671": {"acRate": 29.625425652667424, "difficulty": "Medium", "likes": 317, "dislikes": 27, "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": 21141, "totalSubmissionRaw": 71361}, "2672": {"acRate": 54.44076579818626, "difficulty": "Medium", "likes": 339, "dislikes": 93, "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": 15128, "totalSubmissionRaw": 27788}, "2673": {"acRate": 58.96334802425886, "difficulty": "Medium", "likes": 577, "dislikes": 10, "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": 15653, "totalSubmissionRaw": 26547}, "2674": {"acRate": 73.03811659192824, "difficulty": "Medium", "likes": 37, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1303, "totalSubmissionRaw": 1784}, "2675": {"acRate": 69.27725118483411, "difficulty": "Hard", "likes": 132, "dislikes": 72, "categoryTitle": "JavaScript", "frontendQuestionId": "2675", "paidOnly": true, "title": "Array of Objects to Matrix", "titleSlug": "array-of-objects-to-matrix", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5847, "totalSubmissionRaw": 8440}, "2676": {"acRate": 82.67745494667157, "difficulty": "Medium", "likes": 159, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8992, "totalSubmissionRaw": 10876}, "2677": {"acRate": 83.01071975497703, "difficulty": "Easy", "likes": 319, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54206, "totalSubmissionRaw": 65300}, "2678": {"acRate": 76.50247624146701, "difficulty": "Easy", "likes": 287, "dislikes": 19, "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": 57154, "totalSubmissionRaw": 74709}, "2679": {"acRate": 59.61152536131824, "difficulty": "Medium", "likes": 336, "dislikes": 57, "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": 32378, "totalSubmissionRaw": 54315}, "2680": {"acRate": 40.63702108016618, "difficulty": "Medium", "likes": 380, "dislikes": 44, "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": 13205, "totalSubmissionRaw": 32495}, "2681": {"acRate": 30.52883768452947, "difficulty": "Hard", "likes": 307, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8665, "totalSubmissionRaw": 28383}, "2682": {"acRate": 48.800646512140474, "difficulty": "Easy", "likes": 240, "dislikes": 36, "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": 26570, "totalSubmissionRaw": 54446}, "2683": {"acRate": 61.54839820874957, "difficulty": "Medium", "likes": 269, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21441, "totalSubmissionRaw": 34836}, "2684": {"acRate": 45.679205137714966, "difficulty": "Medium", "likes": 422, "dislikes": 6, "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": 23401, "totalSubmissionRaw": 51229}, "2685": {"acRate": 65.3197362367735, "difficulty": "Medium", "likes": 630, "dislikes": 15, "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": 25557, "totalSubmissionRaw": 39126}, "2686": {"acRate": 65.70370370370371, "difficulty": "Medium", "likes": 12, "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": 2661, "totalSubmissionRaw": 4050}, "2687": {"acRate": 80.35530381050464, "difficulty": "Easy", "likes": 20, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3121, "totalSubmissionRaw": 3884}, "2688": {"acRate": 41.22578779994218, "difficulty": "Medium", "likes": 19, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2852, "totalSubmissionRaw": 6918}, "2689": {"acRate": 74.05119152691968, "difficulty": "Easy", "likes": 33, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2517, "totalSubmissionRaw": 3399}, "2690": {"acRate": 92.62023217247098, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1117, "totalSubmissionRaw": 1206}, "2691": {"acRate": 39.24611973392461, "difficulty": "Hard", "likes": 10, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 177, "totalSubmissionRaw": 451}, "2692": {"acRate": 63.97849462365591, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357, "totalSubmissionRaw": 558}, "2693": {"acRate": 80.28794734677088, "difficulty": "Medium", "likes": 138, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9759, "totalSubmissionRaw": 12155}, "2694": {"acRate": 74.70512033817414, "difficulty": "Medium", "likes": 224, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21914, "totalSubmissionRaw": 29334}, "2695": {"acRate": 87.72437606316805, "difficulty": "Easy", "likes": 221, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34552, "totalSubmissionRaw": 39387}, "2696": {"acRate": 69.47494102915053, "difficulty": "Easy", "likes": 397, "dislikes": 9, "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": 47714, "totalSubmissionRaw": 68678}, "2697": {"acRate": 81.52457572181314, "difficulty": "Easy", "likes": 337, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49046, "totalSubmissionRaw": 60161}, "2698": {"acRate": 62.204825875455036, "difficulty": "Medium", "likes": 468, "dislikes": 29, "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": 19309, "totalSubmissionRaw": 31041}, "2699": {"acRate": 24.025974025974026, "difficulty": "Hard", "likes": 269, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2699", "paidOnly": false, "title": "Modify Graph Edge Weights", "titleSlug": "modify-graph-edge-weights", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4736, "totalSubmissionRaw": 19712}, "2700": {"acRate": 77.13909609477841, "difficulty": "Medium", "likes": 145, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7032, "totalSubmissionRaw": 9116}, "2701": {"acRate": 31.24734532068526, "difficulty": "Hard", "likes": 38, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2701", "paidOnly": true, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2207, "totalSubmissionRaw": 7063}, "2702": {"acRate": 52.131147540983605, "difficulty": "Hard", "likes": 36, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 954, "totalSubmissionRaw": 1830}, "2703": {"acRate": 94.101125618442, "difficulty": "Easy", "likes": 285, "dislikes": 144, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130665, "totalSubmissionRaw": 138856}, "2704": {"acRate": 61.92860537918149, "difficulty": "Easy", "likes": 594, "dislikes": 144, "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": 151138, "totalSubmissionRaw": 244052}, "2705": {"acRate": 64.05586518046708, "difficulty": "Medium", "likes": 162, "dislikes": 18, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19309, "totalSubmissionRaw": 30144}, "2706": {"acRate": 69.33164741298654, "difficulty": "Easy", "likes": 969, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177107, "totalSubmissionRaw": 255449}, "2707": {"acRate": 52.54750366835596, "difficulty": "Medium", "likes": 2058, "dislikes": 93, "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": 85231, "totalSubmissionRaw": 162198}, "2708": {"acRate": 24.006597557839477, "difficulty": "Medium", "likes": 347, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27072, "totalSubmissionRaw": 112769}, "2709": {"acRate": 42.68000345982281, "difficulty": "Hard", "likes": 802, "dislikes": 132, "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": 69081, "totalSubmissionRaw": 161858}, "2710": {"acRate": 78.48837209302324, "difficulty": "Easy", "likes": 302, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2710", "paidOnly": false, "title": "Remove Trailing Zeros From a String", "titleSlug": "remove-trailing-zeros-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61290, "totalSubmissionRaw": 78088}, "2711": {"acRate": 70.89939250259297, "difficulty": "Medium", "likes": 121, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19140, "totalSubmissionRaw": 26996}, "2712": {"acRate": 54.14794487500377, "difficulty": "Medium", "likes": 523, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2712", "paidOnly": false, "title": "Minimum Cost to Make All Characters Equal", "titleSlug": "minimum-cost-to-make-all-characters-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17955, "totalSubmissionRaw": 33160}, "2713": {"acRate": 30.392832529290143, "difficulty": "Hard", "likes": 559, "dislikes": 19, "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": 12348, "totalSubmissionRaw": 40628}, "2714": {"acRate": 60.69578090303479, "difficulty": "Hard", "likes": 28, "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": 820, "totalSubmissionRaw": 1351}, "2715": {"acRate": 88.33634527479536, "difficulty": "Easy", "likes": 203, "dislikes": 264, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41549, "totalSubmissionRaw": 47035}, "2716": {"acRate": 75.48416757657606, "difficulty": "Easy", "likes": 274, "dislikes": 86, "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": 52540, "totalSubmissionRaw": 69604}, "2717": {"acRate": 63.50602938410416, "difficulty": "Easy", "likes": 206, "dislikes": 15, "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": 30387, "totalSubmissionRaw": 47849}, "2718": {"acRate": 30.68317779373056, "difficulty": "Medium", "likes": 685, "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": 20516, "totalSubmissionRaw": 66864}, "2719": {"acRate": 34.33587237242146, "difficulty": "Hard", "likes": 513, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2719", "paidOnly": false, "title": "Count of Integers", "titleSlug": "count-of-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10503, "totalSubmissionRaw": 30587}, "2720": {"acRate": 49.5712924738012, "difficulty": "Hard", "likes": 12, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1561, "totalSubmissionRaw": 3149}, "2721": {"acRate": 74.205324241485, "difficulty": "Medium", "likes": 175, "dislikes": 43, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21547, "totalSubmissionRaw": 29037}, "2722": {"acRate": 54.00993158713583, "difficulty": "Medium", "likes": 148, "dislikes": 52, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25342, "totalSubmissionRaw": 46921}, "2723": {"acRate": 91.05346927477395, "difficulty": "Easy", "likes": 248, "dislikes": 24, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78947, "totalSubmissionRaw": 86704}, "2724": {"acRate": 82.02741457249793, "difficulty": "Easy", "likes": 153, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33751, "totalSubmissionRaw": 41146}, "2725": {"acRate": 79.24031590823618, "difficulty": "Easy", "likes": 142, "dislikes": 82, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33712, "totalSubmissionRaw": 42544}, "2726": {"acRate": 74.67932272960492, "difficulty": "Easy", "likes": 102, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23288, "totalSubmissionRaw": 31184}, "2727": {"acRate": 79.48331442898932, "difficulty": "Easy", "likes": 159, "dislikes": 10, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53257, "totalSubmissionRaw": 67004}, "2728": {"acRate": 84.38464931627702, "difficulty": "Easy", "likes": 49, "dislikes": 8, "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": 1913, "totalSubmissionRaw": 2267}, "2729": {"acRate": 51.85966955382489, "difficulty": "Easy", "likes": 227, "dislikes": 12, "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": 42750, "totalSubmissionRaw": 82434}, "2730": {"acRate": 36.32699964393228, "difficulty": "Medium", "likes": 279, "dislikes": 83, "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": 22445, "totalSubmissionRaw": 61786}, "2731": {"acRate": 27.815071459506278, "difficulty": "Medium", "likes": 478, "dislikes": 91, "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": 12845, "totalSubmissionRaw": 46180}, "2732": {"acRate": 45.03124785385619, "difficulty": "Hard", "likes": 205, "dislikes": 25, "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": 6557, "totalSubmissionRaw": 14561}, "2733": {"acRate": 76.54505686789152, "difficulty": "Easy", "likes": 336, "dislikes": 15, "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": 87491, "totalSubmissionRaw": 114300}, "2734": {"acRate": 30.454837391253577, "difficulty": "Medium", "likes": 232, "dislikes": 183, "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": 26080, "totalSubmissionRaw": 85635}, "2735": {"acRate": 33.065745935836574, "difficulty": "Medium", "likes": 281, "dislikes": 533, "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": 11492, "totalSubmissionRaw": 34755}, "2736": {"acRate": 28.8468809073724, "difficulty": "Hard", "likes": 322, "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": 5341, "totalSubmissionRaw": 18515}, "2737": {"acRate": 55.590427618673985, "difficulty": "Medium", "likes": 33, "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": 1417, "totalSubmissionRaw": 2549}, "2738": {"acRate": 55.87331284244287, "difficulty": "Medium", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4180, "totalSubmissionRaw": 7482}, "2739": {"acRate": 39.04766377083823, "difficulty": "Easy", "likes": 276, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41576, "totalSubmissionRaw": 106475}, "2740": {"acRate": 65.0644925772694, "difficulty": "Medium", "likes": 275, "dislikes": 18, "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": 32082, "totalSubmissionRaw": 49308}, "2741": {"acRate": 28.075612659578837, "difficulty": "Medium", "likes": 546, "dislikes": 60, "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": 13679, "totalSubmissionRaw": 48722}, "2742": {"acRate": 50.93964129405959, "difficulty": "Hard", "likes": 1348, "dislikes": 78, "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": 62967, "totalSubmissionRaw": 123611}, "2743": {"acRate": 70.80459770114943, "difficulty": "Medium", "likes": 50, "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": 1848, "totalSubmissionRaw": 2610}, "2744": {"acRate": 81.08963788668294, "difficulty": "Easy", "likes": 337, "dislikes": 13, "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": 61470, "totalSubmissionRaw": 75805}, "2745": {"acRate": 53.49191568610853, "difficulty": "Medium", "likes": 296, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2745", "paidOnly": false, "title": "Construct the Longest New String", "titleSlug": "construct-the-longest-new-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18957, "totalSubmissionRaw": 35439}, "2746": {"acRate": 26.446280991735538, "difficulty": "Medium", "likes": 353, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7872, "totalSubmissionRaw": 29766}, "2747": {"acRate": 32.49651324965133, "difficulty": "Medium", "likes": 330, "dislikes": 37, "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": 5825, "totalSubmissionRaw": 17925}, "2748": {"acRate": 49.876636076425456, "difficulty": "Easy", "likes": 201, "dislikes": 35, "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": 33153, "totalSubmissionRaw": 66470}, "2749": {"acRate": 29.418211120064463, "difficulty": "Medium", "likes": 276, "dislikes": 285, "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": 9127, "totalSubmissionRaw": 31025}, "2750": {"acRate": 33.739196788480996, "difficulty": "Medium", "likes": 420, "dislikes": 12, "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": 20339, "totalSubmissionRaw": 60283}, "2751": {"acRate": 40.51673269830566, "difficulty": "Hard", "likes": 407, "dislikes": 17, "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": 9613, "totalSubmissionRaw": 23726}, "2752": {"acRate": 36.787709497206706, "difficulty": "Hard", "likes": 11, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2752", "paidOnly": true, "title": "Customers with Maximum Number of Transactions on Consecutive Days", "titleSlug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1317, "totalSubmissionRaw": 3580}, "2753": {"acRate": 70.16042780748664, "difficulty": "Hard", "likes": 27, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2753", "paidOnly": true, "title": "Count Houses in a Circular Street II", "titleSlug": "count-houses-in-a-circular-street-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 656, "totalSubmissionRaw": 935}, "2754": {"acRate": 86.79549114331722, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 539, "totalSubmissionRaw": 621}, "2755": {"acRate": 64.48087431693989, "difficulty": "Medium", "likes": 14, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472, "totalSubmissionRaw": 732}, "2756": {"acRate": 61.915887850467286, "difficulty": "Hard", "likes": 12, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 265, "totalSubmissionRaw": 428}, "2757": {"acRate": 71.45708582834331, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358, "totalSubmissionRaw": 501}, "2758": {"acRate": 86.6734486266531, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 852, "totalSubmissionRaw": 983}, "2759": {"acRate": 64.64968152866241, "difficulty": "Hard", "likes": 15, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 406, "totalSubmissionRaw": 628}, "2760": {"acRate": 29.471876267660946, "difficulty": "Easy", "likes": 283, "dislikes": 264, "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": 34147, "totalSubmissionRaw": 115863}, "2761": {"acRate": 33.81213628628212, "difficulty": "Medium", "likes": 354, "dislikes": 32, "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": 28412, "totalSubmissionRaw": 84029}, "2762": {"acRate": 40.817299358641016, "difficulty": "Medium", "likes": 671, "dislikes": 21, "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": 18838, "totalSubmissionRaw": 46152}, "2763": {"acRate": 46.13603654339528, "difficulty": "Hard", "likes": 297, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2763", "paidOnly": false, "title": "Sum of Imbalance Numbers of All Subarrays", "titleSlug": "sum-of-imbalance-numbers-of-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7373, "totalSubmissionRaw": 15981}, "2764": {"acRate": 66.77785190126751, "difficulty": "Medium", "likes": 30, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1001, "totalSubmissionRaw": 1499}, "2765": {"acRate": 33.907012586694066, "difficulty": "Easy", "likes": 207, "dislikes": 172, "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": 23760, "totalSubmissionRaw": 70074}, "2766": {"acRate": 51.490472048707204, "difficulty": "Medium", "likes": 189, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19536, "totalSubmissionRaw": 37941}, "2767": {"acRate": 52.899962404730175, "difficulty": "Medium", "likes": 342, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15478, "totalSubmissionRaw": 29259}, "2768": {"acRate": 36.07445805843544, "difficulty": "Medium", "likes": 224, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7654, "totalSubmissionRaw": 21218}, "2769": {"acRate": 90.04301544194898, "difficulty": "Easy", "likes": 317, "dislikes": 430, "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": 90847, "totalSubmissionRaw": 100893}, "2770": {"acRate": 30.604265402843602, "difficulty": "Medium", "likes": 410, "dislikes": 14, "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": 25830, "totalSubmissionRaw": 84400}, "2771": {"acRate": 29.04802192112939, "difficulty": "Medium", "likes": 575, "dislikes": 17, "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": 23004, "totalSubmissionRaw": 79193}, "2772": {"acRate": 32.608636351237074, "difficulty": "Medium", "likes": 362, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11954, "totalSubmissionRaw": 36659}, "2773": {"acRate": 73.35490830636462, "difficulty": "Medium", "likes": 9, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 680, "totalSubmissionRaw": 927}, "2774": {"acRate": 81.24165554072096, "difficulty": "Easy", "likes": 20, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1217, "totalSubmissionRaw": 1498}, "2775": {"acRate": 67.78975741239893, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503, "totalSubmissionRaw": 742}, "2776": {"acRate": 91.71597633136095, "difficulty": "Medium", "likes": 16, "dislikes": 7, "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": 620, "totalSubmissionRaw": 676}, "2777": {"acRate": 81.71296296296296, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353, "totalSubmissionRaw": 432}, "2778": {"acRate": 80.70793512516335, "difficulty": "Easy", "likes": 256, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2778", "paidOnly": false, "title": "Sum of Squares of Special Elements ", "titleSlug": "sum-of-squares-of-special-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62998, "totalSubmissionRaw": 78057}, "2779": {"acRate": 37.811490985493364, "difficulty": "Medium", "likes": 595, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2779", "paidOnly": false, "title": "Maximum Beauty of an Array After Applying Operation", "titleSlug": "maximum-beauty-of-an-array-after-applying-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24475, "totalSubmissionRaw": 64729}, "2780": {"acRate": 61.98228846050002, "difficulty": "Medium", "likes": 326, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22957, "totalSubmissionRaw": 37038}, "2781": {"acRate": 37.0233139050791, "difficulty": "Hard", "likes": 534, "dislikes": 20, "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": 26677, "totalSubmissionRaw": 72054}, "2782": {"acRate": 83.42541436464089, "difficulty": "Medium", "likes": 31, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1963, "totalSubmissionRaw": 2353}, "2783": {"acRate": 36.8269556383339, "difficulty": "Medium", "likes": 15, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2175, "totalSubmissionRaw": 5906}, "2784": {"acRate": 49.428037148856596, "difficulty": "Easy", "likes": 263, "dislikes": 49, "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": 47314, "totalSubmissionRaw": 95723}, "2785": {"acRate": 81.40380898057484, "difficulty": "Medium", "likes": 969, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128443, "totalSubmissionRaw": 157785}, "2786": {"acRate": 35.76801191248902, "difficulty": "Medium", "likes": 468, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18736, "totalSubmissionRaw": 52382}, "2787": {"acRate": 33.59363239500226, "difficulty": "Medium", "likes": 388, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2787", "paidOnly": false, "title": "Ways to Express an Integer as Sum of Powers", "titleSlug": "ways-to-express-an-integer-as-sum-of-powers", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17853, "totalSubmissionRaw": 53144}, "2788": {"acRate": 73.86980756279642, "difficulty": "Easy", "likes": 303, "dislikes": 7, "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": 51553, "totalSubmissionRaw": 69789}, "2789": {"acRate": 46.943520007643194, "difficulty": "Medium", "likes": 456, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29481, "totalSubmissionRaw": 62801}, "2790": {"acRate": 19.722657123685977, "difficulty": "Hard", "likes": 394, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8818, "totalSubmissionRaw": 44710}, "2791": {"acRate": 47.52129817444219, "difficulty": "Hard", "likes": 369, "dislikes": 9, "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": 5857, "totalSubmissionRaw": 12325}, "2792": {"acRate": 58.63219349457881, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 703, "totalSubmissionRaw": 1199}, "2793": {"acRate": 73.69956246961594, "difficulty": "Hard", "likes": 8, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1516, "totalSubmissionRaw": 2057}, "2794": {"acRate": 63.351877607788595, "difficulty": "Easy", "likes": 9, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2794", "paidOnly": true, "title": "Create Object from Two Arrays", "titleSlug": "create-object-from-two-arrays", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 911, "totalSubmissionRaw": 1438}, "2795": {"acRate": 88.2747068676717, "difficulty": "Medium", "likes": 13, "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": 527, "totalSubmissionRaw": 597}, "2796": {"acRate": 92.68836379848418, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2079, "totalSubmissionRaw": 2243}, "2797": {"acRate": 91.82839632277835, "difficulty": "Easy", "likes": 10, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 899, "totalSubmissionRaw": 979}, "2798": {"acRate": 87.6597510373444, "difficulty": "Easy", "likes": 465, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147877, "totalSubmissionRaw": 168695}, "2799": {"acRate": 64.69756105874934, "difficulty": "Medium", "likes": 540, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2799", "paidOnly": false, "title": "Count Complete Subarrays in an Array", "titleSlug": "count-complete-subarrays-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37960, "totalSubmissionRaw": 58673}, "2800": {"acRate": 30.287837324970535, "difficulty": "Medium", "likes": 316, "dislikes": 258, "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": 15163, "totalSubmissionRaw": 50063}, "2801": {"acRate": 27.537566293459044, "difficulty": "Hard", "likes": 327, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7477, "totalSubmissionRaw": 27152}, "2802": {"acRate": 78.70653936227707, "difficulty": "Medium", "likes": 53, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4369, "totalSubmissionRaw": 5551}, "2803": {"acRate": 86.14393125671322, "difficulty": "Easy", "likes": 17, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 802, "totalSubmissionRaw": 931}, "2804": {"acRate": 88.77551020408163, "difficulty": "Easy", "likes": 8, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783, "totalSubmissionRaw": 882}, "2805": {"acRate": 81.3304721030043, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 379, "totalSubmissionRaw": 466}, "2806": {"acRate": 52.13786417674371, "difficulty": "Easy", "likes": 194, "dislikes": 43, "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": 40873, "totalSubmissionRaw": 78395}, "2807": {"acRate": 88.45197683076108, "difficulty": "Medium", "likes": 508, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70091, "totalSubmissionRaw": 79242}, "2808": {"acRate": 26.582032286012343, "difficulty": "Medium", "likes": 508, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15034, "totalSubmissionRaw": 56557}, "2809": {"acRate": 25.407532321528947, "difficulty": "Hard", "likes": 224, "dislikes": 12, "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": 3616, "totalSubmissionRaw": 14232}, "2810": {"acRate": 83.40941786834921, "difficulty": "Easy", "likes": 415, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2810", "paidOnly": false, "title": "Faulty Keyboard", "titleSlug": "faulty-keyboard", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73633, "totalSubmissionRaw": 88279}, "2811": {"acRate": 33.55160108819823, "difficulty": "Medium", "likes": 450, "dislikes": 89, "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": 28488, "totalSubmissionRaw": 84909}, "2812": {"acRate": 49.11369409256308, "difficulty": "Medium", "likes": 1528, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "2812", "paidOnly": false, "title": "Find the Safest Path in a Grid", "titleSlug": "find-the-safest-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90297, "totalSubmissionRaw": 183853}, "2813": {"acRate": 31.880332531174798, "difficulty": "Hard", "likes": 288, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5829, "totalSubmissionRaw": 18284}, "2814": {"acRate": 62.90706910246227, "difficulty": "Hard", "likes": 19, "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": 792, "totalSubmissionRaw": 1259}, "2815": {"acRate": 57.648894191061764, "difficulty": "Easy", "likes": 322, "dislikes": 117, "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": 43974, "totalSubmissionRaw": 76279}, "2816": {"acRate": 61.637515572437074, "difficulty": "Medium", "likes": 1107, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161788, "totalSubmissionRaw": 262483}, "2817": {"acRate": 33.52748797232283, "difficulty": "Medium", "likes": 660, "dislikes": 69, "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": 24809, "totalSubmissionRaw": 73996}, "2818": {"acRate": 32.60750954813749, "difficulty": "Hard", "likes": 319, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6574, "totalSubmissionRaw": 20161}, "2819": {"acRate": 52.13549337260678, "difficulty": "Hard", "likes": 15, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 354, "totalSubmissionRaw": 679}, "2820": {"acRate": 65.13859275053305, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1832, "totalSubmissionRaw": 2813}, "2821": {"acRate": 64.8491879350348, "difficulty": "Medium", "likes": 16, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2821", "paidOnly": true, "title": "Delay the Resolution of Each Promise", "titleSlug": "delay-the-resolution-of-each-promise", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 559, "totalSubmissionRaw": 862}, "2822": {"acRate": 59.13978494623656, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 715, "totalSubmissionRaw": 1209}, "2823": {"acRate": 55.932203389830505, "difficulty": "Medium", "likes": 13, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 330, "totalSubmissionRaw": 590}, "2824": {"acRate": 87.13466283417699, "difficulty": "Easy", "likes": 542, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2824", "paidOnly": false, "title": "Count Pairs Whose Sum is Less than Target", "titleSlug": "count-pairs-whose-sum-is-less-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 137022, "totalSubmissionRaw": 157253}, "2825": {"acRate": 49.032907026871676, "difficulty": "Medium", "likes": 316, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2825", "paidOnly": false, "title": "Make String a Subsequence Using Cyclic Increments", "titleSlug": "make-string-a-subsequence-using-cyclic-increments", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34122, "totalSubmissionRaw": 69590}, "2826": {"acRate": 42.019947367257124, "difficulty": "Medium", "likes": 488, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19001, "totalSubmissionRaw": 45219}, "2827": {"acRate": 17.68844017353931, "difficulty": "Hard", "likes": 345, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2827", "paidOnly": false, "title": "Number of Beautiful Integers in the Range", "titleSlug": "number-of-beautiful-integers-in-the-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8725, "totalSubmissionRaw": 49326}, "2828": {"acRate": 82.9883843717001, "difficulty": "Easy", "likes": 305, "dislikes": 10, "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": 86449, "totalSubmissionRaw": 104170}, "2829": {"acRate": 61.12649216165684, "difficulty": "Medium", "likes": 324, "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": 34001, "totalSubmissionRaw": 55624}, "2830": {"acRate": 36.030802021382655, "difficulty": "Medium", "likes": 648, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2830", "paidOnly": false, "title": "Maximize the Profit as the Salesman", "titleSlug": "maximize-the-profit-as-the-salesman", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20962, "totalSubmissionRaw": 58178}, "2831": {"acRate": 35.550573456115316, "difficulty": "Medium", "likes": 656, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19187, "totalSubmissionRaw": 53971}, "2832": {"acRate": 73.56608478802993, "difficulty": "Medium", "likes": 35, "dislikes": 1, "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": 1180, "totalSubmissionRaw": 1604}, "2833": {"acRate": 64.42233587893224, "difficulty": "Easy", "likes": 232, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45975, "totalSubmissionRaw": 71365}, "2834": {"acRate": 38.78812967322967, "difficulty": "Medium", "likes": 291, "dislikes": 48, "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": 29984, "totalSubmissionRaw": 77302}, "2835": {"acRate": 32.16723549488055, "difficulty": "Hard", "likes": 516, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "2835", "paidOnly": false, "title": "Minimum Operations to Form Subsequence With Target Sum", "titleSlug": "minimum-operations-to-form-subsequence-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11687, "totalSubmissionRaw": 36332}, "2836": {"acRate": 30.495726495726494, "difficulty": "Hard", "likes": 285, "dislikes": 91, "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": 4460, "totalSubmissionRaw": 14625}, "2837": {"acRate": 74.01649746192894, "difficulty": "Easy", "likes": 14, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2333, "totalSubmissionRaw": 3152}, "2838": {"acRate": 68.76528117359413, "difficulty": "Medium", "likes": 29, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1125, "totalSubmissionRaw": 1636}, "2839": {"acRate": 46.91914676203858, "difficulty": "Easy", "likes": 177, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36733, "totalSubmissionRaw": 78290}, "2840": {"acRate": 55.5491576029004, "difficulty": "Medium", "likes": 249, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26047, "totalSubmissionRaw": 46890}, "2841": {"acRate": 37.760785424336824, "difficulty": "Medium", "likes": 268, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2841", "paidOnly": false, "title": "Maximum Sum of Almost Unique Subarray", "titleSlug": "maximum-sum-of-almost-unique-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24000, "totalSubmissionRaw": 63558}, "2842": {"acRate": 29.17663136317048, "difficulty": "Hard", "likes": 322, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2842", "paidOnly": false, "title": "Count K-Subsequences of a String With Maximum Beauty", "titleSlug": "count-k-subsequences-of-a-string-with-maximum-beauty", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11956, "totalSubmissionRaw": 40978}, "2843": {"acRate": 74.1936030358474, "difficulty": "Easy", "likes": 247, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43795, "totalSubmissionRaw": 59028}, "2844": {"acRate": 37.97869929753003, "difficulty": "Medium", "likes": 340, "dislikes": 51, "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": 25140, "totalSubmissionRaw": 66195}, "2845": {"acRate": 34.838979506482644, "difficulty": "Medium", "likes": 484, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13328, "totalSubmissionRaw": 38256}, "2846": {"acRate": 43.8925855513308, "difficulty": "Hard", "likes": 285, "dislikes": 6, "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": 5541, "totalSubmissionRaw": 12624}, "2847": {"acRate": 43.521946060285565, "difficulty": "Medium", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2847", "paidOnly": true, "title": "Smallest Number With Given Digit Product", "titleSlug": "smallest-number-with-given-digit-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 823, "totalSubmissionRaw": 1891}, "2848": {"acRate": 75.03900673903662, "difficulty": "Easy", "likes": 262, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45208, "totalSubmissionRaw": 60246}, "2849": {"acRate": 35.69468586358816, "difficulty": "Medium", "likes": 812, "dislikes": 754, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97953, "totalSubmissionRaw": 274419}, "2850": {"acRate": 43.91853429191879, "difficulty": "Medium", "likes": 486, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2850", "paidOnly": false, "title": "Minimum Moves to Spread Stones Over Grid", "titleSlug": "minimum-moves-to-spread-stones-over-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20831, "totalSubmissionRaw": 47431}, "2851": {"acRate": 29.0327895864228, "difficulty": "Hard", "likes": 160, "dislikes": 29, "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": 3524, "totalSubmissionRaw": 12138}, "2852": {"acRate": 65.125, "difficulty": "Medium", "likes": 27, "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": 1042, "totalSubmissionRaw": 1600}, "2853": {"acRate": 73.6888888888889, "difficulty": "Easy", "likes": 14, "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": 2487, "totalSubmissionRaw": 3375}, "2854": {"acRate": 65.4225352112676, "difficulty": "Medium", "likes": 14, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1858, "totalSubmissionRaw": 2840}, "2855": {"acRate": 57.78522775649212, "difficulty": "Easy", "likes": 205, "dislikes": 8, "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": 32577, "totalSubmissionRaw": 56376}, "2856": {"acRate": 21.588465150092386, "difficulty": "Medium", "likes": 327, "dislikes": 92, "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": 21381, "totalSubmissionRaw": 99039}, "2857": {"acRate": 32.046845065199925, "difficulty": "Medium", "likes": 261, "dislikes": 38, "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": 10371, "totalSubmissionRaw": 32362}, "2858": {"acRate": 58.58034321372855, "difficulty": "Hard", "likes": 281, "dislikes": 3, "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": 7510, "totalSubmissionRaw": 12820}, "2859": {"acRate": 86.4159105296476, "difficulty": "Easy", "likes": 248, "dislikes": 37, "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": 65524, "totalSubmissionRaw": 75824}, "2860": {"acRate": 51.9620610855837, "difficulty": "Medium", "likes": 157, "dislikes": 288, "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": 21147, "totalSubmissionRaw": 40697}, "2861": {"acRate": 38.22300726161438, "difficulty": "Medium", "likes": 265, "dislikes": 43, "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": 13632, "totalSubmissionRaw": 35666}, "2862": {"acRate": 43.6080740117746, "difficulty": "Hard", "likes": 183, "dislikes": 45, "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": 7259, "totalSubmissionRaw": 16646}, "2863": {"acRate": 71.3713140566848, "difficulty": "Medium", "likes": 104, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2863", "paidOnly": true, "title": "Maximum Length of Semi-Decreasing Subarrays", "titleSlug": "maximum-length-of-semi-decreasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9972, "totalSubmissionRaw": 13971}, "2864": {"acRate": 83.05069367333624, "difficulty": "Easy", "likes": 751, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2864", "paidOnly": false, "title": "Maximum Odd Binary Number", "titleSlug": "maximum-odd-binary-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192220, "totalSubmissionRaw": 231449}, "2865": {"acRate": 43.47842629936839, "difficulty": "Medium", "likes": 225, "dislikes": 40, "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": 22852, "totalSubmissionRaw": 52562}, "2866": {"acRate": 34.53817478945189, "difficulty": "Medium", "likes": 388, "dislikes": 24, "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": 12508, "totalSubmissionRaw": 36215}, "2867": {"acRate": 34.76921384166804, "difficulty": "Hard", "likes": 238, "dislikes": 6, "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": 6320, "totalSubmissionRaw": 18177}, "2868": {"acRate": 61.34699853587116, "difficulty": "Hard", "likes": 9, "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": 419, "totalSubmissionRaw": 683}, "2869": {"acRate": 59.84782075107823, "difficulty": "Easy", "likes": 163, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34136, "totalSubmissionRaw": 57038}, "2870": {"acRate": 61.929095233725995, "difficulty": "Medium", "likes": 1358, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175486, "totalSubmissionRaw": 283366}, "2871": {"acRate": 43.791323755056496, "difficulty": "Medium", "likes": 216, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2871", "paidOnly": false, "title": "Split Array Into Maximum Number of Subarrays", "titleSlug": "split-array-into-maximum-number-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15697, "totalSubmissionRaw": 35845}, "2872": {"acRate": 58.16047412810577, "difficulty": "Hard", "likes": 181, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10206, "totalSubmissionRaw": 17548}, "2873": {"acRate": 45.43922742247818, "difficulty": "Easy", "likes": 157, "dislikes": 15, "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": 36136, "totalSubmissionRaw": 79526}, "2874": {"acRate": 41.309634562339845, "difficulty": "Medium", "likes": 267, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2874", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet II", "titleSlug": "maximum-value-of-an-ordered-triplet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25310, "totalSubmissionRaw": 61269}, "2875": {"acRate": 30.760454387618434, "difficulty": "Medium", "likes": 359, "dislikes": 24, "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": 18603, "totalSubmissionRaw": 60477}, "2876": {"acRate": 32.650573856518946, "difficulty": "Hard", "likes": 303, "dislikes": 5, "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": 9644, "totalSubmissionRaw": 29537}, "2877": {"acRate": 81.14627820355311, "difficulty": "Easy", "likes": 155, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83221, "totalSubmissionRaw": 102556}, "2878": {"acRate": 84.68285476871942, "difficulty": "Easy", "likes": 80, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64204, "totalSubmissionRaw": 75817}, "2879": {"acRate": 92.5994173836461, "difficulty": "Easy", "likes": 69, "dislikes": 16, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68342, "totalSubmissionRaw": 73804}, "2880": {"acRate": 78.66247212252794, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53257, "totalSubmissionRaw": 67704}, "2881": {"acRate": 89.94097701871155, "difficulty": "Easy", "likes": 57, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50133, "totalSubmissionRaw": 55740}, "2882": {"acRate": 84.80293729562274, "difficulty": "Easy", "likes": 68, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44346, "totalSubmissionRaw": 52293}, "2883": {"acRate": 64.17729581928629, "difficulty": "Easy", "likes": 52, "dislikes": 2, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41309, "totalSubmissionRaw": 64367}, "2884": {"acRate": 91.48070175438596, "difficulty": "Easy", "likes": 54, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45625, "totalSubmissionRaw": 49874}, "2885": {"acRate": 84.81535418523268, "difficulty": "Easy", "likes": 45, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39021, "totalSubmissionRaw": 46007}, "2886": {"acRate": 86.88277249451353, "difficulty": "Easy", "likes": 51, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38005, "totalSubmissionRaw": 43743}, "2887": {"acRate": 71.74946938133795, "difficulty": "Easy", "likes": 50, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36507, "totalSubmissionRaw": 50881}, "2888": {"acRate": 90.25729230479243, "difficulty": "Easy", "likes": 48, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38305, "totalSubmissionRaw": 42440}, "2889": {"acRate": 80.16137165910237, "difficulty": "Easy", "likes": 73, "dislikes": 11, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31791, "totalSubmissionRaw": 39658}, "2890": {"acRate": 84.88601182099634, "difficulty": "Easy", "likes": 64, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30158, "totalSubmissionRaw": 35528}, "2891": {"acRate": 74.93533306438216, "difficulty": "Easy", "likes": 58, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31577, "totalSubmissionRaw": 42139}, "2892": {"acRate": 40.226460071513706, "difficulty": "Medium", "likes": 21, "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": 675, "totalSubmissionRaw": 1678}, "2893": {"acRate": 67.47685185185185, "difficulty": "Medium", "likes": 15, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1749, "totalSubmissionRaw": 2592}, "2894": {"acRate": 88.62301424468023, "difficulty": "Easy", "likes": 200, "dislikes": 15, "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": 75591, "totalSubmissionRaw": 85295}, "2895": {"acRate": 68.70570682581126, "difficulty": "Medium", "likes": 247, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2895", "paidOnly": false, "title": "Minimum Processing Time", "titleSlug": "minimum-processing-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31314, "totalSubmissionRaw": 45577}, "2896": {"acRate": 26.537762206749743, "difficulty": "Medium", "likes": 336, "dislikes": 66, "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": 11968, "totalSubmissionRaw": 45098}, "2897": {"acRate": 47.00744558991982, "difficulty": "Hard", "likes": 177, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6566, "totalSubmissionRaw": 13968}, "2898": {"acRate": 68.2051282051282, "difficulty": "Medium", "likes": 20, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 665, "totalSubmissionRaw": 975}, "2899": {"acRate": 65.86149699357247, "difficulty": "Easy", "likes": 152, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25412, "totalSubmissionRaw": 38584}, "2900": {"acRate": 63.6028659160696, "difficulty": "Easy", "likes": 167, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24856, "totalSubmissionRaw": 39080}, "2901": {"acRate": 27.129726890756302, "difficulty": "Medium", "likes": 190, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10331, "totalSubmissionRaw": 38080}, "2902": {"acRate": 20.591206337391675, "difficulty": "Hard", "likes": 135, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3873, "totalSubmissionRaw": 18809}, "2903": {"acRate": 61.981639235795214, "difficulty": "Easy", "likes": 128, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37470, "totalSubmissionRaw": 60454}, "2904": {"acRate": 38.69841823864448, "difficulty": "Medium", "likes": 172, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2904", "paidOnly": false, "title": "Shortest and Lexicographically Smallest Beautiful String", "titleSlug": "shortest-and-lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24392, "totalSubmissionRaw": 63031}, "2905": {"acRate": 32.1323215644075, "difficulty": "Medium", "likes": 251, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17319, "totalSubmissionRaw": 53899}, "2906": {"acRate": 30.82763045337896, "difficulty": "Medium", "likes": 218, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11532, "totalSubmissionRaw": 37408}, "2907": {"acRate": 57.18325791855203, "difficulty": "Medium", "likes": 18, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2907", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices I", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1011, "totalSubmissionRaw": 1768}, "2908": {"acRate": 64.63467786670893, "difficulty": "Easy", "likes": 149, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32625, "totalSubmissionRaw": 50476}, "2909": {"acRate": 53.9472433460076, "difficulty": "Medium", "likes": 184, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22701, "totalSubmissionRaw": 42080}, "2910": {"acRate": 25.124847178764583, "difficulty": "Medium", "likes": 364, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12125, "totalSubmissionRaw": 48259}, "2911": {"acRate": 35.79152459814905, "difficulty": "Hard", "likes": 119, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3674, "totalSubmissionRaw": 10265}, "2912": {"acRate": 64.96350364963503, "difficulty": "Hard", "likes": 15, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 801, "totalSubmissionRaw": 1233}, "2913": {"acRate": 82.5702337550933, "difficulty": "Easy", "likes": 137, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30802, "totalSubmissionRaw": 37304}, "2914": {"acRate": 59.56530252594479, "difficulty": "Medium", "likes": 136, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18252, "totalSubmissionRaw": 30642}, "2915": {"acRate": 34.8716589687287, "difficulty": "Medium", "likes": 198, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2915", "paidOnly": false, "title": "Length of the Longest Subsequence That Sums to Target", "titleSlug": "length-of-the-longest-subsequence-that-sums-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18422, "totalSubmissionRaw": 52828}, "2916": {"acRate": 20.237756264236904, "difficulty": "Hard", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2843, "totalSubmissionRaw": 14048}, "2917": {"acRate": 74.57038391224863, "difficulty": "Easy", "likes": 215, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24474, "totalSubmissionRaw": 32820}, "2918": {"acRate": 34.45791119629912, "difficulty": "Medium", "likes": 167, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2918", "paidOnly": false, "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "titleSlug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23910, "totalSubmissionRaw": 69389}, "2919": {"acRate": 34.08471377647306, "difficulty": "Medium", "likes": 302, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2919", "paidOnly": false, "title": "Minimum Increment Operations to Make Array Beautiful", "titleSlug": "minimum-increment-operations-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13004, "totalSubmissionRaw": 38152}, "2920": {"acRate": 37.30162914535773, "difficulty": "Hard", "likes": 192, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7075, "totalSubmissionRaw": 18967}, "2921": {"acRate": 49.47229551451187, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2921", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices II", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 375, "totalSubmissionRaw": 758}, "2922": {"acRate": 39.41429339065019, "difficulty": "Medium", "likes": 11, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1467, "totalSubmissionRaw": 3722}, "2923": {"acRate": 73.11596496781682, "difficulty": "Easy", "likes": 133, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34645, "totalSubmissionRaw": 47384}, "2924": {"acRate": 57.807081691868554, "difficulty": "Medium", "likes": 136, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24504, "totalSubmissionRaw": 42390}, "2925": {"acRate": 49.17906826269815, "difficulty": "Medium", "likes": 311, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12161, "totalSubmissionRaw": 24728}, "2926": {"acRate": 23.669899392730898, "difficulty": "Hard", "likes": 180, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2926", "paidOnly": false, "title": "Maximum Balanced Subsequence Sum", "titleSlug": "maximum-balanced-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5223, "totalSubmissionRaw": 22066}, "2927": {"acRate": 44.587155963302756, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2927", "paidOnly": true, "title": "Distribute Candies Among Children III", "titleSlug": "distribute-candies-among-children-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 486, "totalSubmissionRaw": 1090}, "2928": {"acRate": 75.40124048852228, "difficulty": "Easy", "likes": 98, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23584, "totalSubmissionRaw": 31278}, "2929": {"acRate": 34.99134173284767, "difficulty": "Medium", "likes": 88, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11720, "totalSubmissionRaw": 33494}, "2930": {"acRate": 55.740195612952235, "difficulty": "Medium", "likes": 161, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5870, "totalSubmissionRaw": 10531}, "2931": {"acRate": 65.0178343091729, "difficulty": "Hard", "likes": 84, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9661, "totalSubmissionRaw": 14859}, "2932": {"acRate": 75.96217086612388, "difficulty": "Easy", "likes": 125, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33494, "totalSubmissionRaw": 44093}, "2933": {"acRate": 43.95762293851465, "difficulty": "Medium", "likes": 189, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20497, "totalSubmissionRaw": 46629}, "2934": {"acRate": 44.743481917577796, "difficulty": "Medium", "likes": 176, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11704, "totalSubmissionRaw": 26158}, "2935": {"acRate": 29.996387842509936, "difficulty": "Hard", "likes": 160, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2935", "paidOnly": false, "title": "Maximum Strong Pair XOR II", "titleSlug": "maximum-strong-pair-xor-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5813, "totalSubmissionRaw": 19379}, "2936": {"acRate": 67.92376317923762, "difficulty": "Medium", "likes": 19, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2936", "paidOnly": true, "title": "Number of Equal Numbers Blocks", "titleSlug": "number-of-equal-numbers-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1675, "totalSubmissionRaw": 2466}, "2937": {"acRate": 42.71367348588987, "difficulty": "Easy", "likes": 285, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2937", "paidOnly": false, "title": "Make Three Strings Equal", "titleSlug": "make-three-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26412, "totalSubmissionRaw": 61835}, "2938": {"acRate": 52.95578621804634, "difficulty": "Medium", "likes": 176, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2938", "paidOnly": false, "title": "Separate Black and White Balls", "titleSlug": "separate-black-and-white-balls", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22601, "totalSubmissionRaw": 42679}, "2939": {"acRate": 25.693952370683014, "difficulty": "Medium", "likes": 189, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8340, "totalSubmissionRaw": 32459}, "2940": {"acRate": 35.211345326122945, "difficulty": "Hard", "likes": 223, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6381, "totalSubmissionRaw": 18122}, "2941": {"acRate": 47.46478873239436, "difficulty": "Hard", "likes": 12, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 337, "totalSubmissionRaw": 710}, "2942": {"acRate": 88.40903223847053, "difficulty": "Easy", "likes": 298, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2942", "paidOnly": false, "title": "Find Words Containing Character", "titleSlug": "find-words-containing-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116438, "totalSubmissionRaw": 131704}, "2943": {"acRate": 36.27292784931011, "difficulty": "Medium", "likes": 220, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11015, "totalSubmissionRaw": 30366}, "2944": {"acRate": 44.50346201270985, "difficulty": "Medium", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14076, "totalSubmissionRaw": 31629}, "2945": {"acRate": 15.823081979528594, "difficulty": "Hard", "likes": 142, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3370, "totalSubmissionRaw": 21298}, "2946": {"acRate": 57.75710538413694, "difficulty": "Easy", "likes": 96, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2946", "paidOnly": false, "title": "Matrix Similarity After Cyclic Shifts", "titleSlug": "matrix-similarity-after-cyclic-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21358, "totalSubmissionRaw": 36979}, "2947": {"acRate": 61.623509806435074, "difficulty": "Medium", "likes": 131, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19229, "totalSubmissionRaw": 31204}, "2948": {"acRate": 39.14384521917936, "difficulty": "Medium", "likes": 243, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8376, "totalSubmissionRaw": 21398}, "2949": {"acRate": 24.81382978723404, "difficulty": "Hard", "likes": 163, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4665, "totalSubmissionRaw": 18800}, "2950": {"acRate": 76.23497997329774, "difficulty": "Medium", "likes": 21, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1142, "totalSubmissionRaw": 1498}, "2951": {"acRate": 75.3429999645478, "difficulty": "Easy", "likes": 139, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42504, "totalSubmissionRaw": 56414}, "2952": {"acRate": 53.92024452658516, "difficulty": "Medium", "likes": 298, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2952", "paidOnly": false, "title": "Minimum Number of Coins to be Added", "titleSlug": "minimum-number-of-coins-to-be-added", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15171, "totalSubmissionRaw": 28136}, "2953": {"acRate": 26.50503122831367, "difficulty": "Hard", "likes": 184, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6111, "totalSubmissionRaw": 23056}, "2954": {"acRate": 36.26209977661951, "difficulty": "Hard", "likes": 71, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2922, "totalSubmissionRaw": 8058}, "2955": {"acRate": 70.49586776859505, "difficulty": "Medium", "likes": 25, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 853, "totalSubmissionRaw": 1210}, "2956": {"acRate": 82.83286397275525, "difficulty": "Easy", "likes": 158, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50591, "totalSubmissionRaw": 61076}, "2957": {"acRate": 51.97738687126164, "difficulty": "Medium", "likes": 153, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20595, "totalSubmissionRaw": 39623}, "2958": {"acRate": 55.74163057566466, "difficulty": "Medium", "likes": 991, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2958", "paidOnly": false, "title": "Length of Longest Subarray With at Most K Frequency", "titleSlug": "length-of-longest-subarray-with-at-most-k-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141062, "totalSubmissionRaw": 253063}, "2959": {"acRate": 50.65459835138193, "difficulty": "Hard", "likes": 144, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6268, "totalSubmissionRaw": 12374}, "2960": {"acRate": 80.75283782020615, "difficulty": "Easy", "likes": 132, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37135, "totalSubmissionRaw": 45986}, "2961": {"acRate": 47.551635009840886, "difficulty": "Medium", "likes": 103, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20053, "totalSubmissionRaw": 42171}, "2962": {"acRate": 59.08002432065853, "difficulty": "Medium", "likes": 1170, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2962", "paidOnly": false, "title": "Count Subarrays Where Max Element Appears at Least K Times", "titleSlug": "count-subarrays-where-max-element-appears-at-least-k-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126317, "totalSubmissionRaw": 213808}, "2963": {"acRate": 49.29240480553859, "difficulty": "Hard", "likes": 227, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9683, "totalSubmissionRaw": 19644}, "2964": {"acRate": 67.34599351551644, "difficulty": "Medium", "likes": 17, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1454, "totalSubmissionRaw": 2159}, "2965": {"acRate": 75.41949955659113, "difficulty": "Easy", "likes": 181, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43373, "totalSubmissionRaw": 57509}, "2966": {"acRate": 71.40862415033598, "difficulty": "Medium", "likes": 764, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147286, "totalSubmissionRaw": 206258}, "2967": {"acRate": 21.892124207585688, "difficulty": "Medium", "likes": 215, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12225, "totalSubmissionRaw": 55842}, "2968": {"acRate": 38.946390658174096, "difficulty": "Hard", "likes": 225, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5870, "totalSubmissionRaw": 15072}, "2969": {"acRate": 55.87002096436059, "difficulty": "Hard", "likes": 17, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 533, "totalSubmissionRaw": 954}, "2970": {"acRate": 50.85715904904933, "difficulty": "Easy", "likes": 131, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2970", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays I", "titleSlug": "count-the-number-of-incremovable-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17948, "totalSubmissionRaw": 35291}, "2971": {"acRate": 66.09115248750395, "difficulty": "Medium", "likes": 756, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2971", "paidOnly": false, "title": "Find Polygon With the Largest Perimeter", "titleSlug": "find-polygon-with-the-largest-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129844, "totalSubmissionRaw": 196462}, "2972": {"acRate": 39.02689014831786, "difficulty": "Hard", "likes": 183, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2972", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays II", "titleSlug": "count-the-number-of-incremovable-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6473, "totalSubmissionRaw": 16586}, "2973": {"acRate": 35.95924954609643, "difficulty": "Hard", "likes": 160, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7130, "totalSubmissionRaw": 19828}, "2974": {"acRate": 85.50777945341524, "difficulty": "Easy", "likes": 202, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69740, "totalSubmissionRaw": 81560}, "2975": {"acRate": 22.57457580733443, "difficulty": "Medium", "likes": 131, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13198, "totalSubmissionRaw": 58464}, "2976": {"acRate": 39.60554523367158, "difficulty": "Medium", "likes": 264, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13856, "totalSubmissionRaw": 34985}, "2977": {"acRate": 24.51678535096643, "difficulty": "Hard", "likes": 83, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2977", "paidOnly": false, "title": "Minimum Cost to Convert String II", "titleSlug": "minimum-cost-to-convert-string-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4097, "totalSubmissionRaw": 16711}, "2978": {"acRate": 42.0260374288039, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1033, "totalSubmissionRaw": 2458}, "2979": {"acRate": 77.77132907719094, "difficulty": "Medium", "likes": 13, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1340, "totalSubmissionRaw": 1723}, "2980": {"acRate": 70.13181477868275, "difficulty": "Easy", "likes": 96, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30912, "totalSubmissionRaw": 44077}, "2981": {"acRate": 42.47508269733855, "difficulty": "Medium", "likes": 150, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19646, "totalSubmissionRaw": 46253}, "2982": {"acRate": 33.59483740351765, "difficulty": "Medium", "likes": 229, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15930, "totalSubmissionRaw": 47418}, "2983": {"acRate": 25.396547191306635, "difficulty": "Hard", "likes": 81, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2898, "totalSubmissionRaw": 11411}, "2984": {"acRate": 60.187469166255546, "difficulty": "Medium", "likes": 4, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1220, "totalSubmissionRaw": 2027}, "2985": {"acRate": 86.8675995694295, "difficulty": "Easy", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1614, "totalSubmissionRaw": 1858}, "2986": {"acRate": 50.5443234836703, "difficulty": "Medium", "likes": 5, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1300, "totalSubmissionRaw": 2572}, "2987": {"acRate": 79.74742750233862, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1705, "totalSubmissionRaw": 2138}, "2988": {"acRate": 77.28205128205128, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2988", "paidOnly": true, "title": "Manager of the Largest Department", "titleSlug": "manager-of-the-largest-department", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1507, "totalSubmissionRaw": 1950}, "2989": {"acRate": 88.8992537313433, "difficulty": "Medium", "likes": 5, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1905, "totalSubmissionRaw": 2143}, "2990": {"acRate": 61.04472516217139, "difficulty": "Easy", "likes": 12, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1788, "totalSubmissionRaw": 2929}, "2991": {"acRate": 53.326122228231476, "difficulty": "Hard", "likes": 7, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 986, "totalSubmissionRaw": 1849}, "2992": {"acRate": 73.90710382513662, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2992", "paidOnly": true, "title": "Number of Self-Divisible Permutations", "titleSlug": "number-of-self-divisible-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1082, "totalSubmissionRaw": 1464}, "2993": {"acRate": 79.3978748524203, "difficulty": "Medium", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1345, "totalSubmissionRaw": 1694}, "2994": {"acRate": 73.7357259380098, "difficulty": "Hard", "likes": 9, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 904, "totalSubmissionRaw": 1226}, "2995": {"acRate": 42.86363636363637, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 943, "totalSubmissionRaw": 2200}, "2996": {"acRate": 31.862596487955035, "difficulty": "Easy", "likes": 96, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "2996", "paidOnly": false, "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "titleSlug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27326, "totalSubmissionRaw": 85762}, "2997": {"acRate": 86.53932639394262, "difficulty": "Medium", "likes": 555, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105835, "totalSubmissionRaw": 122297}, "2998": {"acRate": 45.224870578084555, "difficulty": "Medium", "likes": 218, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2998", "paidOnly": false, "title": "Minimum Number of Operations to Make X and Y Equal", "titleSlug": "minimum-number-of-operations-to-make-x-and-y-equal", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16773, "totalSubmissionRaw": 37088}, "2999": {"acRate": 26.039573820395738, "difficulty": "Hard", "likes": 102, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4277, "totalSubmissionRaw": 16425}, "3000": {"acRate": 35.646528562185395, "difficulty": "Easy", "likes": 92, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32505, "totalSubmissionRaw": 91187}, "3001": {"acRate": 20.417528112551057, "difficulty": "Medium", "likes": 143, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16196, "totalSubmissionRaw": 79324}, "3002": {"acRate": 44.91702213780864, "difficulty": "Medium", "likes": 273, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14426, "totalSubmissionRaw": 32117}, "3003": {"acRate": 27.715632800221872, "difficulty": "Hard", "likes": 98, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2998, "totalSubmissionRaw": 10817}, "3004": {"acRate": 66.31965707287202, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3004", "paidOnly": true, "title": "Maximum Subtree of the Same Color", "titleSlug": "maximum-subtree-of-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1083, "totalSubmissionRaw": 1633}, "3005": {"acRate": 79.0929301198244, "difficulty": "Easy", "likes": 605, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197094, "totalSubmissionRaw": 249193}, "3006": {"acRate": 36.10047341917197, "difficulty": "Medium", "likes": 143, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23944, "totalSubmissionRaw": 66326}, "3007": {"acRate": 35.96816976127321, "difficulty": "Medium", "likes": 267, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "3007", "paidOnly": false, "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "titleSlug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8136, "totalSubmissionRaw": 22620}, "3008": {"acRate": 23.952597254294922, "difficulty": "Hard", "likes": 154, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9439, "totalSubmissionRaw": 39407}, "3009": {"acRate": 45.7423395970882, "difficulty": "Hard", "likes": 25, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2702, "totalSubmissionRaw": 5906}, "3010": {"acRate": 65.67091295116772, "difficulty": "Easy", "likes": 82, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30931, "totalSubmissionRaw": 47100}, "3011": {"acRate": 51.09718604050787, "difficulty": "Medium", "likes": 104, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21772, "totalSubmissionRaw": 42609}, "3012": {"acRate": 35.03575350170063, "difficulty": "Medium", "likes": 152, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13082, "totalSubmissionRaw": 37339}, "3013": {"acRate": 31.705801104972377, "difficulty": "Hard", "likes": 103, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4591, "totalSubmissionRaw": 14480}, "3014": {"acRate": 63.593138730063195, "difficulty": "Easy", "likes": 105, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31698, "totalSubmissionRaw": 49845}, "3015": {"acRate": 55.22835590064072, "difficulty": "Medium", "likes": 131, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17498, "totalSubmissionRaw": 31683}, "3016": {"acRate": 70.35848880306476, "difficulty": "Medium", "likes": 133, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22590, "totalSubmissionRaw": 32107}, "3017": {"acRate": 21.060546102097348, "difficulty": "Hard", "likes": 76, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2661, "totalSubmissionRaw": 12635}, "3018": {"acRate": 44.31418522860493, "difficulty": "Hard", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3018", "paidOnly": true, "title": "Maximum Number of Removal Queries That Can Be Processed I", "titleSlug": "maximum-number-of-removal-queries-that-can-be-processed-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 378, "totalSubmissionRaw": 853}, "3019": {"acRate": 80.5175506949604, "difficulty": "Easy", "likes": 96, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44431, "totalSubmissionRaw": 55182}, "3020": {"acRate": 24.460552280964233, "difficulty": "Medium", "likes": 161, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18965, "totalSubmissionRaw": 77533}, "3021": {"acRate": 47.55986432440642, "difficulty": "Medium", "likes": 88, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18789, "totalSubmissionRaw": 39506}, "3022": {"acRate": 33.54302670623145, "difficulty": "Hard", "likes": 78, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3022", "paidOnly": false, "title": "Minimize OR of Remaining Elements Using Operations", "titleSlug": "minimize-or-of-remaining-elements-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2826, "totalSubmissionRaw": 8425}, "3023": {"acRate": 59.75395430579965, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 680, "totalSubmissionRaw": 1138}, "3024": {"acRate": 38.212745116506866, "difficulty": "Easy", "likes": 79, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3024", "paidOnly": false, "title": "Type of Triangle", "titleSlug": "type-of-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40572, "totalSubmissionRaw": 106174}, "3025": {"acRate": 40.797375100600505, "difficulty": "Medium", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13180, "totalSubmissionRaw": 32306}, "3026": {"acRate": 17.840737674239247, "difficulty": "Medium", "likes": 278, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3026", "paidOnly": false, "title": "Maximum Good Subarray Sum", "titleSlug": "maximum-good-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15730, "totalSubmissionRaw": 88168}, "3027": {"acRate": 47.98412248369719, "difficulty": "Hard", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8462, "totalSubmissionRaw": 17635}, "3028": {"acRate": 74.77879997889146, "difficulty": "Easy", "likes": 86, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42511, "totalSubmissionRaw": 56849}, "3029": {"acRate": 40.04101014461472, "difficulty": "Medium", "likes": 132, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18551, "totalSubmissionRaw": 46330}, "3030": {"acRate": 43.849609836840855, "difficulty": "Medium", "likes": 47, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9272, "totalSubmissionRaw": 21145}, "3031": {"acRate": 35.51923801692534, "difficulty": "Hard", "likes": 121, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10367, "totalSubmissionRaw": 29187}, "3032": {"acRate": 87.60429082240762, "difficulty": "Easy", "likes": 17, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2940, "totalSubmissionRaw": 3356}, "3033": {"acRate": 68.00196701467695, "difficulty": "Easy", "likes": 92, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35954, "totalSubmissionRaw": 52872}, "3034": {"acRate": 66.27212509501574, "difficulty": "Medium", "likes": 82, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24412, "totalSubmissionRaw": 36836}, "3035": {"acRate": 42.20726866782436, "difficulty": "Medium", "likes": 195, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13611, "totalSubmissionRaw": 32248}, "3036": {"acRate": 32.1124150710315, "difficulty": "Hard", "likes": 134, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3036", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern II", "titleSlug": "number-of-subarrays-that-match-a-pattern-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10398, "totalSubmissionRaw": 32380}, "3037": {"acRate": 69.92592592592592, "difficulty": "Hard", "likes": 3, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 472, "totalSubmissionRaw": 675}, "3038": {"acRate": 51.52447598722848, "difficulty": "Easy", "likes": 62, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31145, "totalSubmissionRaw": 60447}, "3039": {"acRate": 56.43900076119299, "difficulty": "Medium", "likes": 122, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24468, "totalSubmissionRaw": 43353}, "3040": {"acRate": 32.457256681237205, "difficulty": "Medium", "likes": 139, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17598, "totalSubmissionRaw": 54219}, "3041": {"acRate": 31.460776293064267, "difficulty": "Hard", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6922, "totalSubmissionRaw": 22002}, "3042": {"acRate": 64.52137722285282, "difficulty": "Easy", "likes": 90, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34106, "totalSubmissionRaw": 52860}, "3043": {"acRate": 32.99750999279208, "difficulty": "Medium", "likes": 145, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20143, "totalSubmissionRaw": 61044}, "3044": {"acRate": 47.973395673504335, "difficulty": "Medium", "likes": 80, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14570, "totalSubmissionRaw": 30371}, "3045": {"acRate": 23.718402264102398, "difficulty": "Hard", "likes": 136, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7375, "totalSubmissionRaw": 31094}, "3046": {"acRate": 57.955619747899156, "difficulty": "Easy", "likes": 87, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44139, "totalSubmissionRaw": 76160}, "3047": {"acRate": 45.01206563706563, "difficulty": "Medium", "likes": 97, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18653, "totalSubmissionRaw": 41440}, "3048": {"acRate": 35.00114652602614, "difficulty": "Medium", "likes": 161, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "3048", "paidOnly": false, "title": "Earliest Second to Mark Indices I", "titleSlug": "earliest-second-to-mark-indices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7632, "totalSubmissionRaw": 21805}, "3049": {"acRate": 22.176308539944902, "difficulty": "Hard", "likes": 72, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2093, "totalSubmissionRaw": 9438}, "3050": {"acRate": 68.39762611275965, "difficulty": "Medium", "likes": 6, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 921, "totalSubmissionRaw": 1347}, "3051": {"acRate": 73.06985294117648, "difficulty": "Easy", "likes": 10, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3051", "paidOnly": true, "title": "Find Candidates for Data Scientist Position", "titleSlug": "find-candidates-for-data-scientist-position", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1590, "totalSubmissionRaw": 2176}, "3052": {"acRate": 70.09222661396575, "difficulty": "Hard", "likes": 3, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 532, "totalSubmissionRaw": 759}, "3053": {"acRate": 50.14044943820225, "difficulty": "Easy", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3053", "paidOnly": true, "title": "Classifying Triangles by Lengths", "titleSlug": "classifying-triangles-by-lengths", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1071, "totalSubmissionRaw": 2136}, "3054": {"acRate": 78.5472972972973, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3054", "paidOnly": true, "title": "Binary Tree Nodes", "titleSlug": "binary-tree-nodes", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 930, "totalSubmissionRaw": 1184}, "3055": {"acRate": 60.05767844268205, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 833, "totalSubmissionRaw": 1387}, "3056": {"acRate": 58.83940620782726, "difficulty": "Medium", "likes": 2, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 872, "totalSubmissionRaw": 1482}, "3057": {"acRate": 68.21465428276574, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 661, "totalSubmissionRaw": 969}, "3058": {"acRate": 52.09205020920502, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 747, "totalSubmissionRaw": 1434}, "3059": {"acRate": 64.88717666483214, "difficulty": "Easy", "likes": 6, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1179, "totalSubmissionRaw": 1817}, "3060": {"acRate": 38.61264579496624, "difficulty": "Hard", "likes": 2, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 629, "totalSubmissionRaw": 1629}, "3061": {"acRate": 77.13178294573643, "difficulty": "Hard", "likes": 4, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 398, "totalSubmissionRaw": 516}, "3062": {"acRate": 81.81444147294795, "difficulty": "Easy", "likes": 25, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7954, "totalSubmissionRaw": 9722}, "3063": {"acRate": 86.62006497981687, "difficulty": "Easy", "likes": 36, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8798, "totalSubmissionRaw": 10157}, "3064": {"acRate": 91.50052465897167, "difficulty": "Medium", "likes": 9, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 872, "totalSubmissionRaw": 953}, "3065": {"acRate": 85.4585374092214, "difficulty": "Easy", "likes": 75, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50600, "totalSubmissionRaw": 59210}, "3066": {"acRate": 27.25039748868686, "difficulty": "Medium", "likes": 80, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26737, "totalSubmissionRaw": 98116}, "3067": {"acRate": 57.59376921500308, "difficulty": "Medium", "likes": 171, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11240, "totalSubmissionRaw": 19516}, "3068": {"acRate": 67.44656013027654, "difficulty": "Hard", "likes": 604, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68753, "totalSubmissionRaw": 101937}, "3069": {"acRate": 71.97205960132042, "difficulty": "Easy", "likes": 70, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39460, "totalSubmissionRaw": 54828}, "3070": {"acRate": 59.11212704523581, "difficulty": "Medium", "likes": 124, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24567, "totalSubmissionRaw": 41560}, "3071": {"acRate": 62.05940136368889, "difficulty": "Medium", "likes": 83, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16110, "totalSubmissionRaw": 25959}, "3072": {"acRate": 26.812690978667504, "difficulty": "Hard", "likes": 126, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9389, "totalSubmissionRaw": 35017}, "3073": {"acRate": 42.39864864864865, "difficulty": "Medium", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 502, "totalSubmissionRaw": 1184}, "3074": {"acRate": 66.25575639860907, "difficulty": "Easy", "likes": 82, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42299, "totalSubmissionRaw": 63842}, "3075": {"acRate": 55.10267700580602, "difficulty": "Medium", "likes": 629, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169692, "totalSubmissionRaw": 307956}, "3076": {"acRate": 45.135692747182986, "difficulty": "Medium", "likes": 122, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19908, "totalSubmissionRaw": 44107}, "3077": {"acRate": 27.749304436960028, "difficulty": "Hard", "likes": 117, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5685, "totalSubmissionRaw": 20487}, "3078": {"acRate": 68.39186691312385, "difficulty": "Medium", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 370, "totalSubmissionRaw": 541}, "3079": {"acRate": 73.8450604122246, "difficulty": "Easy", "likes": 84, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39482, "totalSubmissionRaw": 53466}, "3080": {"acRate": 48.838336326577156, "difficulty": "Medium", "likes": 102, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17132, "totalSubmissionRaw": 35079}, "3081": {"acRate": 26.668549578517425, "difficulty": "Medium", "likes": 153, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12274, "totalSubmissionRaw": 46025}, "3082": {"acRate": 38.47258798180512, "difficulty": "Hard", "likes": 124, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6428, "totalSubmissionRaw": 16708}, "3083": {"acRate": 66.38196606412284, "difficulty": "Easy", "likes": 79, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40726, "totalSubmissionRaw": 61351}, "3084": {"acRate": 48.86300451946793, "difficulty": "Medium", "likes": 103, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3084", "paidOnly": false, "title": "Count Substrings Starting and Ending with Given Character", "titleSlug": "count-substrings-starting-and-ending-with-given-character", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34273, "totalSubmissionRaw": 70141}, "3085": {"acRate": 44.22341609796234, "difficulty": "Medium", "likes": 180, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3085", "paidOnly": false, "title": "Minimum Deletions to Make String K-Special", "titleSlug": "minimum-deletions-to-make-string-k-special", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18274, "totalSubmissionRaw": 41322}, "3086": {"acRate": 23.74759593369356, "difficulty": "Hard", "likes": 46, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2593, "totalSubmissionRaw": 10919}, "3087": {"acRate": 64.77611940298507, "difficulty": "Medium", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 651, "totalSubmissionRaw": 1005}, "3088": {"acRate": 54.645669291338585, "difficulty": "Hard", "likes": 7, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 347, "totalSubmissionRaw": 635}, "3089": {"acRate": 37.490317583268784, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 484, "totalSubmissionRaw": 1291}, "3090": {"acRate": 63.69050871537074, "difficulty": "Easy", "likes": 146, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34968, "totalSubmissionRaw": 54903}, "3091": {"acRate": 44.74339382908947, "difficulty": "Medium", "likes": 145, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26059, "totalSubmissionRaw": 58241}, "3092": {"acRate": 42.47689551112788, "difficulty": "Medium", "likes": 204, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18017, "totalSubmissionRaw": 42416}, "3093": {"acRate": 41.66666666666667, "difficulty": "Hard", "likes": 112, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8120, "totalSubmissionRaw": 19488}, "3094": {"acRate": 81.86915887850468, "difficulty": "Medium", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3094", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions II", "titleSlug": "guess-the-number-using-bitwise-questions-ii", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 438, "totalSubmissionRaw": 535}, "3095": {"acRate": 40.806090027901874, "difficulty": "Easy", "likes": 76, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25301, "totalSubmissionRaw": 62003}, "3096": {"acRate": 40.811026767878545, "difficulty": "Medium", "likes": 73, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20430, "totalSubmissionRaw": 50060}, "3097": {"acRate": 29.760375494071145, "difficulty": "Medium", "likes": 172, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3097", "paidOnly": false, "title": "Shortest Subarray With OR at Least K II", "titleSlug": "shortest-subarray-with-or-at-least-k-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12047, "totalSubmissionRaw": 40480}, "3098": {"acRate": 24.510506208213943, "difficulty": "Hard", "likes": 116, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4106, "totalSubmissionRaw": 16752}, "3099": {"acRate": 82.8811784181898, "difficulty": "Easy", "likes": 98, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49064, "totalSubmissionRaw": 59198}, "3100": {"acRate": 62.995547564003765, "difficulty": "Medium", "likes": 100, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29429, "totalSubmissionRaw": 46716}, "3101": {"acRate": 57.08897432626957, "difficulty": "Medium", "likes": 191, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31331, "totalSubmissionRaw": 54881}, "3102": {"acRate": 32.20324545338388, "difficulty": "Hard", "likes": 147, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7561, "totalSubmissionRaw": 23479}, "3103": {"acRate": 66.73427991886409, "difficulty": "Hard", "likes": 5, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 329, "totalSubmissionRaw": 493}, "3104": {"acRate": 59.13669064748201, "difficulty": "Hard", "likes": 7, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 411, "totalSubmissionRaw": 695}, "3105": {"acRate": 57.26386864114171, "difficulty": "Easy", "likes": 100, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37316, "totalSubmissionRaw": 65165}, "3106": {"acRate": 63.84971442492488, "difficulty": "Medium", "likes": 137, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23588, "totalSubmissionRaw": 36943}, "3107": {"acRate": 48.828755189399644, "difficulty": "Medium", "likes": 120, "dislikes": 173, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22700, "totalSubmissionRaw": 46489}, "3108": {"acRate": 46.23940908103411, "difficulty": "Hard", "likes": 165, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10642, "totalSubmissionRaw": 23015}, "3109": {"acRate": 42.994505494505496, "difficulty": "Medium", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 313, "totalSubmissionRaw": 728}, "3110": {"acRate": 94.43027533373787, "difficulty": "Easy", "likes": 484, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "3110", "paidOnly": false, "title": "Score of a String", "titleSlug": "score-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199194, "totalSubmissionRaw": 210943}, "3111": {"acRate": 64.288556949935, "difficulty": "Medium", "likes": 79, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24231, "totalSubmissionRaw": 37691}, "3112": {"acRate": 34.1331024140917, "difficulty": "Medium", "likes": 127, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16161, "totalSubmissionRaw": 47347}, "3113": {"acRate": 29.431109302956333, "difficulty": "Hard", "likes": 184, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8681, "totalSubmissionRaw": 29496}, "3114": {"acRate": 35.36906753443179, "difficulty": "Easy", "likes": 82, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30868, "totalSubmissionRaw": 87274}, "3115": {"acRate": 58.625556582374195, "difficulty": "Medium", "likes": 89, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34891, "totalSubmissionRaw": 59515}, "3116": {"acRate": 15.841387965388934, "difficulty": "Hard", "likes": 198, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7195, "totalSubmissionRaw": 45415}, "3117": {"acRate": 27.889240071458016, "difficulty": "Hard", "likes": 100, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3117", "paidOnly": false, "title": "Minimum Sum of Values by Dividing Array", "titleSlug": "minimum-sum-of-values-by-dividing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4059, "totalSubmissionRaw": 14554}, "3118": {"acRate": 57.61024182076814, "difficulty": "Medium", "likes": 3, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 405, "totalSubmissionRaw": 703}, "3119": {"acRate": 63.69230769230769, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3119", "paidOnly": true, "title": "Maximum Number of Potholes That Can Be Fixed", "titleSlug": "maximum-number-of-potholes-that-can-be-fixed", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 621, "totalSubmissionRaw": 975}, "3120": {"acRate": 65.43895563460634, "difficulty": "Easy", "likes": 110, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38999, "totalSubmissionRaw": 59596}, "3121": {"acRate": 41.482252249611626, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28305, "totalSubmissionRaw": 68234}, "3122": {"acRate": 41.473624575097574, "difficulty": "Medium", "likes": 196, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13170, "totalSubmissionRaw": 31764}, "3123": {"acRate": 51.02530095898796, "difficulty": "Hard", "likes": 197, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3123", "paidOnly": false, "title": "Find Edges in Shortest Paths", "titleSlug": "find-edges-in-shortest-paths", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10003, "totalSubmissionRaw": 19604}, "3124": {"acRate": 72.58522727272727, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511, "totalSubmissionRaw": 704}, "3125": {"acRate": 70.0152207001522, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3125", "paidOnly": true, "title": "Maximum Number That Makes Result of Bitwise AND Zero", "titleSlug": "maximum-number-that-makes-result-of-bitwise-and-zero", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 460, "totalSubmissionRaw": 657}, "3126": {"acRate": 47.94144556267155, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3126", "paidOnly": true, "title": "Server Utilization Time", "titleSlug": "server-utilization-time", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 524, "totalSubmissionRaw": 1093}, "3127": {"acRate": 50.79045702788157, "difficulty": "Easy", "likes": 58, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22971, "totalSubmissionRaw": 45227}, "3128": {"acRate": 47.39333837577387, "difficulty": "Medium", "likes": 91, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16918, "totalSubmissionRaw": 35697}, "3129": {"acRate": 27.10577864838394, "difficulty": "Medium", "likes": 96, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3129", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays I", "titleSlug": "find-all-possible-stable-binary-arrays-i", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6642, "totalSubmissionRaw": 24504}, "3130": {"acRate": 29.284797573211996, "difficulty": "Hard", "likes": 52, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2510, "totalSubmissionRaw": 8571}, "3131": {"acRate": 81.92050583731692, "difficulty": "Easy", "likes": 93, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43014, "totalSubmissionRaw": 52507}, "3132": {"acRate": 30.888309027166343, "difficulty": "Medium", "likes": 136, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3132", "paidOnly": false, "title": "Find the Integer Added to Array II", "titleSlug": "find-the-integer-added-to-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19295, "totalSubmissionRaw": 62467}, "3133": {"acRate": 37.85434467441932, "difficulty": "Medium", "likes": 181, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12272, "totalSubmissionRaw": 32419}, "3134": {"acRate": 28.528035963793208, "difficulty": "Hard", "likes": 116, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4695, "totalSubmissionRaw": 16460}, "3135": {"acRate": 58.72170439414115, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 441, "totalSubmissionRaw": 751}, "3136": {"acRate": 36.20717861466479, "difficulty": "Easy", "likes": 80, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33198, "totalSubmissionRaw": 91689}, "3137": {"acRate": 63.43739200552931, "difficulty": "Medium", "likes": 101, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22028, "totalSubmissionRaw": 34724}, "3138": {"acRate": 42.58192945511976, "difficulty": "Medium", "likes": 152, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25883, "totalSubmissionRaw": 60784}, "3139": {"acRate": 15.795795795795794, "difficulty": "Hard", "likes": 106, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3419, "totalSubmissionRaw": 21645}, "3140": {"acRate": 64.47811447811448, "difficulty": "Medium", "likes": 2, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3140", "paidOnly": true, "title": "Consecutive Available Seats II", "titleSlug": "consecutive-available-seats-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 383, "totalSubmissionRaw": 594}, "3141": {"acRate": 74.48275862068967, "difficulty": "Hard", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 324, "totalSubmissionRaw": 435}, "3142": {"acRate": 42.45296167247387, "difficulty": "Easy", "likes": 47, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3142", "paidOnly": false, "title": "Check if Grid Satisfies Conditions", "titleSlug": "check-if-grid-satisfies-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27413, "totalSubmissionRaw": 64573}, "3143": {"acRate": 38.515597350725514, "difficulty": "Medium", "likes": 126, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15236, "totalSubmissionRaw": 39558}, "3144": {"acRate": 40.62006035349906, "difficulty": "Medium", "likes": 101, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11306, "totalSubmissionRaw": 27835}, "3145": {"acRate": 25.43005517689062, "difficulty": "Hard", "likes": 46, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1567, "totalSubmissionRaw": 6162}, "3146": {"acRate": 89.64299806857593, "difficulty": "Easy", "likes": 78, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43164, "totalSubmissionRaw": 48151}, "3147": {"acRate": 40.011832883279226, "difficulty": "Medium", "likes": 129, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26374, "totalSubmissionRaw": 65917}, "3148": {"acRate": 48.40808372882422, "difficulty": "Medium", "likes": 192, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15402, "totalSubmissionRaw": 31817}, "3149": {"acRate": 23.21475800052896, "difficulty": "Hard", "likes": 85, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3511, "totalSubmissionRaw": 15124}, "3150": {"acRate": 91.25, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511, "totalSubmissionRaw": 560}, "3151": {"acRate": 75.82085354707164, "difficulty": "Easy", "likes": 61, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3151", "paidOnly": false, "title": "Special Array I", "titleSlug": "special-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43136, "totalSubmissionRaw": 56892}, "3152": {"acRate": 29.186108482613847, "difficulty": "Medium", "likes": 148, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26834, "totalSubmissionRaw": 91941}, "3153": {"acRate": 44.85665364183167, "difficulty": "Medium", "likes": 144, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3153", "paidOnly": false, "title": "Sum of Digit Differences of All Pairs", "titleSlug": "sum-of-digit-differences-of-all-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20433, "totalSubmissionRaw": 45548}, "3154": {"acRate": 36.145600370170435, "difficulty": "Hard", "likes": 110, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9374, "totalSubmissionRaw": 25934}, "3155": {"acRate": 55.42483660130719, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3155", "paidOnly": true, "title": "Maximum Number of Upgradable Servers", "titleSlug": "maximum-number-of-upgradable-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 424, "totalSubmissionRaw": 765}, "3156": {"acRate": 64.11764705882354, "difficulty": "Hard", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 218, "totalSubmissionRaw": 340}, "3157": {"acRate": 72.60869565217392, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 501, "totalSubmissionRaw": 690}, "3158": {"acRate": 83.32508903838544, "difficulty": "Easy", "likes": 60, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3158", "paidOnly": false, "title": "Find the XOR of Numbers Which Appear Twice", "titleSlug": "find-the-xor-of-numbers-which-appear-twice", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33690, "totalSubmissionRaw": 40432}, "3159": {"acRate": 74.47909926232691, "difficulty": "Medium", "likes": 75, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28775, "totalSubmissionRaw": 38635}, "3160": {"acRate": 40.70307448121804, "difficulty": "Medium", "likes": 86, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20769, "totalSubmissionRaw": 51030}, "3161": {"acRate": 12.07447658622343, "difficulty": "Hard", "likes": 70, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3022, "totalSubmissionRaw": 25028}, "3162": {"acRate": 86.55068861965414, "difficulty": "Easy", "likes": 66, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41791, "totalSubmissionRaw": 48285}, "3163": {"acRate": 55.7926530612245, "difficulty": "Medium", "likes": 91, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3163", "paidOnly": false, "title": "String Compression III", "titleSlug": "string-compression-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34172, "totalSubmissionRaw": 61247}, "3164": {"acRate": 24.7656775015032, "difficulty": "Medium", "likes": 171, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21003, "totalSubmissionRaw": 84815}, "3165": {"acRate": 17.0028289062787, "difficulty": "Hard", "likes": 77, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4628, "totalSubmissionRaw": 27219}, "3166": {"acRate": 65.41554959785523, "difficulty": "Medium", "likes": 2, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 244, "totalSubmissionRaw": 373}, "3167": {"acRate": 87.10691823899371, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3167", "paidOnly": true, "title": "Better Compression of String", "titleSlug": "better-compression-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 554, "totalSubmissionRaw": 636}, "3168": {"acRate": 80.38539386178694, "difficulty": "Easy", "likes": 70, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38916, "totalSubmissionRaw": 48411}, "3169": {"acRate": 32.53662884222425, "difficulty": "Medium", "likes": 141, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29934, "totalSubmissionRaw": 92002}, "3170": {"acRate": 34.845569794207584, "difficulty": "Medium", "likes": 147, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3170", "paidOnly": false, "title": "Lexicographically Minimum String After Removing Stars", "titleSlug": "lexicographically-minimum-string-after-removing-stars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20285, "totalSubmissionRaw": 58214}, "3171": {"acRate": 30.889069858017915, "difficulty": "Hard", "likes": 125, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise AND Closest to K", "titleSlug": "find-subarray-with-bitwise-and-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8722, "totalSubmissionRaw": 28241}, "3172": {"acRate": 87.0, "difficulty": "Easy", "likes": 2, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 174, "totalSubmissionRaw": 200}, "3173": {"acRate": 99.21259842519686, "difficulty": "Easy", "likes": 0, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 121, "totalSubmissionRaw": 122}}
\ No newline at end of file